/usr/bin/java -Xmx16000000000 -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/VMCAI2021_PN.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 18:25:48,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 18:25:48,425 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 18:25:48,465 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 18:25:48,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 18:25:48,476 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 18:25:48,478 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 18:25:48,480 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 18:25:48,483 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 18:25:48,486 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 18:25:48,487 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 18:25:48,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 18:25:48,489 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 18:25:48,492 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 18:25:48,493 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 18:25:48,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 18:25:48,497 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 18:25:48,498 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 18:25:48,500 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 18:25:48,506 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 18:25:48,508 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 18:25:48,509 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 18:25:48,511 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 18:25:48,511 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 18:25:48,515 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 18:25:48,516 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 18:25:48,516 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 18:25:48,518 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 18:25:48,519 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 18:25:48,519 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 18:25:48,520 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 18:25:48,520 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 18:25:48,521 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 18:25:48,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 18:25:48,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 18:25:48,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 18:25:48,525 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 18:25:48,525 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 18:25:48,525 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 18:25:48,526 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 18:25:48,527 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 18:25:48,528 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-11 18:25:48,569 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 18:25:48,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 18:25:48,571 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 18:25:48,571 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 18:25:48,572 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 18:25:48,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 18:25:48,572 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 18:25:48,572 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 18:25:48,573 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 18:25:48,573 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 18:25:48,574 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 18:25:48,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 18:25:48,574 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 18:25:48,574 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 18:25:48,575 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 18:25:48,575 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 18:25:48,575 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 18:25:48,575 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 18:25:48,575 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 18:25:48,576 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 18:25:48,576 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 18:25:48,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:25:48,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 18:25:48,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 18:25:48,577 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 18:25:48,577 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 18:25:48,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 18:25:48,577 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 18:25:48,577 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 18:25:48,578 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 18:25:48,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 18:25:48,875 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 18:25:48,878 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 18:25:48,879 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 18:25:48,880 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 18:25:48,880 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_rmo.opt.i [2020-10-11 18:25:48,939 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c752ca96a/e24f14aa4ec7483697e8c6a46642cb53/FLAG43ac7e5bf [2020-10-11 18:25:49,511 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 18:25:49,512 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_rmo.opt.i [2020-10-11 18:25:49,535 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c752ca96a/e24f14aa4ec7483697e8c6a46642cb53/FLAG43ac7e5bf [2020-10-11 18:25:49,759 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c752ca96a/e24f14aa4ec7483697e8c6a46642cb53 [2020-10-11 18:25:49,768 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 18:25:49,770 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 18:25:49,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 18:25:49,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 18:25:49,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 18:25:49,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:25:49" (1/1) ... [2020-10-11 18:25:49,778 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25b4d328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:49, skipping insertion in model container [2020-10-11 18:25:49,778 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:25:49" (1/1) ... [2020-10-11 18:25:49,785 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 18:25:49,835 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 18:25:50,325 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:25:50,337 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 18:25:50,399 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:25:50,486 INFO L208 MainTranslator]: Completed translation [2020-10-11 18:25:50,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:50 WrapperNode [2020-10-11 18:25:50,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 18:25:50,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 18:25:50,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 18:25:50,490 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 18:25:50,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:50" (1/1) ... [2020-10-11 18:25:50,519 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:50" (1/1) ... [2020-10-11 18:25:50,552 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 18:25:50,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 18:25:50,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 18:25:50,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 18:25:50,560 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:50" (1/1) ... [2020-10-11 18:25:50,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:50" (1/1) ... [2020-10-11 18:25:50,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:50" (1/1) ... [2020-10-11 18:25:50,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:50" (1/1) ... [2020-10-11 18:25:50,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:50" (1/1) ... [2020-10-11 18:25:50,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:50" (1/1) ... [2020-10-11 18:25:50,588 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:50" (1/1) ... [2020-10-11 18:25:50,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 18:25:50,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 18:25:50,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 18:25:50,593 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 18:25:50,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:50" (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 [2020-10-11 18:25:50,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 18:25:50,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 18:25:50,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 18:25:50,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 18:25:50,659 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 18:25:50,659 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 18:25:50,659 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 18:25:50,659 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 18:25:50,659 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 18:25:50,660 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 18:25:50,660 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 18:25:50,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 18:25:50,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 18:25:50,662 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 18:25:52,434 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 18:25:52,435 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 18:25:52,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:25:52 BoogieIcfgContainer [2020-10-11 18:25:52,437 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 18:25:52,438 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 18:25:52,438 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 18:25:52,441 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 18:25:52,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:25:49" (1/3) ... [2020-10-11 18:25:52,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1867f0b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:25:52, skipping insertion in model container [2020-10-11 18:25:52,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:50" (2/3) ... [2020-10-11 18:25:52,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1867f0b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:25:52, skipping insertion in model container [2020-10-11 18:25:52,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:25:52" (3/3) ... [2020-10-11 18:25:52,445 INFO L111 eAbstractionObserver]: Analyzing ICFG mix056_rmo.opt.i [2020-10-11 18:25:52,456 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 18:25:52,463 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 18:25:52,464 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 18:25:52,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,491 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,491 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,493 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,493 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,496 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,496 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,496 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,498 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,504 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,504 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,506 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,506 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,506 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,512 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,512 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,513 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,515 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,516 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:52,532 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-11 18:25:52,553 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 18:25:52,553 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 18:25:52,553 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 18:25:52,553 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 18:25:52,553 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 18:25:52,554 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 18:25:52,554 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 18:25:52,554 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 18:25:52,567 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 91 transitions, 197 flow [2020-10-11 18:25:52,610 INFO L129 PetriNetUnfolder]: 2/88 cut-off events. [2020-10-11 18:25:52,610 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:25:52,615 INFO L80 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-11 18:25:52,615 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 91 transitions, 197 flow [2020-10-11 18:25:52,622 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 88 transitions, 185 flow [2020-10-11 18:25:52,637 INFO L129 PetriNetUnfolder]: 0/56 cut-off events. [2020-10-11 18:25:52,637 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:25:52,637 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:52,638 INFO L255 CegarLoopForPetriNet]: 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] [2020-10-11 18:25:52,639 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:25:52,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:52,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1064364671, now seen corresponding path program 1 times [2020-10-11 18:25:52,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:52,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282680772] [2020-10-11 18:25:52,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:52,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:25:52,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282680772] [2020-10-11 18:25:52,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:52,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 18:25:52,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770706862] [2020-10-11 18:25:52,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 18:25:52,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:52,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 18:25:52,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 18:25:53,132 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 91 [2020-10-11 18:25:53,135 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 185 flow. Second operand 3 states. [2020-10-11 18:25:53,135 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:53,135 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 91 [2020-10-11 18:25:53,137 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:53,175 INFO L129 PetriNetUnfolder]: 0/85 cut-off events. [2020-10-11 18:25:53,175 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:25:53,176 INFO L80 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 85 events. 0/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 4/87 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-11 18:25:53,177 INFO L132 encePairwiseOnDemand]: 86/91 looper letters, 0 selfloop transitions, 2 changer transitions 11/85 dead transitions. [2020-10-11 18:25:53,177 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 85 transitions, 183 flow [2020-10-11 18:25:53,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 18:25:53,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 18:25:53,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2020-10-11 18:25:53,193 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9706959706959707 [2020-10-11 18:25:53,193 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 265 transitions. [2020-10-11 18:25:53,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 265 transitions. [2020-10-11 18:25:53,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:53,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 265 transitions. [2020-10-11 18:25:53,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 18:25:53,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 18:25:53,207 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 18:25:53,210 INFO L185 Difference]: Start difference. First operand has 96 places, 88 transitions, 185 flow. Second operand 3 states and 265 transitions. [2020-10-11 18:25:53,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 85 transitions, 183 flow [2020-10-11 18:25:53,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 85 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-11 18:25:53,218 INFO L241 Difference]: Finished difference. Result has 94 places, 74 transitions, 158 flow [2020-10-11 18:25:53,221 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=94, PETRI_TRANSITIONS=74} [2020-10-11 18:25:53,222 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, -2 predicate places. [2020-10-11 18:25:53,222 INFO L481 AbstractCegarLoop]: Abstraction has has 94 places, 74 transitions, 158 flow [2020-10-11 18:25:53,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 18:25:53,222 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:53,222 INFO L255 CegarLoopForPetriNet]: 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] [2020-10-11 18:25:53,223 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 18:25:53,223 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:25:53,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:53,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1361861819, now seen corresponding path program 1 times [2020-10-11 18:25:53,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:53,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675228262] [2020-10-11 18:25:53,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:53,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:25:53,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675228262] [2020-10-11 18:25:53,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:53,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:25:53,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638461140] [2020-10-11 18:25:53,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:25:53,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:53,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:25:53,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:25:53,936 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 91 [2020-10-11 18:25:53,937 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 74 transitions, 158 flow. Second operand 10 states. [2020-10-11 18:25:53,937 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:53,937 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 91 [2020-10-11 18:25:53,938 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:54,319 INFO L129 PetriNetUnfolder]: 97/297 cut-off events. [2020-10-11 18:25:54,319 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-11 18:25:54,321 INFO L80 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 297 events. 97/297 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1315 event pairs, 45 based on Foata normal form. 9/300 useless extension candidates. Maximal degree in co-relation 481. Up to 106 conditions per place. [2020-10-11 18:25:54,323 INFO L132 encePairwiseOnDemand]: 80/91 looper letters, 13 selfloop transitions, 8 changer transitions 35/115 dead transitions. [2020-10-11 18:25:54,323 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 115 transitions, 366 flow [2020-10-11 18:25:54,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:25:54,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:25:54,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1154 transitions. [2020-10-11 18:25:54,331 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8454212454212454 [2020-10-11 18:25:54,331 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1154 transitions. [2020-10-11 18:25:54,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1154 transitions. [2020-10-11 18:25:54,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:54,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1154 transitions. [2020-10-11 18:25:54,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:25:54,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:25:54,344 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:25:54,344 INFO L185 Difference]: Start difference. First operand has 94 places, 74 transitions, 158 flow. Second operand 15 states and 1154 transitions. [2020-10-11 18:25:54,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 115 transitions, 366 flow [2020-10-11 18:25:54,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 115 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:25:54,351 INFO L241 Difference]: Finished difference. Result has 106 places, 78 transitions, 226 flow [2020-10-11 18:25:54,351 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=226, PETRI_PLACES=106, PETRI_TRANSITIONS=78} [2020-10-11 18:25:54,352 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, 10 predicate places. [2020-10-11 18:25:54,353 INFO L481 AbstractCegarLoop]: Abstraction has has 106 places, 78 transitions, 226 flow [2020-10-11 18:25:54,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:25:54,354 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:54,354 INFO L255 CegarLoopForPetriNet]: 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] [2020-10-11 18:25:54,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 18:25:54,355 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:25:54,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:54,356 INFO L82 PathProgramCache]: Analyzing trace with hash -33637938, now seen corresponding path program 1 times [2020-10-11 18:25:54,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:54,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632201913] [2020-10-11 18:25:54,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:54,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:25:54,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632201913] [2020-10-11 18:25:54,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:54,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:25:54,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633731975] [2020-10-11 18:25:54,717 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:25:54,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:54,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:25:54,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:25:55,873 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 91 [2020-10-11 18:25:55,874 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 78 transitions, 226 flow. Second operand 11 states. [2020-10-11 18:25:55,874 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:55,875 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 91 [2020-10-11 18:25:55,875 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:56,299 INFO L129 PetriNetUnfolder]: 69/256 cut-off events. [2020-10-11 18:25:56,299 INFO L130 PetriNetUnfolder]: For 452/455 co-relation queries the response was YES. [2020-10-11 18:25:56,302 INFO L80 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 256 events. 69/256 cut-off events. For 452/455 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1010 event pairs, 14 based on Foata normal form. 7/259 useless extension candidates. Maximal degree in co-relation 650. Up to 82 conditions per place. [2020-10-11 18:25:56,303 INFO L132 encePairwiseOnDemand]: 80/91 looper letters, 20 selfloop transitions, 9 changer transitions 25/112 dead transitions. [2020-10-11 18:25:56,304 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 112 transitions, 544 flow [2020-10-11 18:25:56,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-11 18:25:56,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-11 18:25:56,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1206 transitions. [2020-10-11 18:25:56,308 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8282967032967034 [2020-10-11 18:25:56,308 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1206 transitions. [2020-10-11 18:25:56,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1206 transitions. [2020-10-11 18:25:56,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:56,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1206 transitions. [2020-10-11 18:25:56,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. [2020-10-11 18:25:56,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 17 states. [2020-10-11 18:25:56,315 INFO L81 ComplementDD]: Finished complementDD. Result 17 states. [2020-10-11 18:25:56,315 INFO L185 Difference]: Start difference. First operand has 106 places, 78 transitions, 226 flow. Second operand 16 states and 1206 transitions. [2020-10-11 18:25:56,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 112 transitions, 544 flow [2020-10-11 18:25:56,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 112 transitions, 516 flow, removed 12 selfloop flow, removed 5 redundant places. [2020-10-11 18:25:56,322 INFO L241 Difference]: Finished difference. Result has 117 places, 80 transitions, 277 flow [2020-10-11 18:25:56,323 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=277, PETRI_PLACES=117, PETRI_TRANSITIONS=80} [2020-10-11 18:25:56,323 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, 21 predicate places. [2020-10-11 18:25:56,323 INFO L481 AbstractCegarLoop]: Abstraction has has 117 places, 80 transitions, 277 flow [2020-10-11 18:25:56,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:25:56,323 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:56,323 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:25:56,324 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 18:25:56,324 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:25:56,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:56,324 INFO L82 PathProgramCache]: Analyzing trace with hash 930505533, now seen corresponding path program 1 times [2020-10-11 18:25:56,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:56,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164023249] [2020-10-11 18:25:56,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:56,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:25:56,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164023249] [2020-10-11 18:25:56,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:56,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:25:56,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276259734] [2020-10-11 18:25:56,660 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:25:56,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:56,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:25:56,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:25:57,547 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 91 [2020-10-11 18:25:57,548 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 80 transitions, 277 flow. Second operand 11 states. [2020-10-11 18:25:57,548 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:57,548 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 91 [2020-10-11 18:25:57,549 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:57,841 INFO L129 PetriNetUnfolder]: 53/215 cut-off events. [2020-10-11 18:25:57,842 INFO L130 PetriNetUnfolder]: For 772/781 co-relation queries the response was YES. [2020-10-11 18:25:57,845 INFO L80 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 215 events. 53/215 cut-off events. For 772/781 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 752 event pairs, 13 based on Foata normal form. 6/217 useless extension candidates. Maximal degree in co-relation 680. Up to 84 conditions per place. [2020-10-11 18:25:57,847 INFO L132 encePairwiseOnDemand]: 80/91 looper letters, 21 selfloop transitions, 11 changer transitions 13/103 dead transitions. [2020-10-11 18:25:57,848 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 103 transitions, 573 flow [2020-10-11 18:25:57,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:25:57,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:25:57,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 978 transitions. [2020-10-11 18:25:57,852 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8267117497886729 [2020-10-11 18:25:57,852 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 978 transitions. [2020-10-11 18:25:57,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 978 transitions. [2020-10-11 18:25:57,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:57,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 978 transitions. [2020-10-11 18:25:57,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:25:57,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:25:57,857 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:25:57,857 INFO L185 Difference]: Start difference. First operand has 117 places, 80 transitions, 277 flow. Second operand 13 states and 978 transitions. [2020-10-11 18:25:57,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 103 transitions, 573 flow [2020-10-11 18:25:57,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 103 transitions, 502 flow, removed 28 selfloop flow, removed 10 redundant places. [2020-10-11 18:25:57,868 INFO L241 Difference]: Finished difference. Result has 117 places, 83 transitions, 306 flow [2020-10-11 18:25:57,868 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=306, PETRI_PLACES=117, PETRI_TRANSITIONS=83} [2020-10-11 18:25:57,868 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, 21 predicate places. [2020-10-11 18:25:57,868 INFO L481 AbstractCegarLoop]: Abstraction has has 117 places, 83 transitions, 306 flow [2020-10-11 18:25:57,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:25:57,869 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:57,869 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:25:57,869 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 18:25:57,870 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:25:57,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:57,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1305135865, now seen corresponding path program 2 times [2020-10-11 18:25:57,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:57,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769953310] [2020-10-11 18:25:57,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:58,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:25:58,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769953310] [2020-10-11 18:25:58,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:58,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:25:58,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451032535] [2020-10-11 18:25:58,261 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:25:58,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:58,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:25:58,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:25:59,339 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 91 [2020-10-11 18:25:59,341 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 83 transitions, 306 flow. Second operand 12 states. [2020-10-11 18:25:59,341 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:59,341 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 91 [2020-10-11 18:25:59,341 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:59,800 INFO L129 PetriNetUnfolder]: 63/237 cut-off events. [2020-10-11 18:25:59,800 INFO L130 PetriNetUnfolder]: For 1005/1044 co-relation queries the response was YES. [2020-10-11 18:25:59,802 INFO L80 FinitePrefix]: Finished finitePrefix Result has 893 conditions, 237 events. 63/237 cut-off events. For 1005/1044 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 874 event pairs, 2 based on Foata normal form. 18/251 useless extension candidates. Maximal degree in co-relation 821. Up to 57 conditions per place. [2020-10-11 18:25:59,804 INFO L132 encePairwiseOnDemand]: 79/91 looper letters, 19 selfloop transitions, 14 changer transitions 26/117 dead transitions. [2020-10-11 18:25:59,804 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 117 transitions, 747 flow [2020-10-11 18:25:59,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-11 18:25:59,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-11 18:25:59,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1281 transitions. [2020-10-11 18:25:59,809 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8280542986425339 [2020-10-11 18:25:59,809 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1281 transitions. [2020-10-11 18:25:59,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1281 transitions. [2020-10-11 18:25:59,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:59,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1281 transitions. [2020-10-11 18:25:59,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 18 states. [2020-10-11 18:25:59,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 18 states. [2020-10-11 18:25:59,816 INFO L81 ComplementDD]: Finished complementDD. Result 18 states. [2020-10-11 18:25:59,816 INFO L185 Difference]: Start difference. First operand has 117 places, 83 transitions, 306 flow. Second operand 17 states and 1281 transitions. [2020-10-11 18:25:59,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 117 transitions, 747 flow [2020-10-11 18:25:59,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 117 transitions, 668 flow, removed 32 selfloop flow, removed 10 redundant places. [2020-10-11 18:25:59,823 INFO L241 Difference]: Finished difference. Result has 128 places, 85 transitions, 371 flow [2020-10-11 18:25:59,823 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=371, PETRI_PLACES=128, PETRI_TRANSITIONS=85} [2020-10-11 18:25:59,823 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, 32 predicate places. [2020-10-11 18:25:59,823 INFO L481 AbstractCegarLoop]: Abstraction has has 128 places, 85 transitions, 371 flow [2020-10-11 18:25:59,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:25:59,824 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:59,824 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:25:59,824 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 18:25:59,824 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:25:59,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:59,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1793681760, now seen corresponding path program 1 times [2020-10-11 18:25:59,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:59,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878443966] [2020-10-11 18:25:59,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:59,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:25:59,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878443966] [2020-10-11 18:25:59,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:59,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:25:59,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504999452] [2020-10-11 18:25:59,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:25:59,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:59,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:25:59,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:26:00,113 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 91 [2020-10-11 18:26:00,114 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 85 transitions, 371 flow. Second operand 6 states. [2020-10-11 18:26:00,114 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:00,114 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 91 [2020-10-11 18:26:00,114 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:00,266 INFO L129 PetriNetUnfolder]: 88/339 cut-off events. [2020-10-11 18:26:00,267 INFO L130 PetriNetUnfolder]: For 2022/2039 co-relation queries the response was YES. [2020-10-11 18:26:00,270 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1261 conditions, 339 events. 88/339 cut-off events. For 2022/2039 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1732 event pairs, 12 based on Foata normal form. 17/348 useless extension candidates. Maximal degree in co-relation 1187. Up to 76 conditions per place. [2020-10-11 18:26:00,273 INFO L132 encePairwiseOnDemand]: 84/91 looper letters, 8 selfloop transitions, 3 changer transitions 19/106 dead transitions. [2020-10-11 18:26:00,273 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 106 transitions, 533 flow [2020-10-11 18:26:00,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:26:00,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:26:00,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 752 transitions. [2020-10-11 18:26:00,277 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9181929181929182 [2020-10-11 18:26:00,278 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 752 transitions. [2020-10-11 18:26:00,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 752 transitions. [2020-10-11 18:26:00,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:00,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 752 transitions. [2020-10-11 18:26:00,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:26:00,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:26:00,282 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:26:00,282 INFO L185 Difference]: Start difference. First operand has 128 places, 85 transitions, 371 flow. Second operand 9 states and 752 transitions. [2020-10-11 18:26:00,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 106 transitions, 533 flow [2020-10-11 18:26:00,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 106 transitions, 473 flow, removed 26 selfloop flow, removed 13 redundant places. [2020-10-11 18:26:00,291 INFO L241 Difference]: Finished difference. Result has 121 places, 87 transitions, 378 flow [2020-10-11 18:26:00,291 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=378, PETRI_PLACES=121, PETRI_TRANSITIONS=87} [2020-10-11 18:26:00,291 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, 25 predicate places. [2020-10-11 18:26:00,292 INFO L481 AbstractCegarLoop]: Abstraction has has 121 places, 87 transitions, 378 flow [2020-10-11 18:26:00,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:26:00,292 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:00,292 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:26:00,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 18:26:00,292 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:26:00,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:00,293 INFO L82 PathProgramCache]: Analyzing trace with hash 784878393, now seen corresponding path program 1 times [2020-10-11 18:26:00,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:00,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514739822] [2020-10-11 18:26:00,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:00,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:26:00,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514739822] [2020-10-11 18:26:00,614 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:00,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:26:00,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506082184] [2020-10-11 18:26:00,615 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:26:00,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:00,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:26:00,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:26:01,602 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 91 [2020-10-11 18:26:01,603 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 87 transitions, 378 flow. Second operand 10 states. [2020-10-11 18:26:01,603 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:01,603 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 91 [2020-10-11 18:26:01,603 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:02,106 INFO L129 PetriNetUnfolder]: 115/399 cut-off events. [2020-10-11 18:26:02,107 INFO L130 PetriNetUnfolder]: For 2366/2429 co-relation queries the response was YES. [2020-10-11 18:26:02,110 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1714 conditions, 399 events. 115/399 cut-off events. For 2366/2429 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2096 event pairs, 12 based on Foata normal form. 12/397 useless extension candidates. Maximal degree in co-relation 1641. Up to 152 conditions per place. [2020-10-11 18:26:02,114 INFO L132 encePairwiseOnDemand]: 80/91 looper letters, 26 selfloop transitions, 13 changer transitions 10/110 dead transitions. [2020-10-11 18:26:02,115 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 110 transitions, 716 flow [2020-10-11 18:26:02,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:26:02,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:26:02,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 926 transitions. [2020-10-11 18:26:02,118 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.847985347985348 [2020-10-11 18:26:02,118 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 926 transitions. [2020-10-11 18:26:02,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 926 transitions. [2020-10-11 18:26:02,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:02,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 926 transitions. [2020-10-11 18:26:02,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:26:02,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:26:02,124 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:26:02,124 INFO L185 Difference]: Start difference. First operand has 121 places, 87 transitions, 378 flow. Second operand 12 states and 926 transitions. [2020-10-11 18:26:02,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 110 transitions, 716 flow [2020-10-11 18:26:02,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 110 transitions, 693 flow, removed 10 selfloop flow, removed 4 redundant places. [2020-10-11 18:26:02,133 INFO L241 Difference]: Finished difference. Result has 130 places, 94 transitions, 504 flow [2020-10-11 18:26:02,134 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=504, PETRI_PLACES=130, PETRI_TRANSITIONS=94} [2020-10-11 18:26:02,134 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, 34 predicate places. [2020-10-11 18:26:02,134 INFO L481 AbstractCegarLoop]: Abstraction has has 130 places, 94 transitions, 504 flow [2020-10-11 18:26:02,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:26:02,134 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:02,134 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:26:02,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 18:26:02,135 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:26:02,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:02,135 INFO L82 PathProgramCache]: Analyzing trace with hash 131620725, now seen corresponding path program 2 times [2020-10-11 18:26:02,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:02,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013675723] [2020-10-11 18:26:02,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:02,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:26:02,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013675723] [2020-10-11 18:26:02,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:02,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-11 18:26:02,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052863828] [2020-10-11 18:26:02,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 18:26:02,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:02,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 18:26:02,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-10-11 18:26:03,611 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 91 [2020-10-11 18:26:03,612 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 94 transitions, 504 flow. Second operand 13 states. [2020-10-11 18:26:03,612 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:03,612 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 91 [2020-10-11 18:26:03,612 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:04,164 INFO L129 PetriNetUnfolder]: 121/402 cut-off events. [2020-10-11 18:26:04,164 INFO L130 PetriNetUnfolder]: For 3858/4069 co-relation queries the response was YES. [2020-10-11 18:26:04,169 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2077 conditions, 402 events. 121/402 cut-off events. For 3858/4069 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2095 event pairs, 19 based on Foata normal form. 21/410 useless extension candidates. Maximal degree in co-relation 1995. Up to 168 conditions per place. [2020-10-11 18:26:04,173 INFO L132 encePairwiseOnDemand]: 79/91 looper letters, 24 selfloop transitions, 16 changer transitions 10/109 dead transitions. [2020-10-11 18:26:04,173 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 109 transitions, 824 flow [2020-10-11 18:26:04,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:26:04,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:26:04,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1031 transitions. [2020-10-11 18:26:04,177 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8092621664050236 [2020-10-11 18:26:04,177 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1031 transitions. [2020-10-11 18:26:04,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1031 transitions. [2020-10-11 18:26:04,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:04,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1031 transitions. [2020-10-11 18:26:04,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:26:04,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:26:04,183 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:26:04,183 INFO L185 Difference]: Start difference. First operand has 130 places, 94 transitions, 504 flow. Second operand 14 states and 1031 transitions. [2020-10-11 18:26:04,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 109 transitions, 824 flow [2020-10-11 18:26:04,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 109 transitions, 743 flow, removed 39 selfloop flow, removed 8 redundant places. [2020-10-11 18:26:04,194 INFO L241 Difference]: Finished difference. Result has 136 places, 96 transitions, 558 flow [2020-10-11 18:26:04,195 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=558, PETRI_PLACES=136, PETRI_TRANSITIONS=96} [2020-10-11 18:26:04,195 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, 40 predicate places. [2020-10-11 18:26:04,195 INFO L481 AbstractCegarLoop]: Abstraction has has 136 places, 96 transitions, 558 flow [2020-10-11 18:26:04,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 18:26:04,195 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:04,196 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:26:04,196 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 18:26:04,198 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:26:04,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:04,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1610305671, now seen corresponding path program 1 times [2020-10-11 18:26:04,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:04,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932987364] [2020-10-11 18:26:04,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:04,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:26:04,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932987364] [2020-10-11 18:26:04,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:04,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:26:04,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233057487] [2020-10-11 18:26:04,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:26:04,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:04,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:26:04,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:26:04,432 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2020-10-11 18:26:04,433 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 96 transitions, 558 flow. Second operand 6 states. [2020-10-11 18:26:04,433 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:04,433 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2020-10-11 18:26:04,433 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:04,820 INFO L129 PetriNetUnfolder]: 333/946 cut-off events. [2020-10-11 18:26:04,821 INFO L130 PetriNetUnfolder]: For 4465/4520 co-relation queries the response was YES. [2020-10-11 18:26:04,829 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3203 conditions, 946 events. 333/946 cut-off events. For 4465/4520 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 6859 event pairs, 17 based on Foata normal form. 48/925 useless extension candidates. Maximal degree in co-relation 3122. Up to 208 conditions per place. [2020-10-11 18:26:04,840 INFO L132 encePairwiseOnDemand]: 82/91 looper letters, 19 selfloop transitions, 16 changer transitions 0/121 dead transitions. [2020-10-11 18:26:04,840 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 121 transitions, 678 flow [2020-10-11 18:26:04,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:26:04,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:26:04,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 739 transitions. [2020-10-11 18:26:04,852 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9023199023199023 [2020-10-11 18:26:04,852 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 739 transitions. [2020-10-11 18:26:04,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 739 transitions. [2020-10-11 18:26:04,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:04,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 739 transitions. [2020-10-11 18:26:04,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:26:04,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:26:04,872 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:26:04,872 INFO L185 Difference]: Start difference. First operand has 136 places, 96 transitions, 558 flow. Second operand 9 states and 739 transitions. [2020-10-11 18:26:04,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 121 transitions, 678 flow [2020-10-11 18:26:04,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 121 transitions, 610 flow, removed 21 selfloop flow, removed 12 redundant places. [2020-10-11 18:26:04,893 INFO L241 Difference]: Finished difference. Result has 131 places, 110 transitions, 601 flow [2020-10-11 18:26:04,893 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=601, PETRI_PLACES=131, PETRI_TRANSITIONS=110} [2020-10-11 18:26:04,894 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, 35 predicate places. [2020-10-11 18:26:04,894 INFO L481 AbstractCegarLoop]: Abstraction has has 131 places, 110 transitions, 601 flow [2020-10-11 18:26:04,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:26:04,894 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:04,894 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:26:04,894 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 18:26:04,894 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:26:04,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:04,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1298092967, now seen corresponding path program 1 times [2020-10-11 18:26:04,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:04,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038951836] [2020-10-11 18:26:04,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:05,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:26:05,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038951836] [2020-10-11 18:26:05,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:05,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-11 18:26:05,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527908638] [2020-10-11 18:26:05,294 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 18:26:05,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:05,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 18:26:05,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-10-11 18:26:07,401 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 91 [2020-10-11 18:26:07,402 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 110 transitions, 601 flow. Second operand 13 states. [2020-10-11 18:26:07,402 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:07,403 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 91 [2020-10-11 18:26:07,403 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:07,873 INFO L129 PetriNetUnfolder]: 237/1034 cut-off events. [2020-10-11 18:26:07,874 INFO L130 PetriNetUnfolder]: For 3751/4109 co-relation queries the response was YES. [2020-10-11 18:26:07,883 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3665 conditions, 1034 events. 237/1034 cut-off events. For 3751/4109 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8622 event pairs, 43 based on Foata normal form. 38/1008 useless extension candidates. Maximal degree in co-relation 3583. Up to 214 conditions per place. [2020-10-11 18:26:07,890 INFO L132 encePairwiseOnDemand]: 80/91 looper letters, 32 selfloop transitions, 22 changer transitions 0/128 dead transitions. [2020-10-11 18:26:07,890 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 128 transitions, 903 flow [2020-10-11 18:26:07,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:26:07,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:26:07,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1046 transitions. [2020-10-11 18:26:07,893 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8210361067503925 [2020-10-11 18:26:07,893 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1046 transitions. [2020-10-11 18:26:07,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1046 transitions. [2020-10-11 18:26:07,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:07,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1046 transitions. [2020-10-11 18:26:07,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:26:07,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:26:07,899 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:26:07,899 INFO L185 Difference]: Start difference. First operand has 131 places, 110 transitions, 601 flow. Second operand 14 states and 1046 transitions. [2020-10-11 18:26:07,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 128 transitions, 903 flow [2020-10-11 18:26:07,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 128 transitions, 879 flow, removed 11 selfloop flow, removed 1 redundant places. [2020-10-11 18:26:07,914 INFO L241 Difference]: Finished difference. Result has 150 places, 119 transitions, 791 flow [2020-10-11 18:26:07,915 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=791, PETRI_PLACES=150, PETRI_TRANSITIONS=119} [2020-10-11 18:26:07,916 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, 54 predicate places. [2020-10-11 18:26:07,916 INFO L481 AbstractCegarLoop]: Abstraction has has 150 places, 119 transitions, 791 flow [2020-10-11 18:26:07,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 18:26:07,916 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:07,916 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:26:07,916 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 18:26:07,916 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:26:07,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:07,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1054283787, now seen corresponding path program 1 times [2020-10-11 18:26:07,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:07,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892089361] [2020-10-11 18:26:07,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:08,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:26:08,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892089361] [2020-10-11 18:26:08,038 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:08,038 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:26:08,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934784259] [2020-10-11 18:26:08,039 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:26:08,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:08,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:26:08,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:26:08,202 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2020-10-11 18:26:08,203 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 119 transitions, 791 flow. Second operand 7 states. [2020-10-11 18:26:08,203 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:08,203 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2020-10-11 18:26:08,204 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:08,530 INFO L129 PetriNetUnfolder]: 318/986 cut-off events. [2020-10-11 18:26:08,530 INFO L130 PetriNetUnfolder]: For 3665/5448 co-relation queries the response was YES. [2020-10-11 18:26:08,539 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3658 conditions, 986 events. 318/986 cut-off events. For 3665/5448 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 7739 event pairs, 16 based on Foata normal form. 201/1104 useless extension candidates. Maximal degree in co-relation 3569. Up to 316 conditions per place. [2020-10-11 18:26:08,545 INFO L132 encePairwiseOnDemand]: 82/91 looper letters, 15 selfloop transitions, 31 changer transitions 15/141 dead transitions. [2020-10-11 18:26:08,545 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 141 transitions, 1015 flow [2020-10-11 18:26:08,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:26:08,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:26:08,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 986 transitions. [2020-10-11 18:26:08,548 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9029304029304029 [2020-10-11 18:26:08,548 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 986 transitions. [2020-10-11 18:26:08,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 986 transitions. [2020-10-11 18:26:08,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:08,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 986 transitions. [2020-10-11 18:26:08,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:26:08,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:26:08,554 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:26:08,555 INFO L185 Difference]: Start difference. First operand has 150 places, 119 transitions, 791 flow. Second operand 12 states and 986 transitions. [2020-10-11 18:26:08,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 141 transitions, 1015 flow [2020-10-11 18:26:08,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 141 transitions, 898 flow, removed 48 selfloop flow, removed 10 redundant places. [2020-10-11 18:26:08,569 INFO L241 Difference]: Finished difference. Result has 154 places, 123 transitions, 780 flow [2020-10-11 18:26:08,569 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=780, PETRI_PLACES=154, PETRI_TRANSITIONS=123} [2020-10-11 18:26:08,570 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, 58 predicate places. [2020-10-11 18:26:08,570 INFO L481 AbstractCegarLoop]: Abstraction has has 154 places, 123 transitions, 780 flow [2020-10-11 18:26:08,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:26:08,570 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:08,570 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:26:08,570 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 18:26:08,570 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:26:08,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:08,571 INFO L82 PathProgramCache]: Analyzing trace with hash 59504306, now seen corresponding path program 1 times [2020-10-11 18:26:08,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:08,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395419569] [2020-10-11 18:26:08,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:08,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:08,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:26:08,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395419569] [2020-10-11 18:26:08,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:08,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:26:08,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768071731] [2020-10-11 18:26:08,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:26:08,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:08,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:26:08,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:26:08,801 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 91 [2020-10-11 18:26:08,801 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 123 transitions, 780 flow. Second operand 6 states. [2020-10-11 18:26:08,801 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:08,801 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 91 [2020-10-11 18:26:08,801 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:09,100 INFO L129 PetriNetUnfolder]: 335/1216 cut-off events. [2020-10-11 18:26:09,101 INFO L130 PetriNetUnfolder]: For 4986/5703 co-relation queries the response was YES. [2020-10-11 18:26:09,110 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4491 conditions, 1216 events. 335/1216 cut-off events. For 4986/5703 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 10573 event pairs, 9 based on Foata normal form. 27/1141 useless extension candidates. Maximal degree in co-relation 4405. Up to 384 conditions per place. [2020-10-11 18:26:09,116 INFO L132 encePairwiseOnDemand]: 85/91 looper letters, 12 selfloop transitions, 3 changer transitions 10/137 dead transitions. [2020-10-11 18:26:09,116 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 137 transitions, 976 flow [2020-10-11 18:26:09,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:26:09,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:26:09,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 746 transitions. [2020-10-11 18:26:09,118 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9108669108669109 [2020-10-11 18:26:09,119 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 746 transitions. [2020-10-11 18:26:09,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 746 transitions. [2020-10-11 18:26:09,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:09,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 746 transitions. [2020-10-11 18:26:09,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:26:09,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:26:09,122 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:26:09,122 INFO L185 Difference]: Start difference. First operand has 154 places, 123 transitions, 780 flow. Second operand 9 states and 746 transitions. [2020-10-11 18:26:09,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 137 transitions, 976 flow [2020-10-11 18:26:09,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 137 transitions, 773 flow, removed 86 selfloop flow, removed 15 redundant places. [2020-10-11 18:26:09,149 INFO L241 Difference]: Finished difference. Result has 148 places, 123 transitions, 648 flow [2020-10-11 18:26:09,150 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=648, PETRI_PLACES=148, PETRI_TRANSITIONS=123} [2020-10-11 18:26:09,150 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, 52 predicate places. [2020-10-11 18:26:09,150 INFO L481 AbstractCegarLoop]: Abstraction has has 148 places, 123 transitions, 648 flow [2020-10-11 18:26:09,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:26:09,150 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:09,151 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:26:09,151 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 18:26:09,151 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:26:09,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:09,151 INFO L82 PathProgramCache]: Analyzing trace with hash 933061678, now seen corresponding path program 1 times [2020-10-11 18:26:09,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:09,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532537793] [2020-10-11 18:26:09,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:09,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:26:09,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532537793] [2020-10-11 18:26:09,267 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:09,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 18:26:09,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032437996] [2020-10-11 18:26:09,267 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 18:26:09,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:09,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 18:26:09,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 18:26:09,466 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2020-10-11 18:26:09,466 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 123 transitions, 648 flow. Second operand 8 states. [2020-10-11 18:26:09,466 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:09,467 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2020-10-11 18:26:09,467 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:09,878 INFO L129 PetriNetUnfolder]: 391/1171 cut-off events. [2020-10-11 18:26:09,878 INFO L130 PetriNetUnfolder]: For 1772/3846 co-relation queries the response was YES. [2020-10-11 18:26:09,887 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3522 conditions, 1171 events. 391/1171 cut-off events. For 1772/3846 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 10057 event pairs, 0 based on Foata normal form. 297/1331 useless extension candidates. Maximal degree in co-relation 3481. Up to 252 conditions per place. [2020-10-11 18:26:09,890 INFO L132 encePairwiseOnDemand]: 82/91 looper letters, 10 selfloop transitions, 36 changer transitions 18/140 dead transitions. [2020-10-11 18:26:09,890 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 140 transitions, 854 flow [2020-10-11 18:26:09,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:26:09,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:26:09,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1221 transitions. [2020-10-11 18:26:09,893 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8945054945054945 [2020-10-11 18:26:09,893 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1221 transitions. [2020-10-11 18:26:09,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1221 transitions. [2020-10-11 18:26:09,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:09,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1221 transitions. [2020-10-11 18:26:09,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:26:09,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:26:09,897 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:26:09,897 INFO L185 Difference]: Start difference. First operand has 148 places, 123 transitions, 648 flow. Second operand 15 states and 1221 transitions. [2020-10-11 18:26:09,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 140 transitions, 854 flow [2020-10-11 18:26:09,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 140 transitions, 763 flow, removed 38 selfloop flow, removed 19 redundant places. [2020-10-11 18:26:09,909 INFO L241 Difference]: Finished difference. Result has 143 places, 119 transitions, 643 flow [2020-10-11 18:26:09,909 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=643, PETRI_PLACES=143, PETRI_TRANSITIONS=119} [2020-10-11 18:26:09,909 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, 47 predicate places. [2020-10-11 18:26:09,910 INFO L481 AbstractCegarLoop]: Abstraction has has 143 places, 119 transitions, 643 flow [2020-10-11 18:26:09,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 18:26:09,910 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:09,910 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:26:09,910 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 18:26:09,910 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:26:09,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:09,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1882090886, now seen corresponding path program 1 times [2020-10-11 18:26:09,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:09,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809590092] [2020-10-11 18:26:09,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:10,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:26:10,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809590092] [2020-10-11 18:26:10,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:10,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:26:10,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491347112] [2020-10-11 18:26:10,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:26:10,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:10,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:26:10,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:26:10,154 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 91 [2020-10-11 18:26:10,155 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 119 transitions, 643 flow. Second operand 7 states. [2020-10-11 18:26:10,155 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:10,155 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 91 [2020-10-11 18:26:10,155 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:10,338 INFO L129 PetriNetUnfolder]: 233/912 cut-off events. [2020-10-11 18:26:10,338 INFO L130 PetriNetUnfolder]: For 1993/2223 co-relation queries the response was YES. [2020-10-11 18:26:10,344 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2652 conditions, 912 events. 233/912 cut-off events. For 1993/2223 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 7862 event pairs, 0 based on Foata normal form. 1/837 useless extension candidates. Maximal degree in co-relation 2580. Up to 132 conditions per place. [2020-10-11 18:26:10,346 INFO L132 encePairwiseOnDemand]: 85/91 looper letters, 9 selfloop transitions, 1 changer transitions 17/124 dead transitions. [2020-10-11 18:26:10,346 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 124 transitions, 687 flow [2020-10-11 18:26:10,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 18:26:10,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-11 18:26:10,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 569 transitions. [2020-10-11 18:26:10,348 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8932496075353218 [2020-10-11 18:26:10,348 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 569 transitions. [2020-10-11 18:26:10,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 569 transitions. [2020-10-11 18:26:10,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:10,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 569 transitions. [2020-10-11 18:26:10,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-11 18:26:10,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-11 18:26:10,350 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-11 18:26:10,350 INFO L185 Difference]: Start difference. First operand has 143 places, 119 transitions, 643 flow. Second operand 7 states and 569 transitions. [2020-10-11 18:26:10,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 124 transitions, 687 flow [2020-10-11 18:26:10,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 124 transitions, 615 flow, removed 7 selfloop flow, removed 15 redundant places. [2020-10-11 18:26:10,367 INFO L241 Difference]: Finished difference. Result has 137 places, 107 transitions, 494 flow [2020-10-11 18:26:10,367 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=494, PETRI_PLACES=137, PETRI_TRANSITIONS=107} [2020-10-11 18:26:10,367 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, 41 predicate places. [2020-10-11 18:26:10,367 INFO L481 AbstractCegarLoop]: Abstraction has has 137 places, 107 transitions, 494 flow [2020-10-11 18:26:10,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:26:10,368 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:10,368 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:26:10,368 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-11 18:26:10,368 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:26:10,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:10,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1836890206, now seen corresponding path program 2 times [2020-10-11 18:26:10,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:10,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755155506] [2020-10-11 18:26:10,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:26:10,407 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:26:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:26:10,455 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:26:10,523 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 18:26:10,524 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 18:26:10,524 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-11 18:26:10,593 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:10,593 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:10,595 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:10,595 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:10,596 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:10,596 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:10,596 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:10,597 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:10,597 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:10,597 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:10,597 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:10,598 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:10,600 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:10,600 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:10,600 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:10,600 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:10,601 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:10,601 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:10,601 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:10,602 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:10,602 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:10,602 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:10,605 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:10,605 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:10,606 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:10,606 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:10,607 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:10,607 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:10,607 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:10,607 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:10,608 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:10,608 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:10,609 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:10,609 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:10,609 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:10,610 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:10,616 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:10,616 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:10,617 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:10,617 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:10,617 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:10,618 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:10,618 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:10,618 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:10,619 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:10,619 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:10,619 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:10,619 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:10,620 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:10,620 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:10,620 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:10,621 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:10,622 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:10,622 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:10,622 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:10,623 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:10,623 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:10,623 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:10,624 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:10,624 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:10,624 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:10,625 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:10,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:26:10 BasicIcfg [2020-10-11 18:26:10,737 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 18:26:10,740 INFO L168 Benchmark]: Toolchain (without parser) took 20969.29 ms. Allocated memory was 253.2 MB in the beginning and 648.5 MB in the end (delta: 395.3 MB). Free memory was 205.8 MB in the beginning and 166.4 MB in the end (delta: 39.3 MB). Peak memory consumption was 434.6 MB. Max. memory is 14.2 GB. [2020-10-11 18:26:10,740 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 253.2 MB. Free memory is still 227.1 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 18:26:10,741 INFO L168 Benchmark]: CACSL2BoogieTranslator took 718.09 ms. Allocated memory was 253.2 MB in the beginning and 320.9 MB in the end (delta: 67.6 MB). Free memory was 205.8 MB in the beginning and 269.1 MB in the end (delta: -63.3 MB). Peak memory consumption was 29.6 MB. Max. memory is 14.2 GB. [2020-10-11 18:26:10,742 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.46 ms. Allocated memory is still 320.9 MB. Free memory was 269.1 MB in the beginning and 264.0 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. [2020-10-11 18:26:10,742 INFO L168 Benchmark]: Boogie Preprocessor took 40.31 ms. Allocated memory is still 320.9 MB. Free memory is still 264.0 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 18:26:10,743 INFO L168 Benchmark]: RCFGBuilder took 1844.11 ms. Allocated memory was 320.9 MB in the beginning and 360.2 MB in the end (delta: 39.3 MB). Free memory was 264.0 MB in the beginning and 210.7 MB in the end (delta: 53.3 MB). Peak memory consumption was 97.4 MB. Max. memory is 14.2 GB. [2020-10-11 18:26:10,744 INFO L168 Benchmark]: TraceAbstraction took 18298.59 ms. Allocated memory was 360.2 MB in the beginning and 648.5 MB in the end (delta: 288.4 MB). Free memory was 210.7 MB in the beginning and 166.4 MB in the end (delta: 44.3 MB). Peak memory consumption was 332.6 MB. Max. memory is 14.2 GB. [2020-10-11 18:26:10,748 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 253.2 MB. Free memory is still 227.1 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 718.09 ms. Allocated memory was 253.2 MB in the beginning and 320.9 MB in the end (delta: 67.6 MB). Free memory was 205.8 MB in the beginning and 269.1 MB in the end (delta: -63.3 MB). Peak memory consumption was 29.6 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 62.46 ms. Allocated memory is still 320.9 MB. Free memory was 269.1 MB in the beginning and 264.0 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 40.31 ms. Allocated memory is still 320.9 MB. Free memory is still 264.0 MB. There was no memory consumed. Max. memory is 14.2 GB. * RCFGBuilder took 1844.11 ms. Allocated memory was 320.9 MB in the beginning and 360.2 MB in the end (delta: 39.3 MB). Free memory was 264.0 MB in the beginning and 210.7 MB in the end (delta: 53.3 MB). Peak memory consumption was 97.4 MB. Max. memory is 14.2 GB. * TraceAbstraction took 18298.59 ms. Allocated memory was 360.2 MB in the beginning and 648.5 MB in the end (delta: 288.4 MB). Free memory was 210.7 MB in the beginning and 166.4 MB in the end (delta: 44.3 MB). Peak memory consumption was 332.6 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L700] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L701] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L702] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L704] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L707] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L708] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L709] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L710] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L711] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L712] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L713] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L714] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L715] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L716] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L717] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L718] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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}] [L719] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L720] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L721] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L722] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L724] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L725] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L726] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] 0 pthread_t t1504; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L803] 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] [L804] 0 pthread_t t1505; 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] [L805] 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] [L806] 0 pthread_t t1506; 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] [L807] 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] [L765] 3 y$w_buff1 = y$w_buff0 [L766] 3 y$w_buff0 = 2 [L767] 3 y$w_buff1_used = y$w_buff0_used [L768] 3 y$w_buff0_used = (_Bool)1 [L7] COND FALSE 3 !(!expression) [L770] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L771] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L772] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L773] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L774] 3 y$r_buff0_thd3 = (_Bool)1 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] 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] [L730] 1 z = 1 VAL [__unbuffered_cnt=0, __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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __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] [L738] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__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] [L745] 2 x = 2 VAL [__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=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] [L748] 2 y = 1 VAL [__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] [L751] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L751] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L752] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L752] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L753] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L753] 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 [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L754] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L755] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L755] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L758] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __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] [L780] 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) [L780] 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) [L781] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L781] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L782] 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 [L783] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L784] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L784] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L787] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __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=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__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] [L3] COND FALSE 0 !(!cond) VAL [__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] [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L813] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L814] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L814] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L815] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L815] 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 [L816] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L816] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L817] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 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 [L820] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L821] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L822] 0 y$flush_delayed = weak$$choice2 [L823] 0 y$mem_tmp = y [L824] 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) [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L824] 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) [L824] 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) [L825] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] EXPR 0 !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) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0 [L825] EXPR 0 !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) [L825] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] 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)) [L826] 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)) [L826] EXPR 0 !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) [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L826] EXPR 0 !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) [L826] 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)) [L826] 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)) [L827] 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)) [L827] 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)) [L828] 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)) [L828] 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)) [L829] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L829] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L829] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L829] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L829] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L830] 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)) [L830] 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)) [L831] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L832] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L832] 0 y = y$flush_delayed ? y$mem_tmp : y [L833] 0 y$flush_delayed = (_Bool)0 VAL [__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=255, x=2, y=2, y$flush_delayed=0, 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] [L7] COND TRUE 0 !expression VAL [__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=255, x=2, y=2, y$flush_delayed=0, 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] [L7] 0 __VERIFIER_error() VAL [__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=255, x=2, y=2, y$flush_delayed=0, 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, 90 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 17.9s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 14.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 318 SDtfs, 830 SDslu, 2266 SDs, 0 SdLazy, 2013 SolverSat, 344 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 214 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=791occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 893 NumberOfCodeBlocks, 893 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 811 ConstructedInterpolants, 0 QuantifiedInterpolants, 269626 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, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...