/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:33:46,142 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:33:46,146 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:33:46,166 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:33:46,167 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:33:46,169 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:33:46,171 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:33:46,183 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:33:46,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:33:46,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:33:46,186 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:33:46,189 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:33:46,189 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:33:46,192 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:33:46,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:33:46,197 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:33:46,198 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:33:46,201 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:33:46,203 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:33:46,208 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:33:46,213 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:33:46,217 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:33:46,218 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:33:46,219 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:33:46,222 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:33:46,222 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:33:46,222 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:33:46,224 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:33:46,225 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:33:46,226 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:33:46,226 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:33:46,228 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:33:46,228 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:33:46,229 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:33:46,230 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:33:46,231 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:33:46,231 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:33:46,231 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:33:46,232 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:33:46,234 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:33:46,235 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:33:46,236 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 17:33:46,254 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:33:46,254 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:33:46,256 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:33:46,256 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:33:46,256 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:33:46,256 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:33:46,256 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:33:46,257 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:33:46,257 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:33:46,257 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:33:46,257 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:33:46,257 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:33:46,258 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:33:46,258 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:33:46,258 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:33:46,258 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:33:46,258 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:33:46,259 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:33:46,259 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:33:46,259 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:33:46,259 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:33:46,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:33:46,260 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:33:46,260 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:33:46,260 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:33:46,260 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:33:46,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:33:46,261 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:33:46,261 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:33:46,513 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:33:46,533 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:33:46,536 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:33:46,538 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:33:46,538 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:33:46,539 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_tso.opt.i [2019-12-18 17:33:46,598 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b41d301d6/002b88568b034eba85556fdd8c85f3b1/FLAG76cf2ab72 [2019-12-18 17:33:47,166 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:33:47,167 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_tso.opt.i [2019-12-18 17:33:47,182 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b41d301d6/002b88568b034eba85556fdd8c85f3b1/FLAG76cf2ab72 [2019-12-18 17:33:47,439 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b41d301d6/002b88568b034eba85556fdd8c85f3b1 [2019-12-18 17:33:47,448 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:33:47,450 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:33:47,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:33:47,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:33:47,454 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:33:47,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:33:47" (1/1) ... [2019-12-18 17:33:47,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e73aeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:47, skipping insertion in model container [2019-12-18 17:33:47,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:33:47" (1/1) ... [2019-12-18 17:33:47,466 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:33:47,524 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:33:48,023 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:33:48,040 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:33:48,124 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:33:48,208 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:33:48,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:48 WrapperNode [2019-12-18 17:33:48,209 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:33:48,209 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:33:48,210 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:33:48,210 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:33:48,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:48" (1/1) ... [2019-12-18 17:33:48,239 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:48" (1/1) ... [2019-12-18 17:33:48,279 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:33:48,279 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:33:48,279 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:33:48,280 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:33:48,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:48" (1/1) ... [2019-12-18 17:33:48,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:48" (1/1) ... [2019-12-18 17:33:48,293 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:48" (1/1) ... [2019-12-18 17:33:48,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:48" (1/1) ... [2019-12-18 17:33:48,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:48" (1/1) ... [2019-12-18 17:33:48,313 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:48" (1/1) ... [2019-12-18 17:33:48,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:48" (1/1) ... [2019-12-18 17:33:48,322 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:33:48,323 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:33:48,323 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:33:48,323 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:33:48,324 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:48" (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 17:33:48,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:33:48,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:33:48,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:33:48,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:33:48,407 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:33:48,407 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:33:48,407 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:33:48,407 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:33:48,408 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:33:48,408 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:33:48,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:33:48,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:33:48,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:33:48,411 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 17:33:49,184 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:33:49,184 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:33:49,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:33:49 BoogieIcfgContainer [2019-12-18 17:33:49,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:33:49,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:33:49,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:33:49,190 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:33:49,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:33:47" (1/3) ... [2019-12-18 17:33:49,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@252f6c68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:33:49, skipping insertion in model container [2019-12-18 17:33:49,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:48" (2/3) ... [2019-12-18 17:33:49,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@252f6c68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:33:49, skipping insertion in model container [2019-12-18 17:33:49,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:33:49" (3/3) ... [2019-12-18 17:33:49,194 INFO L109 eAbstractionObserver]: Analyzing ICFG mix045_tso.opt.i [2019-12-18 17:33:49,204 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:33:49,205 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:33:49,212 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:33:49,213 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:33:49,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,249 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,250 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,251 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,252 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,260 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,261 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,261 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,262 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,262 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,273 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,274 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,275 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,279 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,279 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,282 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,283 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:49,317 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 17:33:49,337 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:33:49,337 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:33:49,338 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:33:49,338 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:33:49,338 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:33:49,338 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:33:49,338 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:33:49,338 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:33:49,359 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-18 17:33:49,360 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 17:33:49,439 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 17:33:49,439 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:33:49,453 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 272 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 17:33:49,472 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 17:33:49,518 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 17:33:49,518 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:33:49,524 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 272 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 17:33:49,539 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 17:33:49,540 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:33:52,213 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2019-12-18 17:33:54,338 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 17:33:54,479 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 17:33:54,508 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46792 [2019-12-18 17:33:54,509 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-18 17:33:54,512 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 91 transitions [2019-12-18 17:33:55,372 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 16134 states. [2019-12-18 17:33:55,374 INFO L276 IsEmpty]: Start isEmpty. Operand 16134 states. [2019-12-18 17:33:55,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 17:33:55,380 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:33:55,380 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:33:55,381 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:33:55,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:33:55,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1643101290, now seen corresponding path program 1 times [2019-12-18 17:33:55,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:33:55,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646927284] [2019-12-18 17:33:55,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:33:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:33:55,658 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 17:33:55,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646927284] [2019-12-18 17:33:55,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:33:55,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:33:55,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800323041] [2019-12-18 17:33:55,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:33:55,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:33:55,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:33:55,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:33:55,679 INFO L87 Difference]: Start difference. First operand 16134 states. Second operand 3 states. [2019-12-18 17:33:56,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:33:56,072 INFO L93 Difference]: Finished difference Result 16034 states and 60310 transitions. [2019-12-18 17:33:56,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:33:56,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 17:33:56,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:33:56,271 INFO L225 Difference]: With dead ends: 16034 [2019-12-18 17:33:56,271 INFO L226 Difference]: Without dead ends: 15698 [2019-12-18 17:33:56,272 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 17:33:57,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15698 states. [2019-12-18 17:33:57,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15698 to 15698. [2019-12-18 17:33:57,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15698 states. [2019-12-18 17:33:57,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15698 states to 15698 states and 59106 transitions. [2019-12-18 17:33:57,591 INFO L78 Accepts]: Start accepts. Automaton has 15698 states and 59106 transitions. Word has length 7 [2019-12-18 17:33:57,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:33:57,593 INFO L462 AbstractCegarLoop]: Abstraction has 15698 states and 59106 transitions. [2019-12-18 17:33:57,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:33:57,593 INFO L276 IsEmpty]: Start isEmpty. Operand 15698 states and 59106 transitions. [2019-12-18 17:33:57,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:33:57,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:33:57,604 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:33:57,605 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:33:57,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:33:57,605 INFO L82 PathProgramCache]: Analyzing trace with hash 565568960, now seen corresponding path program 1 times [2019-12-18 17:33:57,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:33:57,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337288113] [2019-12-18 17:33:57,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:33:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:33:57,725 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 17:33:57,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337288113] [2019-12-18 17:33:57,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:33:57,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:33:57,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82632701] [2019-12-18 17:33:57,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:33:57,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:33:57,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:33:57,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:33:57,730 INFO L87 Difference]: Start difference. First operand 15698 states and 59106 transitions. Second operand 4 states. [2019-12-18 17:33:58,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:33:58,599 INFO L93 Difference]: Finished difference Result 24414 states and 88322 transitions. [2019-12-18 17:33:58,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:33:58,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 17:33:58,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:33:58,706 INFO L225 Difference]: With dead ends: 24414 [2019-12-18 17:33:58,706 INFO L226 Difference]: Without dead ends: 24400 [2019-12-18 17:33:58,707 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 17:33:58,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24400 states. [2019-12-18 17:33:59,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24400 to 22284. [2019-12-18 17:33:59,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22284 states. [2019-12-18 17:33:59,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22284 states to 22284 states and 81513 transitions. [2019-12-18 17:33:59,625 INFO L78 Accepts]: Start accepts. Automaton has 22284 states and 81513 transitions. Word has length 13 [2019-12-18 17:33:59,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:33:59,625 INFO L462 AbstractCegarLoop]: Abstraction has 22284 states and 81513 transitions. [2019-12-18 17:33:59,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:33:59,626 INFO L276 IsEmpty]: Start isEmpty. Operand 22284 states and 81513 transitions. [2019-12-18 17:33:59,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:33:59,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:33:59,627 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:33:59,628 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:33:59,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:33:59,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1863901117, now seen corresponding path program 1 times [2019-12-18 17:33:59,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:33:59,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956869533] [2019-12-18 17:33:59,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:33:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:33:59,671 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 17:33:59,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956869533] [2019-12-18 17:33:59,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:33:59,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:33:59,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983693666] [2019-12-18 17:33:59,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:33:59,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:33:59,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:33:59,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:33:59,674 INFO L87 Difference]: Start difference. First operand 22284 states and 81513 transitions. Second operand 3 states. [2019-12-18 17:33:59,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:33:59,737 INFO L93 Difference]: Finished difference Result 12731 states and 40311 transitions. [2019-12-18 17:33:59,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:33:59,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 17:33:59,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:33:59,781 INFO L225 Difference]: With dead ends: 12731 [2019-12-18 17:33:59,781 INFO L226 Difference]: Without dead ends: 12731 [2019-12-18 17:33:59,782 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 17:33:59,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12731 states. [2019-12-18 17:34:00,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12731 to 12731. [2019-12-18 17:34:00,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12731 states. [2019-12-18 17:34:00,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12731 states to 12731 states and 40311 transitions. [2019-12-18 17:34:00,991 INFO L78 Accepts]: Start accepts. Automaton has 12731 states and 40311 transitions. Word has length 13 [2019-12-18 17:34:00,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:34:00,994 INFO L462 AbstractCegarLoop]: Abstraction has 12731 states and 40311 transitions. [2019-12-18 17:34:00,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:34:00,995 INFO L276 IsEmpty]: Start isEmpty. Operand 12731 states and 40311 transitions. [2019-12-18 17:34:00,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 17:34:00,999 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:00,999 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:34:00,999 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:01,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:01,001 INFO L82 PathProgramCache]: Analyzing trace with hash -709244429, now seen corresponding path program 1 times [2019-12-18 17:34:01,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:01,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743542826] [2019-12-18 17:34:01,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:34:01,082 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 17:34:01,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743542826] [2019-12-18 17:34:01,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:34:01,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:34:01,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559862240] [2019-12-18 17:34:01,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:34:01,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:34:01,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:34:01,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:34:01,087 INFO L87 Difference]: Start difference. First operand 12731 states and 40311 transitions. Second operand 4 states. [2019-12-18 17:34:01,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:34:01,109 INFO L93 Difference]: Finished difference Result 1935 states and 4522 transitions. [2019-12-18 17:34:01,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:34:01,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 17:34:01,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:34:01,114 INFO L225 Difference]: With dead ends: 1935 [2019-12-18 17:34:01,114 INFO L226 Difference]: Without dead ends: 1935 [2019-12-18 17:34:01,115 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 17:34:01,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-12-18 17:34:01,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1935. [2019-12-18 17:34:01,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-12-18 17:34:01,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 4522 transitions. [2019-12-18 17:34:01,146 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 4522 transitions. Word has length 14 [2019-12-18 17:34:01,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:34:01,146 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 4522 transitions. [2019-12-18 17:34:01,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:34:01,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 4522 transitions. [2019-12-18 17:34:01,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 17:34:01,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:01,148 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] [2019-12-18 17:34:01,148 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:01,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:01,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1471989024, now seen corresponding path program 1 times [2019-12-18 17:34:01,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:01,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951707110] [2019-12-18 17:34:01,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:34:01,242 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 17:34:01,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951707110] [2019-12-18 17:34:01,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:34:01,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:34:01,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952480321] [2019-12-18 17:34:01,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:34:01,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:34:01,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:34:01,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:34:01,244 INFO L87 Difference]: Start difference. First operand 1935 states and 4522 transitions. Second operand 5 states. [2019-12-18 17:34:01,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:34:01,268 INFO L93 Difference]: Finished difference Result 652 states and 1532 transitions. [2019-12-18 17:34:01,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:34:01,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 17:34:01,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:34:01,270 INFO L225 Difference]: With dead ends: 652 [2019-12-18 17:34:01,270 INFO L226 Difference]: Without dead ends: 652 [2019-12-18 17:34:01,271 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 17:34:01,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-12-18 17:34:01,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 596. [2019-12-18 17:34:01,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-12-18 17:34:01,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1400 transitions. [2019-12-18 17:34:01,282 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1400 transitions. Word has length 26 [2019-12-18 17:34:01,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:34:01,282 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 1400 transitions. [2019-12-18 17:34:01,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:34:01,282 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1400 transitions. [2019-12-18 17:34:01,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:34:01,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:01,287 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] [2019-12-18 17:34:01,287 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:01,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:01,288 INFO L82 PathProgramCache]: Analyzing trace with hash 827870922, now seen corresponding path program 1 times [2019-12-18 17:34:01,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:01,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567630634] [2019-12-18 17:34:01,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:34:01,365 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 17:34:01,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567630634] [2019-12-18 17:34:01,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:34:01,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:34:01,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047944894] [2019-12-18 17:34:01,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:34:01,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:34:01,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:34:01,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:34:01,370 INFO L87 Difference]: Start difference. First operand 596 states and 1400 transitions. Second operand 3 states. [2019-12-18 17:34:01,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:34:01,428 INFO L93 Difference]: Finished difference Result 608 states and 1417 transitions. [2019-12-18 17:34:01,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:34:01,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 17:34:01,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:34:01,431 INFO L225 Difference]: With dead ends: 608 [2019-12-18 17:34:01,431 INFO L226 Difference]: Without dead ends: 608 [2019-12-18 17:34:01,432 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 17:34:01,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-12-18 17:34:01,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 604. [2019-12-18 17:34:01,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-18 17:34:01,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1413 transitions. [2019-12-18 17:34:01,446 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1413 transitions. Word has length 55 [2019-12-18 17:34:01,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:34:01,447 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1413 transitions. [2019-12-18 17:34:01,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:34:01,447 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1413 transitions. [2019-12-18 17:34:01,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:34:01,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:01,449 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] [2019-12-18 17:34:01,449 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:01,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:01,450 INFO L82 PathProgramCache]: Analyzing trace with hash -345025503, now seen corresponding path program 1 times [2019-12-18 17:34:01,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:01,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829166461] [2019-12-18 17:34:01,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:34:01,534 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 17:34:01,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829166461] [2019-12-18 17:34:01,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:34:01,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:34:01,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939831960] [2019-12-18 17:34:01,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:34:01,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:34:01,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:34:01,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:34:01,540 INFO L87 Difference]: Start difference. First operand 604 states and 1413 transitions. Second operand 3 states. [2019-12-18 17:34:01,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:34:01,580 INFO L93 Difference]: Finished difference Result 608 states and 1410 transitions. [2019-12-18 17:34:01,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:34:01,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 17:34:01,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:34:01,582 INFO L225 Difference]: With dead ends: 608 [2019-12-18 17:34:01,582 INFO L226 Difference]: Without dead ends: 608 [2019-12-18 17:34:01,583 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 17:34:01,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-12-18 17:34:01,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 604. [2019-12-18 17:34:01,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-18 17:34:01,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1406 transitions. [2019-12-18 17:34:01,595 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1406 transitions. Word has length 55 [2019-12-18 17:34:01,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:34:01,595 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1406 transitions. [2019-12-18 17:34:01,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:34:01,596 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1406 transitions. [2019-12-18 17:34:01,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:34:01,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:01,597 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] [2019-12-18 17:34:01,597 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:01,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:01,598 INFO L82 PathProgramCache]: Analyzing trace with hash -349465323, now seen corresponding path program 1 times [2019-12-18 17:34:01,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:01,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901855831] [2019-12-18 17:34:01,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:34:01,699 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 17:34:01,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901855831] [2019-12-18 17:34:01,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:34:01,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:34:01,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832200922] [2019-12-18 17:34:01,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:34:01,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:34:01,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:34:01,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:34:01,701 INFO L87 Difference]: Start difference. First operand 604 states and 1406 transitions. Second operand 5 states. [2019-12-18 17:34:01,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:34:01,912 INFO L93 Difference]: Finished difference Result 893 states and 2078 transitions. [2019-12-18 17:34:01,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:34:01,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-18 17:34:01,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:34:01,914 INFO L225 Difference]: With dead ends: 893 [2019-12-18 17:34:01,915 INFO L226 Difference]: Without dead ends: 893 [2019-12-18 17:34:01,915 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 17:34:01,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-12-18 17:34:01,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 718. [2019-12-18 17:34:01,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2019-12-18 17:34:01,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1687 transitions. [2019-12-18 17:34:01,934 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1687 transitions. Word has length 55 [2019-12-18 17:34:01,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:34:01,934 INFO L462 AbstractCegarLoop]: Abstraction has 718 states and 1687 transitions. [2019-12-18 17:34:01,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:34:01,934 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1687 transitions. [2019-12-18 17:34:01,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:34:01,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:01,940 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] [2019-12-18 17:34:01,941 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:01,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:01,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1055549477, now seen corresponding path program 2 times [2019-12-18 17:34:01,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:01,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714779059] [2019-12-18 17:34:01,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:34:02,199 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 17:34:02,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714779059] [2019-12-18 17:34:02,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:34:02,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:34:02,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683368612] [2019-12-18 17:34:02,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:34:02,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:34:02,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:34:02,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:34:02,203 INFO L87 Difference]: Start difference. First operand 718 states and 1687 transitions. Second operand 6 states. [2019-12-18 17:34:02,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:34:02,501 INFO L93 Difference]: Finished difference Result 989 states and 2304 transitions. [2019-12-18 17:34:02,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:34:02,502 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-18 17:34:02,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:34:02,508 INFO L225 Difference]: With dead ends: 989 [2019-12-18 17:34:02,508 INFO L226 Difference]: Without dead ends: 989 [2019-12-18 17:34:02,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:34:02,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2019-12-18 17:34:02,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 780. [2019-12-18 17:34:02,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-12-18 17:34:02,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1832 transitions. [2019-12-18 17:34:02,522 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1832 transitions. Word has length 55 [2019-12-18 17:34:02,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:34:02,522 INFO L462 AbstractCegarLoop]: Abstraction has 780 states and 1832 transitions. [2019-12-18 17:34:02,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:34:02,522 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1832 transitions. [2019-12-18 17:34:02,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:34:02,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:02,525 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] [2019-12-18 17:34:02,525 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:02,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:02,526 INFO L82 PathProgramCache]: Analyzing trace with hash -2089737911, now seen corresponding path program 3 times [2019-12-18 17:34:02,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:02,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256982309] [2019-12-18 17:34:02,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:34:02,612 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 17:34:02,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256982309] [2019-12-18 17:34:02,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:34:02,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:34:02,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489927733] [2019-12-18 17:34:02,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:34:02,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:34:02,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:34:02,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:34:02,614 INFO L87 Difference]: Start difference. First operand 780 states and 1832 transitions. Second operand 6 states. [2019-12-18 17:34:02,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:34:02,929 INFO L93 Difference]: Finished difference Result 1297 states and 3013 transitions. [2019-12-18 17:34:02,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:34:02,930 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-18 17:34:02,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:34:02,931 INFO L225 Difference]: With dead ends: 1297 [2019-12-18 17:34:02,932 INFO L226 Difference]: Without dead ends: 1297 [2019-12-18 17:34:02,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:34:02,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2019-12-18 17:34:02,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 840. [2019-12-18 17:34:02,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-12-18 17:34:02,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1982 transitions. [2019-12-18 17:34:02,947 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1982 transitions. Word has length 55 [2019-12-18 17:34:02,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:34:02,947 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1982 transitions. [2019-12-18 17:34:02,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:34:02,948 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1982 transitions. [2019-12-18 17:34:02,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:34:02,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:02,950 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] [2019-12-18 17:34:02,951 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:02,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:02,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1513553193, now seen corresponding path program 4 times [2019-12-18 17:34:02,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:02,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606971270] [2019-12-18 17:34:02,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:34:03,003 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 17:34:03,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606971270] [2019-12-18 17:34:03,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:34:03,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:34:03,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337985014] [2019-12-18 17:34:03,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:34:03,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:34:03,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:34:03,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:34:03,005 INFO L87 Difference]: Start difference. First operand 840 states and 1982 transitions. Second operand 3 states. [2019-12-18 17:34:03,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:34:03,018 INFO L93 Difference]: Finished difference Result 738 states and 1699 transitions. [2019-12-18 17:34:03,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:34:03,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 17:34:03,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:34:03,019 INFO L225 Difference]: With dead ends: 738 [2019-12-18 17:34:03,019 INFO L226 Difference]: Without dead ends: 738 [2019-12-18 17:34:03,020 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 17:34:03,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-12-18 17:34:03,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2019-12-18 17:34:03,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-12-18 17:34:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1699 transitions. [2019-12-18 17:34:03,030 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1699 transitions. Word has length 55 [2019-12-18 17:34:03,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:34:03,030 INFO L462 AbstractCegarLoop]: Abstraction has 738 states and 1699 transitions. [2019-12-18 17:34:03,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:34:03,030 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1699 transitions. [2019-12-18 17:34:03,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 17:34:03,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:03,033 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] [2019-12-18 17:34:03,033 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:03,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:03,033 INFO L82 PathProgramCache]: Analyzing trace with hash -272893927, now seen corresponding path program 1 times [2019-12-18 17:34:03,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:03,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771637785] [2019-12-18 17:34:03,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:34:03,184 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 17:34:03,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771637785] [2019-12-18 17:34:03,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:34:03,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:34:03,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837699529] [2019-12-18 17:34:03,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:34:03,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:34:03,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:34:03,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:34:03,187 INFO L87 Difference]: Start difference. First operand 738 states and 1699 transitions. Second operand 6 states. [2019-12-18 17:34:03,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:34:03,249 INFO L93 Difference]: Finished difference Result 1067 states and 2287 transitions. [2019-12-18 17:34:03,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:34:03,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-18 17:34:03,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:34:03,251 INFO L225 Difference]: With dead ends: 1067 [2019-12-18 17:34:03,251 INFO L226 Difference]: Without dead ends: 676 [2019-12-18 17:34:03,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:34:03,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2019-12-18 17:34:03,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 676. [2019-12-18 17:34:03,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-12-18 17:34:03,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 1520 transitions. [2019-12-18 17:34:03,263 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 1520 transitions. Word has length 56 [2019-12-18 17:34:03,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:34:03,264 INFO L462 AbstractCegarLoop]: Abstraction has 676 states and 1520 transitions. [2019-12-18 17:34:03,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:34:03,264 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 1520 transitions. [2019-12-18 17:34:03,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 17:34:03,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:03,267 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] [2019-12-18 17:34:03,267 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:03,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:03,267 INFO L82 PathProgramCache]: Analyzing trace with hash 332964395, now seen corresponding path program 2 times [2019-12-18 17:34:03,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:03,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012779220] [2019-12-18 17:34:03,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:34:03,453 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 17:34:03,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012779220] [2019-12-18 17:34:03,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:34:03,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:34:03,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130951070] [2019-12-18 17:34:03,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:34:03,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:34:03,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:34:03,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:34:03,460 INFO L87 Difference]: Start difference. First operand 676 states and 1520 transitions. Second operand 6 states. [2019-12-18 17:34:03,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:34:03,532 INFO L93 Difference]: Finished difference Result 1071 states and 2293 transitions. [2019-12-18 17:34:03,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:34:03,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-18 17:34:03,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:34:03,533 INFO L225 Difference]: With dead ends: 1071 [2019-12-18 17:34:03,533 INFO L226 Difference]: Without dead ends: 384 [2019-12-18 17:34:03,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:34:03,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-12-18 17:34:03,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 336. [2019-12-18 17:34:03,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-12-18 17:34:03,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 593 transitions. [2019-12-18 17:34:03,539 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 593 transitions. Word has length 56 [2019-12-18 17:34:03,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:34:03,540 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 593 transitions. [2019-12-18 17:34:03,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:34:03,540 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 593 transitions. [2019-12-18 17:34:03,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 17:34:03,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:03,541 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] [2019-12-18 17:34:03,541 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:03,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:03,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1122602959, now seen corresponding path program 3 times [2019-12-18 17:34:03,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:03,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836607789] [2019-12-18 17:34:03,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:34:03,602 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 17:34:03,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836607789] [2019-12-18 17:34:03,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:34:03,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:34:03,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008029919] [2019-12-18 17:34:03,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:34:03,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:34:03,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:34:03,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:34:03,604 INFO L87 Difference]: Start difference. First operand 336 states and 593 transitions. Second operand 3 states. [2019-12-18 17:34:03,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:34:03,640 INFO L93 Difference]: Finished difference Result 336 states and 592 transitions. [2019-12-18 17:34:03,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:34:03,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 17:34:03,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:34:03,642 INFO L225 Difference]: With dead ends: 336 [2019-12-18 17:34:03,642 INFO L226 Difference]: Without dead ends: 336 [2019-12-18 17:34:03,642 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 17:34:03,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-12-18 17:34:03,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 209. [2019-12-18 17:34:03,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-12-18 17:34:03,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 361 transitions. [2019-12-18 17:34:03,646 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 361 transitions. Word has length 56 [2019-12-18 17:34:03,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:34:03,646 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 361 transitions. [2019-12-18 17:34:03,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:34:03,647 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 361 transitions. [2019-12-18 17:34:03,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:34:03,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:03,648 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 17:34:03,648 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:03,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:03,648 INFO L82 PathProgramCache]: Analyzing trace with hash -876750572, now seen corresponding path program 1 times [2019-12-18 17:34:03,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:03,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29191124] [2019-12-18 17:34:03,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:34:04,231 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 17:34:04,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29191124] [2019-12-18 17:34:04,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:34:04,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 17:34:04,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511366759] [2019-12-18 17:34:04,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 17:34:04,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:34:04,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 17:34:04,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-12-18 17:34:04,233 INFO L87 Difference]: Start difference. First operand 209 states and 361 transitions. Second operand 19 states. [2019-12-18 17:34:06,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:34:06,118 INFO L93 Difference]: Finished difference Result 560 states and 953 transitions. [2019-12-18 17:34:06,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 17:34:06,118 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2019-12-18 17:34:06,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:34:06,120 INFO L225 Difference]: With dead ends: 560 [2019-12-18 17:34:06,120 INFO L226 Difference]: Without dead ends: 525 [2019-12-18 17:34:06,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=300, Invalid=1506, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 17:34:06,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-12-18 17:34:06,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 315. [2019-12-18 17:34:06,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-12-18 17:34:06,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 542 transitions. [2019-12-18 17:34:06,127 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 542 transitions. Word has length 57 [2019-12-18 17:34:06,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:34:06,127 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 542 transitions. [2019-12-18 17:34:06,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 17:34:06,127 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 542 transitions. [2019-12-18 17:34:06,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:34:06,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:06,129 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 17:34:06,129 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:06,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:06,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1024009672, now seen corresponding path program 2 times [2019-12-18 17:34:06,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:06,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466282478] [2019-12-18 17:34:06,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:34:06,339 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 17:34:06,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466282478] [2019-12-18 17:34:06,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:34:06,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 17:34:06,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54718906] [2019-12-18 17:34:06,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 17:34:06,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:34:06,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 17:34:06,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:34:06,343 INFO L87 Difference]: Start difference. First operand 315 states and 542 transitions. Second operand 12 states. [2019-12-18 17:34:06,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:34:06,834 INFO L93 Difference]: Finished difference Result 546 states and 913 transitions. [2019-12-18 17:34:06,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 17:34:06,835 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-18 17:34:06,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:34:06,836 INFO L225 Difference]: With dead ends: 546 [2019-12-18 17:34:06,836 INFO L226 Difference]: Without dead ends: 513 [2019-12-18 17:34:06,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-12-18 17:34:06,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-12-18 17:34:06,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 343. [2019-12-18 17:34:06,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-12-18 17:34:06,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 596 transitions. [2019-12-18 17:34:06,850 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 596 transitions. Word has length 57 [2019-12-18 17:34:06,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:34:06,850 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 596 transitions. [2019-12-18 17:34:06,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 17:34:06,850 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 596 transitions. [2019-12-18 17:34:06,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:34:06,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:34:06,851 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 17:34:06,852 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:34:06,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:34:06,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1963724718, now seen corresponding path program 3 times [2019-12-18 17:34:06,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:34:06,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482371554] [2019-12-18 17:34:06,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:34:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:34:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:34:07,015 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:34:07,015 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:34:07,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1214~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1214~0.base_25|) |v_ULTIMATE.start_main_~#t1214~0.offset_19| 0)) |v_#memory_int_21|) (= 0 v_~y$w_buff0~0_225) (= v_~x~0_72 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd1~0_30 0) (= 0 v_~__unbuffered_cnt~0_82) (= v_~y$w_buff1_used~0_382 0) (= |v_#NULL.offset_6| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1214~0.base_25| 4)) (= v_~y$read_delayed~0_7 0) (= v_~__unbuffered_p2_EBX~0_120 0) (= 0 v_~y$r_buff1_thd2~0_163) (= v_~y$r_buff1_thd1~0_106 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~y$r_buff0_thd3~0_195) (= 0 v_~y$r_buff0_thd2~0_108) (= 0 v_~y$flush_delayed~0_58) (= 0 |v_#NULL.base_6|) (= v_~z~0_106 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1214~0.base_25|) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$w_buff1~0_183 0) (= v_~y$mem_tmp~0_20 0) (= 0 v_~__unbuffered_p2_EAX~0_120) (= v_~main$tmp_guard1~0_32 0) (= 0 v_~weak$$choice0~0_16) (= (store .cse0 |v_ULTIMATE.start_main_~#t1214~0.base_25| 1) |v_#valid_62|) (= v_~a~0_45 0) (= v_~y~0_155 0) (= 0 v_~y$r_buff1_thd3~0_156) (= v_~y$r_buff0_thd0~0_325 0) (= v_~weak$$choice2~0_108 0) (= v_~y$r_buff1_thd0~0_281 0) (= v_~y$w_buff0_used~0_625 0) (= 0 |v_ULTIMATE.start_main_~#t1214~0.offset_19|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1214~0.base_25|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1216~0.base=|v_ULTIMATE.start_main_~#t1216~0.base_25|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_37|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_22|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_28|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_45|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_26|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_45|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_45, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_156, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_30, ~y$flush_delayed~0=v_~y$flush_delayed~0_58, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_120, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_120, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_26|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_24|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_37|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_38|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_48|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_68|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~y$w_buff1~0=v_~y$w_buff1~0_183, ULTIMATE.start_main_~#t1215~0.offset=|v_ULTIMATE.start_main_~#t1215~0.offset_19|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ULTIMATE.start_main_~#t1216~0.offset=|v_ULTIMATE.start_main_~#t1216~0.offset_19|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_281, ~x~0=v_~x~0_72, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_625, ULTIMATE.start_main_~#t1214~0.offset=|v_ULTIMATE.start_main_~#t1214~0.offset_19|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_41|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_67|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_28|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_106|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_33|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_38|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_53|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_106, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_24|, ~y$w_buff0~0=v_~y$w_buff0~0_225, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_195, ~y~0=v_~y~0_155, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_28|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_24|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_47|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_48|, ULTIMATE.start_main_~#t1215~0.base=|v_ULTIMATE.start_main_~#t1215~0.base_25|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_29|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_163, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_~#t1214~0.base=|v_ULTIMATE.start_main_~#t1214~0.base_25|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_325, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_106, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_382} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1216~0.base, ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ULTIMATE.start_main_~#t1215~0.offset, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1216~0.offset, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t1214~0.offset, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_~#t1215~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1214~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 17:34:07,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L810-1-->L812: Formula: (and (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1215~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t1215~0.base_13| 0)) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1215~0.base_13|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1215~0.base_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1215~0.base_13| 4)) (= 0 |v_ULTIMATE.start_main_~#t1215~0.offset_11|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1215~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1215~0.base_13|) |v_ULTIMATE.start_main_~#t1215~0.offset_11| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1215~0.offset=|v_ULTIMATE.start_main_~#t1215~0.offset_11|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1215~0.base=|v_ULTIMATE.start_main_~#t1215~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1215~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1215~0.base] because there is no mapped edge [2019-12-18 17:34:07,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L812-1-->L814: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1216~0.base_13|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1216~0.base_13| 1)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1216~0.base_13|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1216~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1216~0.base_13|) |v_ULTIMATE.start_main_~#t1216~0.offset_11| 2)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1216~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1216~0.offset_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1216~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1216~0.base=|v_ULTIMATE.start_main_~#t1216~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1216~0.offset=|v_ULTIMATE.start_main_~#t1216~0.offset_11|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1216~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1216~0.offset, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-18 17:34:07,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] P2ENTRY-->L4-3: Formula: (and (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_12|) (= v_~y$w_buff0~0_33 v_~y$w_buff1~0_29) (= v_~y$w_buff0_used~0_130 1) (= |v_P2Thread1of1ForFork0_#in~arg.base_12| v_P2Thread1of1ForFork0_~arg.base_12) (= 0 (mod v_~y$w_buff1_used~0_75 256)) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_12|) (= 2 v_~y$w_buff0~0_32) (= v_~y$w_buff1_used~0_75 v_~y$w_buff0_used~0_131) (= |v_P2Thread1of1ForFork0_#in~arg.offset_12| v_P2Thread1of1ForFork0_~arg.offset_12)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_12|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_131, ~y$w_buff0~0=v_~y$w_buff0~0_33, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_12|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_12, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_12|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_12|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_130, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_32, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_12, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_12|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_75} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 17:34:07,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_9|) (= (+ v_~__unbuffered_cnt~0_71 1) v_~__unbuffered_cnt~0_70) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15) (= v_~a~0_29 1) (= 0 |v_P0Thread1of1ForFork1_#res.offset_9|) (= v_~x~0_52 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|} OutVars{~a~0=v_~a~0_29, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_52, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} 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 17:34:07,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1237844132 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In1237844132 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite11_Out1237844132|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1237844132 |P2Thread1of1ForFork0_#t~ite11_Out1237844132|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1237844132, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1237844132} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1237844132, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out1237844132|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1237844132} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 17:34:07,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L789-->L789-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-866483369 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-866483369 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-866483369 256))) (.cse2 (= (mod ~y$r_buff1_thd3~0_In-866483369 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-866483369 |P2Thread1of1ForFork0_#t~ite12_Out-866483369|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork0_#t~ite12_Out-866483369|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-866483369, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-866483369, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-866483369, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-866483369} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-866483369, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-866483369, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-866483369|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-866483369, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-866483369} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 17:34:07,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L790-->L791: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-293288397 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-293288397 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out-293288397)) (and (= ~y$r_buff0_thd3~0_In-293288397 ~y$r_buff0_thd3~0_Out-293288397) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-293288397, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-293288397} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-293288397, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-293288397, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-293288397|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 17:34:07,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L791-->L791-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In826336006 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In826336006 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In826336006 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In826336006 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite14_Out826336006| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite14_Out826336006| ~y$r_buff1_thd3~0_In826336006)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In826336006, ~y$w_buff0_used~0=~y$w_buff0_used~0_In826336006, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In826336006, ~y$w_buff1_used~0=~y$w_buff1_used~0_In826336006} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out826336006|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In826336006, ~y$w_buff0_used~0=~y$w_buff0_used~0_In826336006, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In826336006, ~y$w_buff1_used~0=~y$w_buff1_used~0_In826336006} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 17:34:07,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L791-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_28| v_~y$r_buff1_thd3~0_94) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1))) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_27|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_94, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 17:34:07,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L752-2-->L752-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-135703738 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-135703738 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In-135703738 |P1Thread1of1ForFork2_#t~ite3_Out-135703738|) (not .cse1)) (and (= ~y~0_In-135703738 |P1Thread1of1ForFork2_#t~ite3_Out-135703738|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-135703738, ~y$w_buff1~0=~y$w_buff1~0_In-135703738, ~y~0=~y~0_In-135703738, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-135703738} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-135703738, ~y$w_buff1~0=~y$w_buff1~0_In-135703738, ~y~0=~y~0_In-135703738, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-135703738|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-135703738} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 17:34:07,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L752-4-->L753: Formula: (= v_~y~0_39 |v_P1Thread1of1ForFork2_#t~ite3_8|) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_8|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_9|, ~y~0=v_~y~0_39, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 17:34:07,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L753-->L753-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1612351557 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1612351557 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1612351557 |P1Thread1of1ForFork2_#t~ite5_Out-1612351557|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite5_Out-1612351557|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1612351557, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1612351557} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1612351557, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1612351557, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out-1612351557|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 17:34:07,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L754-->L754-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1380837402 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1380837402 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1380837402 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1380837402 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite6_Out-1380837402| ~y$w_buff1_used~0_In-1380837402) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite6_Out-1380837402| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1380837402, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1380837402, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1380837402, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1380837402} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1380837402, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1380837402, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1380837402, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-1380837402|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1380837402} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 17:34:07,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L755-->L755-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1866746777 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1866746777 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite7_Out-1866746777| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-1866746777 |P1Thread1of1ForFork2_#t~ite7_Out-1866746777|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1866746777, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1866746777} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1866746777, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1866746777, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out-1866746777|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 17:34:07,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L756-->L756-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-2116002380 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-2116002380 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2116002380 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2116002380 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite8_Out-2116002380| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork2_#t~ite8_Out-2116002380| ~y$r_buff1_thd2~0_In-2116002380) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2116002380, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2116002380, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2116002380, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2116002380} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2116002380, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2116002380, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-2116002380|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2116002380, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2116002380} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 17:34:07,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L756-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= |v_P1Thread1of1ForFork2_#t~ite8_30| v_~y$r_buff1_thd2~0_111) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_111, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 17:34:07,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L814-1-->L820: Formula: (and (= v_~main$tmp_guard0~0_11 1) (= 3 v_~__unbuffered_cnt~0_28)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 17:34:07,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L820-2-->L820-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In408007960 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In408007960 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite19_Out408007960| |ULTIMATE.start_main_#t~ite18_Out408007960|))) (or (and (= |ULTIMATE.start_main_#t~ite18_Out408007960| ~y~0_In408007960) (or .cse0 .cse1) .cse2) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite18_Out408007960| ~y$w_buff1~0_In408007960) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In408007960, ~y~0=~y~0_In408007960, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In408007960, ~y$w_buff1_used~0=~y$w_buff1_used~0_In408007960} OutVars{~y$w_buff1~0=~y$w_buff1~0_In408007960, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out408007960|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out408007960|, ~y~0=~y~0_In408007960, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In408007960, ~y$w_buff1_used~0=~y$w_buff1_used~0_In408007960} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 17:34:07,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1584785412 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1584785412 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite20_Out-1584785412|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite20_Out-1584785412| ~y$w_buff0_used~0_In-1584785412) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1584785412, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1584785412} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1584785412, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1584785412, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1584785412|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 17:34:07,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L822-->L822-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In-1883976492 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1883976492 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1883976492 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1883976492 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-1883976492| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite21_Out-1883976492| ~y$w_buff1_used~0_In-1883976492)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1883976492, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1883976492, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1883976492, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1883976492} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1883976492, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1883976492, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1883976492|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1883976492, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1883976492} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 17:34:07,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-2107996414 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-2107996414 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite22_Out-2107996414| 0)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In-2107996414 |ULTIMATE.start_main_#t~ite22_Out-2107996414|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2107996414, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2107996414} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2107996414, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2107996414, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-2107996414|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 17:34:07,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-777317573 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-777317573 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-777317573 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-777317573 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite23_Out-777317573|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd0~0_In-777317573 |ULTIMATE.start_main_#t~ite23_Out-777317573|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-777317573, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-777317573, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-777317573, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-777317573} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-777317573, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-777317573, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-777317573, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-777317573|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-777317573} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 17:34:07,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L833-->L833-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1480097360 256)))) (or (and (= |ULTIMATE.start_main_#t~ite33_Out-1480097360| |ULTIMATE.start_main_#t~ite32_Out-1480097360|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1480097360 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-1480097360 256)) (and .cse0 (= (mod ~y$w_buff1_used~0_In-1480097360 256) 0)) (and (= (mod ~y$r_buff1_thd0~0_In-1480097360 256) 0) .cse0))) .cse1 (= ~y$w_buff1~0_In-1480097360 |ULTIMATE.start_main_#t~ite32_Out-1480097360|)) (and (not .cse1) (= ~y$w_buff1~0_In-1480097360 |ULTIMATE.start_main_#t~ite33_Out-1480097360|) (= |ULTIMATE.start_main_#t~ite32_In-1480097360| |ULTIMATE.start_main_#t~ite32_Out-1480097360|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1480097360, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1480097360, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1480097360, ~weak$$choice2~0=~weak$$choice2~0_In-1480097360, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1480097360, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_In-1480097360|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1480097360} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1480097360, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1480097360, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1480097360, ~weak$$choice2~0=~weak$$choice2~0_In-1480097360, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-1480097360|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1480097360, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out-1480097360|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1480097360} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33] because there is no mapped edge [2019-12-18 17:34:07,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L834-->L834-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1049955208 256)))) (or (and (= ~y$w_buff0_used~0_In-1049955208 |ULTIMATE.start_main_#t~ite36_Out-1049955208|) (not .cse0) (= |ULTIMATE.start_main_#t~ite35_In-1049955208| |ULTIMATE.start_main_#t~ite35_Out-1049955208|)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1049955208 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In-1049955208 256) 0) .cse1) (and (= (mod ~y$r_buff1_thd0~0_In-1049955208 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-1049955208 256)))) (= ~y$w_buff0_used~0_In-1049955208 |ULTIMATE.start_main_#t~ite35_Out-1049955208|) (= |ULTIMATE.start_main_#t~ite36_Out-1049955208| |ULTIMATE.start_main_#t~ite35_Out-1049955208|) .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1049955208, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1049955208, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-1049955208|, ~weak$$choice2~0=~weak$$choice2~0_In-1049955208, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1049955208, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1049955208} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1049955208, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1049955208, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1049955208|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1049955208|, ~weak$$choice2~0=~weak$$choice2~0_In-1049955208, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1049955208, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1049955208} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 17:34:07,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L835-->L835-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1923091617 256)))) (or (and (= ~y$w_buff1_used~0_In-1923091617 |ULTIMATE.start_main_#t~ite38_Out-1923091617|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1923091617 256)))) (or (= (mod ~y$w_buff0_used~0_In-1923091617 256) 0) (and (= 0 (mod ~y$r_buff1_thd0~0_In-1923091617 256)) .cse0) (and (= (mod ~y$w_buff1_used~0_In-1923091617 256) 0) .cse0))) .cse1 (= |ULTIMATE.start_main_#t~ite39_Out-1923091617| |ULTIMATE.start_main_#t~ite38_Out-1923091617|)) (and (= |ULTIMATE.start_main_#t~ite38_In-1923091617| |ULTIMATE.start_main_#t~ite38_Out-1923091617|) (not .cse1) (= ~y$w_buff1_used~0_In-1923091617 |ULTIMATE.start_main_#t~ite39_Out-1923091617|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1923091617, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1923091617, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-1923091617|, ~weak$$choice2~0=~weak$$choice2~0_In-1923091617, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1923091617, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1923091617} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1923091617, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1923091617|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1923091617, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1923091617|, ~weak$$choice2~0=~weak$$choice2~0_In-1923091617, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1923091617, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1923091617} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 17:34:07,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L836-->L837: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_29 256))) (= v_~y$r_buff0_thd0~0_100 v_~y$r_buff0_thd0~0_99)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_99, ~weak$$choice2~0=v_~weak$$choice2~0_29, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 17:34:07,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L839-->L4: Formula: (and (= v_~y~0_138 v_~y$mem_tmp~0_17) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= 0 v_~y$flush_delayed~0_52) (not (= (mod v_~y$flush_delayed~0_53 256) 0))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_53, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_17, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_52, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_60|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~y~0=v_~y~0_138, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:34:07,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 17:34:07,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:34:07 BasicIcfg [2019-12-18 17:34:07,157 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:34:07,159 INFO L168 Benchmark]: Toolchain (without parser) took 19710.07 ms. Allocated memory was 139.5 MB in the beginning and 820.0 MB in the end (delta: 680.5 MB). Free memory was 101.6 MB in the beginning and 265.0 MB in the end (delta: -163.5 MB). Peak memory consumption was 517.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:34:07,160 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 139.5 MB. Free memory is still 121.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 17:34:07,160 INFO L168 Benchmark]: CACSL2BoogieTranslator took 758.31 ms. Allocated memory was 139.5 MB in the beginning and 205.0 MB in the end (delta: 65.5 MB). Free memory was 101.1 MB in the beginning and 158.3 MB in the end (delta: -57.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-18 17:34:07,161 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.60 ms. Allocated memory is still 205.0 MB. Free memory was 158.3 MB in the beginning and 155.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:34:07,162 INFO L168 Benchmark]: Boogie Preprocessor took 43.38 ms. Allocated memory is still 205.0 MB. Free memory was 155.4 MB in the beginning and 153.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:34:07,162 INFO L168 Benchmark]: RCFGBuilder took 862.73 ms. Allocated memory is still 205.0 MB. Free memory was 153.5 MB in the beginning and 106.5 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:34:07,163 INFO L168 Benchmark]: TraceAbstraction took 17970.64 ms. Allocated memory was 205.0 MB in the beginning and 820.0 MB in the end (delta: 615.0 MB). Free memory was 106.5 MB in the beginning and 265.0 MB in the end (delta: -158.5 MB). Peak memory consumption was 456.5 MB. Max. memory is 7.1 GB. [2019-12-18 17:34:07,167 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.50 ms. Allocated memory is still 139.5 MB. Free memory is still 121.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 758.31 ms. Allocated memory was 139.5 MB in the beginning and 205.0 MB in the end (delta: 65.5 MB). Free memory was 101.1 MB in the beginning and 158.3 MB in the end (delta: -57.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.60 ms. Allocated memory is still 205.0 MB. Free memory was 158.3 MB in the beginning and 155.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.38 ms. Allocated memory is still 205.0 MB. Free memory was 155.4 MB in the beginning and 153.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 862.73 ms. Allocated memory is still 205.0 MB. Free memory was 153.5 MB in the beginning and 106.5 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17970.64 ms. Allocated memory was 205.0 MB in the beginning and 820.0 MB in the end (delta: 615.0 MB). Free memory was 106.5 MB in the beginning and 265.0 MB in the end (delta: -158.5 MB). Peak memory consumption was 456.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.1s, 164 ProgramPointsBefore, 82 ProgramPointsAfterwards, 195 TransitionsBefore, 91 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 39 ConcurrentYvCompositions, 26 ChoiceCompositions, 4376 VarBasedMoverChecksPositive, 193 VarBasedMoverChecksNegative, 58 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 46792 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t1214, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L812] FCALL, FORK 0 pthread_create(&t1215, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L814] FCALL, FORK 0 pthread_create(&t1216, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L771] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L772] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L773] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L774] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L775] 3 y$r_buff0_thd3 = (_Bool)1 [L778] 3 z = 1 [L781] 3 __unbuffered_p2_EAX = z [L784] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 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=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 2 x = 2 [L749] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 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) [L788] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L789] 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 [L752] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L754] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L820] 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=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 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) [L821] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L822] 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 [L823] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L824] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 y$flush_delayed = weak$$choice2 [L830] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L832] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L833] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L834] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L835] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L837] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 17.6s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1590 SDtfs, 1391 SDslu, 3969 SDs, 0 SdLazy, 2710 SolverSat, 133 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 29 SyntacticMatches, 13 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22284occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 3576 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 742 NumberOfCodeBlocks, 742 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 669 ConstructedInterpolants, 0 QuantifiedInterpolants, 125505 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...