/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/mix056_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:00:43,211 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:00:43,215 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:00:43,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:00:43,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:00:43,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:00:43,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:00:43,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:00:43,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:00:43,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:00:43,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:00:43,236 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:00:43,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:00:43,237 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:00:43,238 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:00:43,239 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:00:43,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:00:43,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:00:43,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:00:43,245 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:00:43,246 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:00:43,247 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:00:43,249 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:00:43,249 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:00:43,252 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:00:43,252 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:00:43,252 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:00:43,253 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:00:43,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:00:43,255 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:00:43,255 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:00:43,256 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:00:43,256 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:00:43,257 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:00:43,258 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:00:43,258 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:00:43,259 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:00:43,259 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:00:43,259 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:00:43,260 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:00:43,261 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:00:43,262 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-27 03:00:43,279 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:00:43,282 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:00:43,284 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:00:43,285 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:00:43,285 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:00:43,285 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:00:43,285 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:00:43,286 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:00:43,286 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:00:43,287 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:00:43,287 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:00:43,287 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:00:43,287 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:00:43,287 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:00:43,288 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:00:43,288 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:00:43,288 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:00:43,288 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:00:43,288 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:00:43,290 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:00:43,290 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:00:43,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:00:43,291 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:00:43,291 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:00:43,291 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:00:43,291 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:00:43,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:00:43,292 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:00:43,292 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:00:43,561 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:00:43,581 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:00:43,584 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:00:43,586 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:00:43,586 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:00:43,587 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_rmo.opt.i [2019-12-27 03:00:43,657 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25051445b/0985b1ada9cd46239a4295fab6a95d98/FLAG7d55cef71 [2019-12-27 03:00:44,123 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:00:44,123 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_rmo.opt.i [2019-12-27 03:00:44,143 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25051445b/0985b1ada9cd46239a4295fab6a95d98/FLAG7d55cef71 [2019-12-27 03:00:44,506 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25051445b/0985b1ada9cd46239a4295fab6a95d98 [2019-12-27 03:00:44,515 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:00:44,517 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:00:44,518 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:00:44,518 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:00:44,522 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:00:44,523 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:00:44" (1/1) ... [2019-12-27 03:00:44,526 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85f7a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:44, skipping insertion in model container [2019-12-27 03:00:44,526 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:00:44" (1/1) ... [2019-12-27 03:00:44,533 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:00:44,585 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:00:45,174 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:00:45,187 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:00:45,283 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:00:45,355 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:00:45,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:45 WrapperNode [2019-12-27 03:00:45,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:00:45,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:00:45,357 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:00:45,357 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:00:45,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:45" (1/1) ... [2019-12-27 03:00:45,386 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:45" (1/1) ... [2019-12-27 03:00:45,425 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:00:45,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:00:45,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:00:45,425 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:00:45,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:45" (1/1) ... [2019-12-27 03:00:45,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:45" (1/1) ... [2019-12-27 03:00:45,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:45" (1/1) ... [2019-12-27 03:00:45,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:45" (1/1) ... [2019-12-27 03:00:45,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:45" (1/1) ... [2019-12-27 03:00:45,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:45" (1/1) ... [2019-12-27 03:00:45,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:45" (1/1) ... [2019-12-27 03:00:45,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:00:45,465 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:00:45,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:00:45,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:00:45,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:00:45,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:00:45,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:00:45,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:00:45,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:00:45,529 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:00:45,529 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:00:45,530 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:00:45,530 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:00:45,530 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 03:00:45,531 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 03:00:45,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:00:45,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:00:45,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:00:45,533 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 03:00:46,298 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:00:46,299 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:00:46,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:00:46 BoogieIcfgContainer [2019-12-27 03:00:46,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:00:46,302 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:00:46,302 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:00:46,306 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:00:46,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:00:44" (1/3) ... [2019-12-27 03:00:46,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16bd6c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:00:46, skipping insertion in model container [2019-12-27 03:00:46,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:45" (2/3) ... [2019-12-27 03:00:46,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16bd6c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:00:46, skipping insertion in model container [2019-12-27 03:00:46,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:00:46" (3/3) ... [2019-12-27 03:00:46,310 INFO L109 eAbstractionObserver]: Analyzing ICFG mix056_rmo.opt.i [2019-12-27 03:00:46,321 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:00:46,321 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:00:46,329 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:00:46,330 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:00:46,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,366 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,366 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,368 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,368 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,383 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,383 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,384 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,384 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,385 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,401 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,406 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,407 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,430 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,431 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,433 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,433 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:46,449 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 03:00:46,469 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:00:46,469 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:00:46,469 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:00:46,469 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:00:46,469 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:00:46,470 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:00:46,470 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:00:46,470 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:00:46,486 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-27 03:00:46,488 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 03:00:46,590 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 03:00:46,590 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:00:46,604 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 03:00:46,623 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 03:00:46,677 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 03:00:46,678 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:00:46,685 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 03:00:46,702 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 03:00:46,703 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:00:51,273 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 03:00:51,395 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48383 [2019-12-27 03:00:51,396 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 03:00:51,400 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-27 03:00:52,361 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 16526 states. [2019-12-27 03:00:52,363 INFO L276 IsEmpty]: Start isEmpty. Operand 16526 states. [2019-12-27 03:00:52,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 03:00:52,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:52,370 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:52,370 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:52,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:52,377 INFO L82 PathProgramCache]: Analyzing trace with hash 2128093424, now seen corresponding path program 1 times [2019-12-27 03:00:52,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:52,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127063232] [2019-12-27 03:00:52,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:52,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:52,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127063232] [2019-12-27 03:00:52,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:52,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:00:52,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687534585] [2019-12-27 03:00:52,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:00:52,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:52,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:00:52,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:52,728 INFO L87 Difference]: Start difference. First operand 16526 states. Second operand 3 states. [2019-12-27 03:00:53,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:53,143 INFO L93 Difference]: Finished difference Result 16398 states and 61580 transitions. [2019-12-27 03:00:53,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:00:53,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 03:00:53,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:53,308 INFO L225 Difference]: With dead ends: 16398 [2019-12-27 03:00:53,309 INFO L226 Difference]: Without dead ends: 16062 [2019-12-27 03:00:53,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:53,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16062 states. [2019-12-27 03:00:54,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16062 to 16062. [2019-12-27 03:00:54,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16062 states. [2019-12-27 03:00:54,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16062 states to 16062 states and 60376 transitions. [2019-12-27 03:00:54,660 INFO L78 Accepts]: Start accepts. Automaton has 16062 states and 60376 transitions. Word has length 7 [2019-12-27 03:00:54,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:54,661 INFO L462 AbstractCegarLoop]: Abstraction has 16062 states and 60376 transitions. [2019-12-27 03:00:54,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:00:54,662 INFO L276 IsEmpty]: Start isEmpty. Operand 16062 states and 60376 transitions. [2019-12-27 03:00:54,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:00:54,677 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:54,677 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:54,678 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:54,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:54,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1390331573, now seen corresponding path program 1 times [2019-12-27 03:00:54,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:54,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089607810] [2019-12-27 03:00:54,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:54,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:54,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089607810] [2019-12-27 03:00:54,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:54,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:00:54,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231147272] [2019-12-27 03:00:54,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:00:54,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:54,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:00:54,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:00:54,827 INFO L87 Difference]: Start difference. First operand 16062 states and 60376 transitions. Second operand 4 states. [2019-12-27 03:00:55,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:55,774 INFO L93 Difference]: Finished difference Result 24942 states and 90524 transitions. [2019-12-27 03:00:55,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:00:55,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 03:00:55,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:55,892 INFO L225 Difference]: With dead ends: 24942 [2019-12-27 03:00:55,893 INFO L226 Difference]: Without dead ends: 24928 [2019-12-27 03:00:55,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:00:56,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24928 states. [2019-12-27 03:00:56,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24928 to 22166. [2019-12-27 03:00:56,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22166 states. [2019-12-27 03:00:56,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22166 states to 22166 states and 81470 transitions. [2019-12-27 03:00:56,876 INFO L78 Accepts]: Start accepts. Automaton has 22166 states and 81470 transitions. Word has length 13 [2019-12-27 03:00:56,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:56,876 INFO L462 AbstractCegarLoop]: Abstraction has 22166 states and 81470 transitions. [2019-12-27 03:00:56,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:00:56,876 INFO L276 IsEmpty]: Start isEmpty. Operand 22166 states and 81470 transitions. [2019-12-27 03:00:56,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:00:56,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:56,878 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:56,879 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:56,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:56,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1371832765, now seen corresponding path program 1 times [2019-12-27 03:00:56,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:56,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830416573] [2019-12-27 03:00:56,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:56,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:56,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830416573] [2019-12-27 03:00:56,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:56,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:00:56,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554745512] [2019-12-27 03:00:56,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:00:56,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:56,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:00:56,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:56,935 INFO L87 Difference]: Start difference. First operand 22166 states and 81470 transitions. Second operand 3 states. [2019-12-27 03:00:56,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:56,992 INFO L93 Difference]: Finished difference Result 12675 states and 40338 transitions. [2019-12-27 03:00:56,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:00:56,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 03:00:56,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:57,039 INFO L225 Difference]: With dead ends: 12675 [2019-12-27 03:00:57,039 INFO L226 Difference]: Without dead ends: 12675 [2019-12-27 03:00:57,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:57,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12675 states. [2019-12-27 03:00:57,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12675 to 12675. [2019-12-27 03:00:57,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12675 states. [2019-12-27 03:00:57,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12675 states to 12675 states and 40338 transitions. [2019-12-27 03:00:57,431 INFO L78 Accepts]: Start accepts. Automaton has 12675 states and 40338 transitions. Word has length 13 [2019-12-27 03:00:57,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:57,431 INFO L462 AbstractCegarLoop]: Abstraction has 12675 states and 40338 transitions. [2019-12-27 03:00:57,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:00:57,432 INFO L276 IsEmpty]: Start isEmpty. Operand 12675 states and 40338 transitions. [2019-12-27 03:00:57,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:00:57,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:57,433 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:57,434 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:57,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:57,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1884008947, now seen corresponding path program 1 times [2019-12-27 03:00:57,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:57,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351623381] [2019-12-27 03:00:57,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:57,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:57,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351623381] [2019-12-27 03:00:57,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:57,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:00:57,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371992180] [2019-12-27 03:00:57,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:00:57,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:57,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:00:57,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:00:57,522 INFO L87 Difference]: Start difference. First operand 12675 states and 40338 transitions. Second operand 4 states. [2019-12-27 03:00:57,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:57,553 INFO L93 Difference]: Finished difference Result 1939 states and 4540 transitions. [2019-12-27 03:00:57,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:00:57,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 03:00:57,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:57,560 INFO L225 Difference]: With dead ends: 1939 [2019-12-27 03:00:57,560 INFO L226 Difference]: Without dead ends: 1939 [2019-12-27 03:00:57,561 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-27 03:00:57,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2019-12-27 03:00:57,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1939. [2019-12-27 03:00:57,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1939 states. [2019-12-27 03:00:57,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 4540 transitions. [2019-12-27 03:00:57,724 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 4540 transitions. Word has length 14 [2019-12-27 03:00:57,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:57,724 INFO L462 AbstractCegarLoop]: Abstraction has 1939 states and 4540 transitions. [2019-12-27 03:00:57,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:00:57,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 4540 transitions. [2019-12-27 03:00:57,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 03:00:57,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:57,727 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-27 03:00:57,727 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:57,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:57,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1748149180, now seen corresponding path program 1 times [2019-12-27 03:00:57,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:57,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258014643] [2019-12-27 03:00:57,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:57,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:57,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258014643] [2019-12-27 03:00:57,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:57,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:00:57,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87619682] [2019-12-27 03:00:57,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:00:57,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:57,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:00:57,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:00:57,835 INFO L87 Difference]: Start difference. First operand 1939 states and 4540 transitions. Second operand 5 states. [2019-12-27 03:00:57,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:57,865 INFO L93 Difference]: Finished difference Result 653 states and 1533 transitions. [2019-12-27 03:00:57,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:00:57,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 03:00:57,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:57,867 INFO L225 Difference]: With dead ends: 653 [2019-12-27 03:00:57,867 INFO L226 Difference]: Without dead ends: 653 [2019-12-27 03:00:57,868 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-27 03:00:57,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-12-27 03:00:57,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 597. [2019-12-27 03:00:57,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-12-27 03:00:57,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1401 transitions. [2019-12-27 03:00:57,879 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1401 transitions. Word has length 26 [2019-12-27 03:00:57,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:57,879 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 1401 transitions. [2019-12-27 03:00:57,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:00:57,880 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1401 transitions. [2019-12-27 03:00:57,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:00:57,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:57,884 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-27 03:00:57,885 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:57,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:57,885 INFO L82 PathProgramCache]: Analyzing trace with hash 306322931, now seen corresponding path program 1 times [2019-12-27 03:00:57,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:57,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841409017] [2019-12-27 03:00:57,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:57,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:57,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841409017] [2019-12-27 03:00:57,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:57,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:00:57,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540947754] [2019-12-27 03:00:57,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:00:57,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:57,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:00:57,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:57,987 INFO L87 Difference]: Start difference. First operand 597 states and 1401 transitions. Second operand 3 states. [2019-12-27 03:00:58,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:58,031 INFO L93 Difference]: Finished difference Result 607 states and 1414 transitions. [2019-12-27 03:00:58,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:00:58,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 03:00:58,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:58,034 INFO L225 Difference]: With dead ends: 607 [2019-12-27 03:00:58,034 INFO L226 Difference]: Without dead ends: 607 [2019-12-27 03:00:58,034 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-27 03:00:58,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-12-27 03:00:58,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 603. [2019-12-27 03:00:58,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-12-27 03:00:58,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 1410 transitions. [2019-12-27 03:00:58,044 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 1410 transitions. Word has length 55 [2019-12-27 03:00:58,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:58,044 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 1410 transitions. [2019-12-27 03:00:58,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:00:58,045 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1410 transitions. [2019-12-27 03:00:58,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:00:58,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:58,046 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-27 03:00:58,047 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:58,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:58,047 INFO L82 PathProgramCache]: Analyzing trace with hash -826083081, now seen corresponding path program 1 times [2019-12-27 03:00:58,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:58,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155717355] [2019-12-27 03:00:58,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:58,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:58,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155717355] [2019-12-27 03:00:58,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:58,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:00:58,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659348095] [2019-12-27 03:00:58,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:00:58,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:58,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:00:58,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:00:58,167 INFO L87 Difference]: Start difference. First operand 603 states and 1410 transitions. Second operand 5 states. [2019-12-27 03:00:58,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:58,401 INFO L93 Difference]: Finished difference Result 892 states and 2082 transitions. [2019-12-27 03:00:58,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:00:58,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-27 03:00:58,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:58,403 INFO L225 Difference]: With dead ends: 892 [2019-12-27 03:00:58,403 INFO L226 Difference]: Without dead ends: 892 [2019-12-27 03:00:58,405 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-27 03:00:58,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2019-12-27 03:00:58,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 717. [2019-12-27 03:00:58,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-12-27 03:00:58,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1691 transitions. [2019-12-27 03:00:58,421 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1691 transitions. Word has length 55 [2019-12-27 03:00:58,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:58,422 INFO L462 AbstractCegarLoop]: Abstraction has 717 states and 1691 transitions. [2019-12-27 03:00:58,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:00:58,422 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1691 transitions. [2019-12-27 03:00:58,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:00:58,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:58,424 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-27 03:00:58,425 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:58,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:58,425 INFO L82 PathProgramCache]: Analyzing trace with hash 297273929, now seen corresponding path program 2 times [2019-12-27 03:00:58,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:58,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628270765] [2019-12-27 03:00:58,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:58,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:58,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628270765] [2019-12-27 03:00:58,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:58,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:00:58,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278507943] [2019-12-27 03:00:58,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:00:58,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:58,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:00:58,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:00:58,580 INFO L87 Difference]: Start difference. First operand 717 states and 1691 transitions. Second operand 6 states. [2019-12-27 03:00:58,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:58,876 INFO L93 Difference]: Finished difference Result 1189 states and 2773 transitions. [2019-12-27 03:00:58,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:00:58,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 03:00:58,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:58,878 INFO L225 Difference]: With dead ends: 1189 [2019-12-27 03:00:58,879 INFO L226 Difference]: Without dead ends: 1189 [2019-12-27 03:00:58,879 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-27 03:00:58,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2019-12-27 03:00:58,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 759. [2019-12-27 03:00:58,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-12-27 03:00:58,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1794 transitions. [2019-12-27 03:00:58,895 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1794 transitions. Word has length 55 [2019-12-27 03:00:58,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:58,895 INFO L462 AbstractCegarLoop]: Abstraction has 759 states and 1794 transitions. [2019-12-27 03:00:58,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:00:58,895 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1794 transitions. [2019-12-27 03:00:58,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:00:58,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:58,899 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-27 03:00:58,899 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:58,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:58,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1649215159, now seen corresponding path program 3 times [2019-12-27 03:00:58,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:58,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449475834] [2019-12-27 03:00:58,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:59,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:59,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449475834] [2019-12-27 03:00:59,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:59,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:00:59,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725230399] [2019-12-27 03:00:59,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:00:59,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:59,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:00:59,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:59,010 INFO L87 Difference]: Start difference. First operand 759 states and 1794 transitions. Second operand 3 states. [2019-12-27 03:00:59,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:59,022 INFO L93 Difference]: Finished difference Result 687 states and 1586 transitions. [2019-12-27 03:00:59,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:00:59,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 03:00:59,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:59,024 INFO L225 Difference]: With dead ends: 687 [2019-12-27 03:00:59,024 INFO L226 Difference]: Without dead ends: 687 [2019-12-27 03:00:59,024 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-27 03:00:59,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-12-27 03:00:59,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 663. [2019-12-27 03:00:59,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-12-27 03:00:59,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1530 transitions. [2019-12-27 03:00:59,035 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1530 transitions. Word has length 55 [2019-12-27 03:00:59,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:59,035 INFO L462 AbstractCegarLoop]: Abstraction has 663 states and 1530 transitions. [2019-12-27 03:00:59,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:00:59,036 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1530 transitions. [2019-12-27 03:00:59,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 03:00:59,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:59,040 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-27 03:00:59,040 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:59,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:59,040 INFO L82 PathProgramCache]: Analyzing trace with hash 684538364, now seen corresponding path program 1 times [2019-12-27 03:00:59,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:59,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625166219] [2019-12-27 03:00:59,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:59,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:59,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625166219] [2019-12-27 03:00:59,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:59,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:00:59,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59352697] [2019-12-27 03:00:59,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:00:59,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:59,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:00:59,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:00:59,193 INFO L87 Difference]: Start difference. First operand 663 states and 1530 transitions. Second operand 6 states. [2019-12-27 03:00:59,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:59,259 INFO L93 Difference]: Finished difference Result 954 states and 2054 transitions. [2019-12-27 03:00:59,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:00:59,260 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-27 03:00:59,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:59,261 INFO L225 Difference]: With dead ends: 954 [2019-12-27 03:00:59,261 INFO L226 Difference]: Without dead ends: 601 [2019-12-27 03:00:59,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:00:59,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-12-27 03:00:59,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2019-12-27 03:00:59,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-12-27 03:00:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 1351 transitions. [2019-12-27 03:00:59,271 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 1351 transitions. Word has length 56 [2019-12-27 03:00:59,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:59,272 INFO L462 AbstractCegarLoop]: Abstraction has 601 states and 1351 transitions. [2019-12-27 03:00:59,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:00:59,272 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 1351 transitions. [2019-12-27 03:00:59,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 03:00:59,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:59,274 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-27 03:00:59,274 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:59,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:59,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1651570348, now seen corresponding path program 2 times [2019-12-27 03:00:59,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:59,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943662533] [2019-12-27 03:00:59,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:59,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:59,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943662533] [2019-12-27 03:00:59,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:59,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:00:59,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953608680] [2019-12-27 03:00:59,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:00:59,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:59,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:00:59,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:59,348 INFO L87 Difference]: Start difference. First operand 601 states and 1351 transitions. Second operand 3 states. [2019-12-27 03:00:59,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:59,387 INFO L93 Difference]: Finished difference Result 600 states and 1349 transitions. [2019-12-27 03:00:59,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:00:59,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 03:00:59,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:59,389 INFO L225 Difference]: With dead ends: 600 [2019-12-27 03:00:59,389 INFO L226 Difference]: Without dead ends: 600 [2019-12-27 03:00:59,390 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-27 03:00:59,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-12-27 03:00:59,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 411. [2019-12-27 03:00:59,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-12-27 03:00:59,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 911 transitions. [2019-12-27 03:00:59,399 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 911 transitions. Word has length 56 [2019-12-27 03:00:59,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:59,400 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 911 transitions. [2019-12-27 03:00:59,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:00:59,400 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 911 transitions. [2019-12-27 03:00:59,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 03:00:59,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:59,402 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-27 03:00:59,402 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:59,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:59,402 INFO L82 PathProgramCache]: Analyzing trace with hash 729563135, now seen corresponding path program 1 times [2019-12-27 03:00:59,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:59,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180881079] [2019-12-27 03:00:59,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:59,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:59,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180881079] [2019-12-27 03:00:59,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:59,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:00:59,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967748022] [2019-12-27 03:00:59,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:00:59,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:59,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:00:59,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:00:59,581 INFO L87 Difference]: Start difference. First operand 411 states and 911 transitions. Second operand 5 states. [2019-12-27 03:00:59,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:59,625 INFO L93 Difference]: Finished difference Result 587 states and 1222 transitions. [2019-12-27 03:00:59,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:00:59,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-27 03:00:59,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:59,627 INFO L225 Difference]: With dead ends: 587 [2019-12-27 03:00:59,627 INFO L226 Difference]: Without dead ends: 207 [2019-12-27 03:00:59,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:00:59,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-12-27 03:00:59,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2019-12-27 03:00:59,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-12-27 03:00:59,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 364 transitions. [2019-12-27 03:00:59,699 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 364 transitions. Word has length 57 [2019-12-27 03:00:59,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:59,700 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 364 transitions. [2019-12-27 03:00:59,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:00:59,700 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 364 transitions. [2019-12-27 03:00:59,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 03:00:59,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:59,701 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-27 03:00:59,701 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:59,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:59,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1516556909, now seen corresponding path program 2 times [2019-12-27 03:00:59,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:59,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852994336] [2019-12-27 03:00:59,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:59,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:59,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852994336] [2019-12-27 03:00:59,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:59,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 03:00:59,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788548915] [2019-12-27 03:00:59,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 03:00:59,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:59,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 03:00:59,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:00:59,937 INFO L87 Difference]: Start difference. First operand 207 states and 364 transitions. Second operand 12 states. [2019-12-27 03:01:00,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:00,409 INFO L93 Difference]: Finished difference Result 371 states and 637 transitions. [2019-12-27 03:01:00,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 03:01:00,410 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-27 03:01:00,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:00,411 INFO L225 Difference]: With dead ends: 371 [2019-12-27 03:01:00,411 INFO L226 Difference]: Without dead ends: 341 [2019-12-27 03:01:00,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-12-27 03:01:00,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-12-27 03:01:00,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 307. [2019-12-27 03:01:00,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-12-27 03:01:00,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 535 transitions. [2019-12-27 03:01:00,418 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 535 transitions. Word has length 57 [2019-12-27 03:01:00,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:00,420 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 535 transitions. [2019-12-27 03:01:00,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 03:01:00,420 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 535 transitions. [2019-12-27 03:01:00,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 03:01:00,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:00,421 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-27 03:01:00,421 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:00,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:00,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1834190715, now seen corresponding path program 3 times [2019-12-27 03:01:00,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:00,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60666543] [2019-12-27 03:01:00,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:00,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:00,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:00,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60666543] [2019-12-27 03:01:00,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:00,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 03:01:00,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410373784] [2019-12-27 03:01:00,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 03:01:00,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:00,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 03:01:00,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:01:00,769 INFO L87 Difference]: Start difference. First operand 307 states and 535 transitions. Second operand 13 states. [2019-12-27 03:01:01,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:01,157 INFO L93 Difference]: Finished difference Result 407 states and 688 transitions. [2019-12-27 03:01:01,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 03:01:01,157 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 03:01:01,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:01,158 INFO L225 Difference]: With dead ends: 407 [2019-12-27 03:01:01,158 INFO L226 Difference]: Without dead ends: 377 [2019-12-27 03:01:01,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-27 03:01:01,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-12-27 03:01:01,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 315. [2019-12-27 03:01:01,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-12-27 03:01:01,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 549 transitions. [2019-12-27 03:01:01,164 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 549 transitions. Word has length 57 [2019-12-27 03:01:01,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:01,164 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 549 transitions. [2019-12-27 03:01:01,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 03:01:01,165 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 549 transitions. [2019-12-27 03:01:01,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 03:01:01,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:01,166 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-27 03:01:01,166 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:01,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:01,167 INFO L82 PathProgramCache]: Analyzing trace with hash 731376245, now seen corresponding path program 4 times [2019-12-27 03:01:01,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:01,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272563166] [2019-12-27 03:01:01,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:01:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:01:01,278 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:01:01,278 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:01:01,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= |v_ULTIMATE.start_main_~#t1504~0.offset_19| 0) (= 0 v_~y$read_delayed_var~0.base_6) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1504~0.base_26| 4) |v_#length_23|) (= 0 v_~weak$$choice0~0_25) (= 0 v_~y$r_buff0_thd3~0_151) (= v_~y$w_buff1~0_200 0) (= v_~y$w_buff0_used~0_650 0) (= v_~__unbuffered_cnt~0_109 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~y$w_buff0~0_308) (= 0 v_~y$r_buff1_thd3~0_122) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd1~0_76) (= v_~z~0_51 0) (= v_~y$r_buff0_thd1~0_29 0) (= v_~main$tmp_guard1~0_28 0) (= v_~y$r_buff0_thd0~0_312 0) (= 0 v_~__unbuffered_p2_EAX~0_90) (= 0 v_~y$flush_delayed~0_45) (= v_~y$w_buff1_used~0_407 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1504~0.base_26|) (= v_~y$r_buff0_thd2~0_88 0) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff1_thd2~0_131) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1504~0.base_26|)) (= v_~y$mem_tmp~0_31 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y~0_150 0) (= v_~weak$$choice2~0_131 0) (= v_~y$r_buff1_thd0~0_254 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1504~0.base_26| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1504~0.base_26|) |v_ULTIMATE.start_main_~#t1504~0.offset_19| 0)) |v_#memory_int_23|) (= v_~main$tmp_guard0~0_24 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1504~0.base_26| 1) |v_#valid_60|) (= 0 |v_#NULL.base_5|) (= v_~x~0_80 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1504~0.base=|v_ULTIMATE.start_main_~#t1504~0.base_26|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_28|, ULTIMATE.start_main_~#t1504~0.offset=|v_ULTIMATE.start_main_~#t1504~0.offset_19|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_26|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_104|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_52|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_26|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_122, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_45, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_90, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_34|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_142|, ULTIMATE.start_main_~#t1506~0.offset=|v_ULTIMATE.start_main_~#t1506~0.offset_14|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_44|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_98|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_27|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_26|, ~weak$$choice0~0=v_~weak$$choice0~0_25, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_28|, ~y$w_buff1~0=v_~y$w_buff1~0_200, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_88, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_254, ~x~0=v_~x~0_80, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_650, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_38|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_31|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_28|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_32|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_16|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_58|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_50|, ULTIMATE.start_main_~#t1505~0.offset=|v_ULTIMATE.start_main_~#t1505~0.offset_19|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_76, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_44|, ULTIMATE.start_main_~#t1506~0.base=|v_ULTIMATE.start_main_~#t1506~0.base_21|, ~y$w_buff0~0=v_~y$w_buff0~0_308, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_151, ~y~0=v_~y~0_150, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_44|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_26|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_96|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_31|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_131, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_312, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ULTIMATE.start_main_~#t1505~0.base=|v_ULTIMATE.start_main_~#t1505~0.base_26|, ~z~0=v_~z~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_131, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_407} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1504~0.base, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1504~0.offset, #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, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1506~0.offset, 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, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, 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_#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, ULTIMATE.start_main_~#t1505~0.offset, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1506~0.base, ~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, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1505~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 03:01:01,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L800-1-->L802: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1505~0.base_13|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1505~0.base_13| 4) |v_#length_17|) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1505~0.base_13| 1) |v_#valid_40|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1505~0.base_13|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1505~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1505~0.base_13|) |v_ULTIMATE.start_main_~#t1505~0.offset_11| 1)) |v_#memory_int_17|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1505~0.base_13|) 0) (= |v_ULTIMATE.start_main_~#t1505~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1505~0.offset=|v_ULTIMATE.start_main_~#t1505~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, ULTIMATE.start_main_~#t1505~0.base=|v_ULTIMATE.start_main_~#t1505~0.base_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1505~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1505~0.base, #length] because there is no mapped edge [2019-12-27 03:01:01,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L802-1-->L804: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1506~0.base_12|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1506~0.base_12|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1506~0.base_12|) 0) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1506~0.base_12| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1506~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1506~0.base_12|) |v_ULTIMATE.start_main_~#t1506~0.offset_10| 2)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1506~0.offset_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1506~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1506~0.base=|v_ULTIMATE.start_main_~#t1506~0.base_12|, ULTIMATE.start_main_~#t1506~0.offset=|v_ULTIMATE.start_main_~#t1506~0.offset_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1506~0.base, ULTIMATE.start_main_~#t1506~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-27 03:01:01,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] P2ENTRY-->L4-3: Formula: (and (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= 2 v_~y$w_buff0~0_40) (= v_~y$w_buff0_used~0_161 1) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_32) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_12 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= v_P2Thread1of1ForFork0_~arg.base_8 |v_P2Thread1of1ForFork0_#in~arg.base_8|) (= (mod v_~y$w_buff1_used~0_89 256) 0) (= v_P2Thread1of1ForFork0_~arg.offset_8 |v_P2Thread1of1ForFork0_#in~arg.offset_8|) (= v_~y$w_buff1_used~0_89 v_~y$w_buff0_used~0_162)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_162, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_8|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_8, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_8|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_161, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_8, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_8|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_12, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} 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-27 03:01:01,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] P0ENTRY-->P0EXIT: Formula: (and (= v_~z~0_35 1) (= |v_P0Thread1of1ForFork1_#res.base_11| 0) (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_11|) (= v_~x~0_49 1) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_11|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_11|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, ~z~0=v_~z~0_35, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x~0=v_~x~0_49, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 03:01:01,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In832949270 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In832949270 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite11_Out832949270| 0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite11_Out832949270| ~y$w_buff0_used~0_In832949270) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In832949270, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In832949270} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In832949270, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out832949270|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In832949270} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 03:01:01,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L748-2-->L748-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In810456670 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In810456670 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite3_Out810456670| ~y~0_In810456670) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite3_Out810456670| ~y$w_buff1~0_In810456670) (not .cse1) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In810456670, ~y$w_buff1~0=~y$w_buff1~0_In810456670, ~y~0=~y~0_In810456670, ~y$w_buff1_used~0=~y$w_buff1_used~0_In810456670} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In810456670, ~y$w_buff1~0=~y$w_buff1~0_In810456670, ~y~0=~y~0_In810456670, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out810456670|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In810456670} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 03:01:01,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L748-4-->L749: Formula: (= |v_P1Thread1of1ForFork2_#t~ite3_12| v_~y~0_21) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_12|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_13|, ~y~0=v_~y~0_21, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 03:01:01,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L749-->L749-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1979469369 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1979469369 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite5_Out1979469369|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1979469369 |P1Thread1of1ForFork2_#t~ite5_Out1979469369|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1979469369, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1979469369} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1979469369, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1979469369, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out1979469369|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 03:01:01,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L750-->L750-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In231329871 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In231329871 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In231329871 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In231329871 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite6_Out231329871| ~y$w_buff1_used~0_In231329871)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork2_#t~ite6_Out231329871|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In231329871, ~y$w_buff0_used~0=~y$w_buff0_used~0_In231329871, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In231329871, ~y$w_buff1_used~0=~y$w_buff1_used~0_In231329871} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In231329871, ~y$w_buff0_used~0=~y$w_buff0_used~0_In231329871, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In231329871, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out231329871|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In231329871} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 03:01:01,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L751-->L751-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In842587771 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In842587771 256)))) (or (and (= ~y$r_buff0_thd2~0_In842587771 |P1Thread1of1ForFork2_#t~ite7_Out842587771|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork2_#t~ite7_Out842587771|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In842587771, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In842587771} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In842587771, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In842587771, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out842587771|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 03:01:01,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L779-->L779-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-410136254 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-410136254 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-410136254 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-410136254 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-410136254 |P2Thread1of1ForFork0_#t~ite12_Out-410136254|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite12_Out-410136254|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-410136254, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-410136254, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-410136254, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-410136254} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-410136254, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-410136254, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-410136254|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-410136254, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-410136254} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 03:01:01,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L752-->L752-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In1845327733 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1845327733 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1845327733 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1845327733 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite8_Out1845327733|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In1845327733 |P1Thread1of1ForFork2_#t~ite8_Out1845327733|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1845327733, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1845327733, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1845327733, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1845327733} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1845327733, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1845327733, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out1845327733|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1845327733, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1845327733} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 03:01:01,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L752-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite8_28| v_~y$r_buff1_thd2~0_56) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_56, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, 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-27 03:01:01,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L780-->L781: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1906712684 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1906712684 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In-1906712684 ~y$r_buff0_thd3~0_Out-1906712684)) (and (not .cse1) (not .cse0) (= 0 ~y$r_buff0_thd3~0_Out-1906712684)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1906712684, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1906712684} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1906712684, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1906712684, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-1906712684|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 03:01:01,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L781-->L781-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-2129569255 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In-2129569255 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-2129569255 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-2129569255 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite14_Out-2129569255| 0)) (and (or .cse3 .cse2) (= ~y$r_buff1_thd3~0_In-2129569255 |P2Thread1of1ForFork0_#t~ite14_Out-2129569255|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2129569255, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2129569255, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2129569255, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2129569255} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-2129569255|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2129569255, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2129569255, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2129569255, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2129569255} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 03:01:01,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L781-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_40| v_~y$r_buff1_thd3~0_68) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1))) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_39|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_68, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, 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-27 03:01:01,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L804-1-->L810: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 03:01:01,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L810-2-->L810-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1722110415 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1722110415 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite18_Out-1722110415| ~y$w_buff1~0_In-1722110415)) (and (= ~y~0_In-1722110415 |ULTIMATE.start_main_#t~ite18_Out-1722110415|) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1722110415, ~y~0=~y~0_In-1722110415, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1722110415, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1722110415} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1722110415, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1722110415|, ~y~0=~y~0_In-1722110415, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1722110415, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1722110415} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-27 03:01:01,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L810-4-->L811: Formula: (= v_~y~0_40 |v_ULTIMATE.start_main_#t~ite18_13|) InVars {ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|} OutVars{ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_12|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ~y~0=v_~y~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y~0] because there is no mapped edge [2019-12-27 03:01:01,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1062832802 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1062832802 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out1062832802| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite20_Out1062832802| ~y$w_buff0_used~0_In1062832802) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1062832802, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1062832802} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1062832802, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1062832802, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1062832802|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 03:01:01,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1131985471 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-1131985471 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1131985471 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1131985471 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite21_Out-1131985471|)) (and (= ~y$w_buff1_used~0_In-1131985471 |ULTIMATE.start_main_#t~ite21_Out-1131985471|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1131985471, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1131985471, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1131985471, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1131985471} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1131985471, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1131985471, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1131985471|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1131985471, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1131985471} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 03:01:01,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-125479151 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-125479151 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite22_Out-125479151|)) (and (= |ULTIMATE.start_main_#t~ite22_Out-125479151| ~y$r_buff0_thd0~0_In-125479151) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-125479151, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-125479151} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-125479151, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-125479151, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-125479151|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 03:01:01,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-144727885 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-144727885 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-144727885 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-144727885 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite23_Out-144727885|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-144727885 |ULTIMATE.start_main_#t~ite23_Out-144727885|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-144727885, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-144727885, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-144727885, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-144727885} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-144727885, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-144727885, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-144727885, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-144727885|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-144727885} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 03:01:01,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L822-->L822-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1822578526 256) 0))) (or (and (not .cse0) (= ~y$w_buff0~0_In-1822578526 |ULTIMATE.start_main_#t~ite30_Out-1822578526|) (= |ULTIMATE.start_main_#t~ite29_In-1822578526| |ULTIMATE.start_main_#t~ite29_Out-1822578526|)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1822578526 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-1822578526 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In-1822578526 256) 0) (and (= 0 (mod ~y$r_buff1_thd0~0_In-1822578526 256)) .cse1))) (= ~y$w_buff0~0_In-1822578526 |ULTIMATE.start_main_#t~ite29_Out-1822578526|) .cse0 (= |ULTIMATE.start_main_#t~ite29_Out-1822578526| |ULTIMATE.start_main_#t~ite30_Out-1822578526|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1822578526, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In-1822578526|, ~y$w_buff0~0=~y$w_buff0~0_In-1822578526, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1822578526, ~weak$$choice2~0=~weak$$choice2~0_In-1822578526, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1822578526, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1822578526} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-1822578526|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1822578526, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1822578526|, ~y$w_buff0~0=~y$w_buff0~0_In-1822578526, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1822578526, ~weak$$choice2~0=~weak$$choice2~0_In-1822578526, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1822578526, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1822578526} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 03:01:01,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L826-->L827: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd0~0_86 v_~y$r_buff0_thd0~0_85)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_27, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} 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-27 03:01:01,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L829-->L832-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_12 256)) (= v_~y~0_109 v_~y$mem_tmp~0_21) (not (= 0 (mod v_~y$flush_delayed~0_33 256))) (= 0 v_~y$flush_delayed~0_32)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_32, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_109, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[~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-27 03:01:01,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 03:01:01,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:01:01 BasicIcfg [2019-12-27 03:01:01,424 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:01:01,427 INFO L168 Benchmark]: Toolchain (without parser) took 16909.36 ms. Allocated memory was 145.8 MB in the beginning and 724.0 MB in the end (delta: 578.3 MB). Free memory was 102.1 MB in the beginning and 289.9 MB in the end (delta: -187.9 MB). Peak memory consumption was 390.4 MB. Max. memory is 7.1 GB. [2019-12-27 03:01:01,428 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 03:01:01,430 INFO L168 Benchmark]: CACSL2BoogieTranslator took 838.09 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 101.9 MB in the beginning and 155.9 MB in the end (delta: -54.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 03:01:01,436 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.09 ms. Allocated memory is still 203.9 MB. Free memory was 155.9 MB in the beginning and 153.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 03:01:01,437 INFO L168 Benchmark]: Boogie Preprocessor took 39.88 ms. Allocated memory is still 203.9 MB. Free memory was 153.1 MB in the beginning and 150.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 03:01:01,437 INFO L168 Benchmark]: RCFGBuilder took 835.35 ms. Allocated memory is still 203.9 MB. Free memory was 150.3 MB in the beginning and 104.0 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. [2019-12-27 03:01:01,438 INFO L168 Benchmark]: TraceAbstraction took 15122.19 ms. Allocated memory was 203.9 MB in the beginning and 724.0 MB in the end (delta: 520.1 MB). Free memory was 103.3 MB in the beginning and 289.9 MB in the end (delta: -186.7 MB). Peak memory consumption was 333.4 MB. Max. memory is 7.1 GB. [2019-12-27 03:01:01,450 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.43 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 838.09 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 101.9 MB in the beginning and 155.9 MB in the end (delta: -54.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.09 ms. Allocated memory is still 203.9 MB. Free memory was 155.9 MB in the beginning and 153.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.88 ms. Allocated memory is still 203.9 MB. Free memory was 153.1 MB in the beginning and 150.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 835.35 ms. Allocated memory is still 203.9 MB. Free memory was 150.3 MB in the beginning and 104.0 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15122.19 ms. Allocated memory was 203.9 MB in the beginning and 724.0 MB in the end (delta: 520.1 MB). Free memory was 103.3 MB in the beginning and 289.9 MB in the end (delta: -186.7 MB). Peak memory consumption was 333.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.9s, 162 ProgramPointsBefore, 83 ProgramPointsAfterwards, 193 TransitionsBefore, 92 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 3955 VarBasedMoverChecksPositive, 193 VarBasedMoverChecksNegative, 45 SemBasedMoverChecksPositive, 196 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 48383 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t1504, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L802] FCALL, FORK 0 pthread_create(&t1505, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L804] FCALL, FORK 0 pthread_create(&t1506, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L767] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L768] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L769] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L770] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L771] 3 y$r_buff0_thd3 = (_Bool)1 [L774] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=0] [L777] 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=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=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] [L742] 2 x = 2 [L745] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L777] 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) [L748] 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=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] 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 [L751] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 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 [L810] 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=0, 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] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 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 [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 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 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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] [L821] 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=0, 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] [L821] 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) [L822] 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)) [L823] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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] [L823] 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)) [L824] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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] [L824] 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)) [L825] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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] [L825] 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)) [L827] 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=0, 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] [L827] 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)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.8s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1372 SDtfs, 1093 SDslu, 3194 SDs, 0 SdLazy, 1301 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22166occurred 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.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 3736 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 633 NumberOfCodeBlocks, 633 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 562 ConstructedInterpolants, 0 QuantifiedInterpolants, 96355 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...