/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/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:45:18,438 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:45:18,441 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:45:18,480 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:45:18,480 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:45:18,489 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:45:18,492 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:45:18,495 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:45:18,498 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:45:18,501 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:45:18,502 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:45:18,503 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:45:18,503 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:45:18,506 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:45:18,508 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:45:18,510 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:45:18,512 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:45:18,513 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:45:18,514 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:45:18,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:45:18,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:45:18,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:45:18,526 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:45:18,527 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:45:18,542 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:45:18,543 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:45:18,543 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:45:18,544 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:45:18,547 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:45:18,548 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:45:18,549 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:45:18,551 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:45:18,552 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:45:18,553 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:45:18,557 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:45:18,557 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:45:18,558 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:45:18,558 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:45:18,558 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:45:18,559 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:45:18,560 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:45:18,561 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2020-10-16 01:45:18,599 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:45:18,599 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:45:18,601 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:45:18,601 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:45:18,601 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:45:18,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:45:18,601 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:45:18,602 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:45:18,602 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:45:18,602 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:45:18,603 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:45:18,603 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:45:18,603 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:45:18,603 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:45:18,604 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:45:18,604 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:45:18,604 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:45:18,604 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:45:18,604 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:45:18,604 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:45:18,604 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:45:18,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:45:18,605 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:45:18,605 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:45:18,605 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:45:18,605 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:45:18,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:45:18,605 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:45:18,606 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:45:18,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:45:18,924 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:45:18,928 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:45:18,930 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:45:18,930 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:45:18,931 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt.i [2020-10-16 01:45:19,002 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73772dac1/5a5bddafc45747f4ae0899a1e65636a8/FLAG16822ae2a [2020-10-16 01:45:19,546 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:45:19,547 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.opt.i [2020-10-16 01:45:19,563 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73772dac1/5a5bddafc45747f4ae0899a1e65636a8/FLAG16822ae2a [2020-10-16 01:45:19,796 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73772dac1/5a5bddafc45747f4ae0899a1e65636a8 [2020-10-16 01:45:19,806 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:45:19,809 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:45:19,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:45:19,810 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:45:19,813 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:45:19,815 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:45:19" (1/1) ... [2020-10-16 01:45:19,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39b6779b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:45:19, skipping insertion in model container [2020-10-16 01:45:19,818 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:45:19" (1/1) ... [2020-10-16 01:45:19,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:45:19,869 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:45:20,393 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:45:20,405 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:45:20,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:45:20,555 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:45:20,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:45:20 WrapperNode [2020-10-16 01:45:20,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:45:20,558 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:45:20,558 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:45:20,558 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:45:20,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:45:20" (1/1) ... [2020-10-16 01:45:20,585 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:45:20" (1/1) ... [2020-10-16 01:45:20,621 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:45:20,621 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:45:20,621 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:45:20,621 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:45:20,629 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:45:20" (1/1) ... [2020-10-16 01:45:20,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:45:20" (1/1) ... [2020-10-16 01:45:20,634 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:45:20" (1/1) ... [2020-10-16 01:45:20,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:45:20" (1/1) ... [2020-10-16 01:45:20,644 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:45:20" (1/1) ... [2020-10-16 01:45:20,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:45:20" (1/1) ... [2020-10-16 01:45:20,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:45:20" (1/1) ... [2020-10-16 01:45:20,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:45:20,658 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:45:20,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:45:20,658 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:45:20,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:45:20" (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-16 01:45:20,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:45:20,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:45:20,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:45:20,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:45:20,735 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:45:20,735 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:45:20,735 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:45:20,735 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:45:20,736 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 01:45:20,736 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 01:45:20,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:45:20,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:45:20,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:45:20,738 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 01:45:22,694 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:45:22,695 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:45:22,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:45:22 BoogieIcfgContainer [2020-10-16 01:45:22,697 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:45:22,698 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:45:22,699 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:45:22,702 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:45:22,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:45:19" (1/3) ... [2020-10-16 01:45:22,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f9b60d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:45:22, skipping insertion in model container [2020-10-16 01:45:22,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:45:20" (2/3) ... [2020-10-16 01:45:22,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f9b60d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:45:22, skipping insertion in model container [2020-10-16 01:45:22,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:45:22" (3/3) ... [2020-10-16 01:45:22,706 INFO L111 eAbstractionObserver]: Analyzing ICFG safe031_power.opt.i [2020-10-16 01:45:22,719 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:45:22,727 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:45:22,728 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:45:22,758 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,758 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,758 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,758 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,759 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,759 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,759 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,760 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,760 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,760 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,760 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,761 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,761 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,761 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,761 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,761 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,761 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,763 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,763 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,764 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,764 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,767 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,771 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,771 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,771 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,771 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,772 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,772 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,772 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,772 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,772 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,776 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,777 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,777 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,783 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,784 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,784 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,784 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:45:22,801 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 01:45:22,823 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:45:22,823 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:45:22,823 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:45:22,824 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:45:22,824 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:45:22,824 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:45:22,824 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:45:22,824 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:45:22,838 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 91 transitions, 197 flow [2020-10-16 01:45:22,884 INFO L129 PetriNetUnfolder]: 2/88 cut-off events. [2020-10-16 01:45:22,884 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:45:22,889 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 61 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-16 01:45:22,890 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 91 transitions, 197 flow [2020-10-16 01:45:22,896 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 88 transitions, 185 flow [2020-10-16 01:45:22,900 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:45:22,903 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 88 transitions, 185 flow [2020-10-16 01:45:22,907 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 88 transitions, 185 flow [2020-10-16 01:45:22,908 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 96 places, 88 transitions, 185 flow [2020-10-16 01:45:22,935 INFO L129 PetriNetUnfolder]: 2/88 cut-off events. [2020-10-16 01:45:22,935 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:45:22,936 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 60 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-16 01:45:22,939 INFO L117 LiptonReduction]: Number of co-enabled transitions 1536 [2020-10-16 01:45:23,377 WARN L193 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 01:45:23,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:45:23,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:23,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:45:23,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:23,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:45:23,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:23,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:45:23,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:23,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:45:23,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:23,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-10-16 01:45:23,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:23,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:45:23,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:23,782 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:45:23,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:24,996 WARN L193 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-16 01:45:25,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 01:45:25,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:25,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:45:25,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:25,766 WARN L193 SmtUtils]: Spent 738.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-10-16 01:45:25,998 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2020-10-16 01:45:26,041 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:45:26,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:26,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:45:26,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:26,073 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:45:26,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:26,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:45:26,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:26,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:45:26,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:26,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:45:26,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:26,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:45:26,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:45:26,200 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:45:26,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:26,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-10-16 01:45:26,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:26,235 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:45:26,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:26,597 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 01:45:26,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:45:26,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:26,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:45:26,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:26,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:26,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:26,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:26,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:45:26,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:45:26,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:45:26,869 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:26,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:26,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:26,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:26,873 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:26,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:45:26,875 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:45:26,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:45:26,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:45:26,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:26,987 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:26,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:26,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:26,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:45:26,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:45:26,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:45:27,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:27,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:27,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:27,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:45:27,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:45:27,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:45:27,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:45:27,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:45:27,974 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-16 01:45:28,088 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-16 01:45:28,097 INFO L132 LiptonReduction]: Checked pairs total: 4027 [2020-10-16 01:45:28,097 INFO L134 LiptonReduction]: Total number of compositions: 77 [2020-10-16 01:45:28,100 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5203 [2020-10-16 01:45:28,107 INFO L129 PetriNetUnfolder]: 0/11 cut-off events. [2020-10-16 01:45:28,107 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:45:28,108 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:28,108 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:45:28,109 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-16 01:45:28,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:28,115 INFO L82 PathProgramCache]: Analyzing trace with hash -755541581, now seen corresponding path program 1 times [2020-10-16 01:45:28,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:28,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123373802] [2020-10-16 01:45:28,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:45:28,380 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-16 01:45:28,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123373802] [2020-10-16 01:45:28,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:45:28,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:45:28,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201098551] [2020-10-16 01:45:28,393 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:45:28,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:45:28,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:45:28,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:45:28,412 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 168 [2020-10-16 01:45:28,414 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states. [2020-10-16 01:45:28,414 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:45:28,414 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 168 [2020-10-16 01:45:28,416 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:45:28,476 INFO L129 PetriNetUnfolder]: 16/63 cut-off events. [2020-10-16 01:45:28,476 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:45:28,477 INFO L80 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 63 events. 16/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 208 event pairs, 6 based on Foata normal form. 6/63 useless extension candidates. Maximal degree in co-relation 98. Up to 27 conditions per place. [2020-10-16 01:45:28,479 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 7 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2020-10-16 01:45:28,479 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 25 transitions, 77 flow [2020-10-16 01:45:28,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:45:28,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:45:28,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2020-10-16 01:45:28,497 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8511904761904762 [2020-10-16 01:45:28,498 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2020-10-16 01:45:28,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2020-10-16 01:45:28,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:45:28,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2020-10-16 01:45:28,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:45:28,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:45:28,517 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:45:28,519 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states and 429 transitions. [2020-10-16 01:45:28,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 25 transitions, 77 flow [2020-10-16 01:45:28,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 25 transitions, 74 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 01:45:28,526 INFO L241 Difference]: Finished difference. Result has 31 places, 22 transitions, 54 flow [2020-10-16 01:45:28,528 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2020-10-16 01:45:28,530 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2020-10-16 01:45:28,530 INFO L481 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 54 flow [2020-10-16 01:45:28,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:45:28,530 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:28,530 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:45:28,531 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:45:28,531 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-16 01:45:28,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:28,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1585839773, now seen corresponding path program 1 times [2020-10-16 01:45:28,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:28,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583977322] [2020-10-16 01:45:28,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:45:28,761 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-16 01:45:28,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583977322] [2020-10-16 01:45:28,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:45:28,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:45:28,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330970531] [2020-10-16 01:45:28,764 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:45:28,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:45:28,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:45:28,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:45:28,767 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 168 [2020-10-16 01:45:28,767 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 54 flow. Second operand 5 states. [2020-10-16 01:45:28,767 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:45:28,767 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 168 [2020-10-16 01:45:28,768 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:45:28,943 INFO L129 PetriNetUnfolder]: 152/315 cut-off events. [2020-10-16 01:45:28,943 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-16 01:45:28,944 INFO L80 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 315 events. 152/315 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1615 event pairs, 82 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 596. Up to 180 conditions per place. [2020-10-16 01:45:28,946 INFO L132 encePairwiseOnDemand]: 163/168 looper letters, 10 selfloop transitions, 3 changer transitions 12/37 dead transitions. [2020-10-16 01:45:28,947 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 140 flow [2020-10-16 01:45:28,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:45:28,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:45:28,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2020-10-16 01:45:28,951 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7047619047619048 [2020-10-16 01:45:28,951 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 592 transitions. [2020-10-16 01:45:28,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 592 transitions. [2020-10-16 01:45:28,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:45:28,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 592 transitions. [2020-10-16 01:45:28,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:45:28,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:45:28,957 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:45:28,957 INFO L185 Difference]: Start difference. First operand has 31 places, 22 transitions, 54 flow. Second operand 5 states and 592 transitions. [2020-10-16 01:45:28,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 140 flow [2020-10-16 01:45:28,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 37 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:45:28,959 INFO L241 Difference]: Finished difference. Result has 36 places, 23 transitions, 75 flow [2020-10-16 01:45:28,959 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=75, PETRI_PLACES=36, PETRI_TRANSITIONS=23} [2020-10-16 01:45:28,960 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2020-10-16 01:45:28,960 INFO L481 AbstractCegarLoop]: Abstraction has has 36 places, 23 transitions, 75 flow [2020-10-16 01:45:28,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:45:28,960 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:28,960 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:45:28,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:45:28,961 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-16 01:45:28,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:28,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1692580395, now seen corresponding path program 1 times [2020-10-16 01:45:28,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:28,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602981005] [2020-10-16 01:45:28,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:45:29,182 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-16 01:45:29,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602981005] [2020-10-16 01:45:29,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:45:29,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:45:29,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364310989] [2020-10-16 01:45:29,183 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:45:29,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:45:29,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:45:29,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:45:29,186 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 168 [2020-10-16 01:45:29,186 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 23 transitions, 75 flow. Second operand 5 states. [2020-10-16 01:45:29,186 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:45:29,186 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 168 [2020-10-16 01:45:29,187 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:45:29,314 INFO L129 PetriNetUnfolder]: 85/189 cut-off events. [2020-10-16 01:45:29,314 INFO L130 PetriNetUnfolder]: For 95/95 co-relation queries the response was YES. [2020-10-16 01:45:29,316 INFO L80 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 189 events. 85/189 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 828 event pairs, 47 based on Foata normal form. 9/195 useless extension candidates. Maximal degree in co-relation 442. Up to 121 conditions per place. [2020-10-16 01:45:29,318 INFO L132 encePairwiseOnDemand]: 163/168 looper letters, 9 selfloop transitions, 4 changer transitions 7/34 dead transitions. [2020-10-16 01:45:29,318 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 34 transitions, 154 flow [2020-10-16 01:45:29,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:45:29,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:45:29,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2020-10-16 01:45:29,321 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2020-10-16 01:45:29,321 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 595 transitions. [2020-10-16 01:45:29,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 595 transitions. [2020-10-16 01:45:29,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:45:29,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 595 transitions. [2020-10-16 01:45:29,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:45:29,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:45:29,325 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:45:29,325 INFO L185 Difference]: Start difference. First operand has 36 places, 23 transitions, 75 flow. Second operand 5 states and 595 transitions. [2020-10-16 01:45:29,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 34 transitions, 154 flow [2020-10-16 01:45:29,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 34 transitions, 148 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 01:45:29,328 INFO L241 Difference]: Finished difference. Result has 38 places, 26 transitions, 110 flow [2020-10-16 01:45:29,328 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2020-10-16 01:45:29,328 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places. [2020-10-16 01:45:29,329 INFO L481 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 110 flow [2020-10-16 01:45:29,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:45:29,329 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:29,329 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:45:29,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:45:29,329 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-16 01:45:29,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:29,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1898982904, now seen corresponding path program 1 times [2020-10-16 01:45:29,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:29,330 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434446180] [2020-10-16 01:45:29,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:45:29,418 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-16 01:45:29,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434446180] [2020-10-16 01:45:29,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:45:29,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:45:29,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722083477] [2020-10-16 01:45:29,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:45:29,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:45:29,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:45:29,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:45:29,422 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 168 [2020-10-16 01:45:29,423 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 110 flow. Second operand 5 states. [2020-10-16 01:45:29,423 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:45:29,424 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 168 [2020-10-16 01:45:29,424 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:45:29,623 INFO L129 PetriNetUnfolder]: 125/269 cut-off events. [2020-10-16 01:45:29,624 INFO L130 PetriNetUnfolder]: For 346/350 co-relation queries the response was YES. [2020-10-16 01:45:29,626 INFO L80 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 269 events. 125/269 cut-off events. For 346/350 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1181 event pairs, 60 based on Foata normal form. 22/291 useless extension candidates. Maximal degree in co-relation 734. Up to 162 conditions per place. [2020-10-16 01:45:29,631 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 13 selfloop transitions, 6 changer transitions 8/40 dead transitions. [2020-10-16 01:45:29,631 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 208 flow [2020-10-16 01:45:29,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:45:29,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:45:29,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 687 transitions. [2020-10-16 01:45:29,639 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6815476190476191 [2020-10-16 01:45:29,639 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 687 transitions. [2020-10-16 01:45:29,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 687 transitions. [2020-10-16 01:45:29,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:45:29,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 687 transitions. [2020-10-16 01:45:29,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:45:29,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:45:29,649 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:45:29,649 INFO L185 Difference]: Start difference. First operand has 38 places, 26 transitions, 110 flow. Second operand 6 states and 687 transitions. [2020-10-16 01:45:29,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 40 transitions, 208 flow [2020-10-16 01:45:29,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 200 flow, removed 2 selfloop flow, removed 2 redundant places. [2020-10-16 01:45:29,653 INFO L241 Difference]: Finished difference. Result has 42 places, 28 transitions, 140 flow [2020-10-16 01:45:29,654 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=140, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2020-10-16 01:45:29,654 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 9 predicate places. [2020-10-16 01:45:29,656 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 140 flow [2020-10-16 01:45:29,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:45:29,657 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:29,657 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:45:29,660 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:45:29,660 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-16 01:45:29,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:29,661 INFO L82 PathProgramCache]: Analyzing trace with hash -930381176, now seen corresponding path program 1 times [2020-10-16 01:45:29,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:29,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387201234] [2020-10-16 01:45:29,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:45:29,852 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-16 01:45:29,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387201234] [2020-10-16 01:45:29,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:45:29,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:45:29,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339650508] [2020-10-16 01:45:29,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:45:29,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:45:29,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:45:29,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:45:29,859 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 168 [2020-10-16 01:45:29,860 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 140 flow. Second operand 6 states. [2020-10-16 01:45:29,860 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:45:29,860 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 168 [2020-10-16 01:45:29,860 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:45:30,005 INFO L129 PetriNetUnfolder]: 81/199 cut-off events. [2020-10-16 01:45:30,005 INFO L130 PetriNetUnfolder]: For 506/506 co-relation queries the response was YES. [2020-10-16 01:45:30,007 INFO L80 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 199 events. 81/199 cut-off events. For 506/506 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 894 event pairs, 39 based on Foata normal form. 13/208 useless extension candidates. Maximal degree in co-relation 612. Up to 109 conditions per place. [2020-10-16 01:45:30,009 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 10 selfloop transitions, 6 changer transitions 6/38 dead transitions. [2020-10-16 01:45:30,009 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 38 transitions, 222 flow [2020-10-16 01:45:30,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:45:30,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:45:30,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 700 transitions. [2020-10-16 01:45:30,014 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2020-10-16 01:45:30,014 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 700 transitions. [2020-10-16 01:45:30,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 700 transitions. [2020-10-16 01:45:30,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:45:30,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 700 transitions. [2020-10-16 01:45:30,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:45:30,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:45:30,020 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:45:30,020 INFO L185 Difference]: Start difference. First operand has 42 places, 28 transitions, 140 flow. Second operand 6 states and 700 transitions. [2020-10-16 01:45:30,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 38 transitions, 222 flow [2020-10-16 01:45:30,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 38 transitions, 208 flow, removed 3 selfloop flow, removed 3 redundant places. [2020-10-16 01:45:30,024 INFO L241 Difference]: Finished difference. Result has 45 places, 30 transitions, 164 flow [2020-10-16 01:45:30,025 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=164, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2020-10-16 01:45:30,025 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 12 predicate places. [2020-10-16 01:45:30,025 INFO L481 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 164 flow [2020-10-16 01:45:30,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:45:30,025 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:30,025 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:45:30,026 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:45:30,026 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-16 01:45:30,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:30,026 INFO L82 PathProgramCache]: Analyzing trace with hash -882668701, now seen corresponding path program 1 times [2020-10-16 01:45:30,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:30,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413011278] [2020-10-16 01:45:30,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:45:30,146 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-16 01:45:30,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413011278] [2020-10-16 01:45:30,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:45:30,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:45:30,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631539069] [2020-10-16 01:45:30,148 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:45:30,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:45:30,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:45:30,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:45:30,150 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 168 [2020-10-16 01:45:30,150 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 30 transitions, 164 flow. Second operand 6 states. [2020-10-16 01:45:30,151 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:45:30,151 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 168 [2020-10-16 01:45:30,151 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:45:30,316 INFO L129 PetriNetUnfolder]: 75/176 cut-off events. [2020-10-16 01:45:30,317 INFO L130 PetriNetUnfolder]: For 617/617 co-relation queries the response was YES. [2020-10-16 01:45:30,318 INFO L80 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 176 events. 75/176 cut-off events. For 617/617 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 711 event pairs, 18 based on Foata normal form. 8/184 useless extension candidates. Maximal degree in co-relation 647. Up to 101 conditions per place. [2020-10-16 01:45:30,321 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 12 selfloop transitions, 9 changer transitions 6/43 dead transitions. [2020-10-16 01:45:30,322 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 43 transitions, 304 flow [2020-10-16 01:45:30,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:45:30,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:45:30,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 829 transitions. [2020-10-16 01:45:30,325 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7049319727891157 [2020-10-16 01:45:30,326 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 829 transitions. [2020-10-16 01:45:30,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 829 transitions. [2020-10-16 01:45:30,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:45:30,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 829 transitions. [2020-10-16 01:45:30,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:45:30,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:45:30,331 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:45:30,331 INFO L185 Difference]: Start difference. First operand has 45 places, 30 transitions, 164 flow. Second operand 7 states and 829 transitions. [2020-10-16 01:45:30,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 43 transitions, 304 flow [2020-10-16 01:45:30,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 43 transitions, 288 flow, removed 4 selfloop flow, removed 3 redundant places. [2020-10-16 01:45:30,336 INFO L241 Difference]: Finished difference. Result has 50 places, 33 transitions, 204 flow [2020-10-16 01:45:30,336 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=204, PETRI_PLACES=50, PETRI_TRANSITIONS=33} [2020-10-16 01:45:30,336 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2020-10-16 01:45:30,336 INFO L481 AbstractCegarLoop]: Abstraction has has 50 places, 33 transitions, 204 flow [2020-10-16 01:45:30,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:45:30,336 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:30,337 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:45:30,337 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:45:30,337 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-16 01:45:30,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:30,337 INFO L82 PathProgramCache]: Analyzing trace with hash -2088169095, now seen corresponding path program 1 times [2020-10-16 01:45:30,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:30,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946174435] [2020-10-16 01:45:30,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:45:30,420 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-16 01:45:30,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946174435] [2020-10-16 01:45:30,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:45:30,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:45:30,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573040219] [2020-10-16 01:45:30,422 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:45:30,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:45:30,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:45:30,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:45:30,425 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 168 [2020-10-16 01:45:30,425 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 33 transitions, 204 flow. Second operand 4 states. [2020-10-16 01:45:30,426 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:45:30,426 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 168 [2020-10-16 01:45:30,426 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:45:30,486 INFO L129 PetriNetUnfolder]: 31/124 cut-off events. [2020-10-16 01:45:30,486 INFO L130 PetriNetUnfolder]: For 1039/1062 co-relation queries the response was YES. [2020-10-16 01:45:30,487 INFO L80 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 124 events. 31/124 cut-off events. For 1039/1062 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 620 event pairs, 13 based on Foata normal form. 14/132 useless extension candidates. Maximal degree in co-relation 497. Up to 39 conditions per place. [2020-10-16 01:45:30,489 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 6 selfloop transitions, 3 changer transitions 2/36 dead transitions. [2020-10-16 01:45:30,489 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 36 transitions, 264 flow [2020-10-16 01:45:30,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:45:30,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:45:30,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 686 transitions. [2020-10-16 01:45:30,492 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8166666666666667 [2020-10-16 01:45:30,492 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 686 transitions. [2020-10-16 01:45:30,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 686 transitions. [2020-10-16 01:45:30,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:45:30,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 686 transitions. [2020-10-16 01:45:30,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:45:30,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:45:30,497 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:45:30,497 INFO L185 Difference]: Start difference. First operand has 50 places, 33 transitions, 204 flow. Second operand 5 states and 686 transitions. [2020-10-16 01:45:30,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 36 transitions, 264 flow [2020-10-16 01:45:30,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 36 transitions, 233 flow, removed 12 selfloop flow, removed 3 redundant places. [2020-10-16 01:45:30,500 INFO L241 Difference]: Finished difference. Result has 51 places, 33 transitions, 196 flow [2020-10-16 01:45:30,501 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=51, PETRI_TRANSITIONS=33} [2020-10-16 01:45:30,501 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 18 predicate places. [2020-10-16 01:45:30,501 INFO L481 AbstractCegarLoop]: Abstraction has has 51 places, 33 transitions, 196 flow [2020-10-16 01:45:30,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:45:30,501 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:30,502 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:45:30,502 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:45:30,502 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-16 01:45:30,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:30,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1592922438, now seen corresponding path program 1 times [2020-10-16 01:45:30,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:30,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891474800] [2020-10-16 01:45:30,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:45:30,585 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-16 01:45:30,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891474800] [2020-10-16 01:45:30,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:45:30,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:45:30,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430359720] [2020-10-16 01:45:30,586 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:45:30,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:45:30,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:45:30,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:45:30,588 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 168 [2020-10-16 01:45:30,589 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 33 transitions, 196 flow. Second operand 6 states. [2020-10-16 01:45:30,589 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:45:30,589 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 168 [2020-10-16 01:45:30,589 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:45:30,815 INFO L129 PetriNetUnfolder]: 74/212 cut-off events. [2020-10-16 01:45:30,815 INFO L130 PetriNetUnfolder]: For 1034/1050 co-relation queries the response was YES. [2020-10-16 01:45:30,817 INFO L80 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 212 events. 74/212 cut-off events. For 1034/1050 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1075 event pairs, 17 based on Foata normal form. 11/223 useless extension candidates. Maximal degree in co-relation 799. Up to 111 conditions per place. [2020-10-16 01:45:30,818 INFO L132 encePairwiseOnDemand]: 160/168 looper letters, 15 selfloop transitions, 13 changer transitions 5/49 dead transitions. [2020-10-16 01:45:30,819 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 49 transitions, 377 flow [2020-10-16 01:45:30,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:45:30,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:45:30,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 829 transitions. [2020-10-16 01:45:30,823 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7049319727891157 [2020-10-16 01:45:30,823 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 829 transitions. [2020-10-16 01:45:30,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 829 transitions. [2020-10-16 01:45:30,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:45:30,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 829 transitions. [2020-10-16 01:45:30,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:45:30,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:45:30,828 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:45:30,828 INFO L185 Difference]: Start difference. First operand has 51 places, 33 transitions, 196 flow. Second operand 7 states and 829 transitions. [2020-10-16 01:45:30,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 49 transitions, 377 flow [2020-10-16 01:45:30,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 49 transitions, 356 flow, removed 9 selfloop flow, removed 4 redundant places. [2020-10-16 01:45:30,833 INFO L241 Difference]: Finished difference. Result has 55 places, 42 transitions, 300 flow [2020-10-16 01:45:30,833 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=300, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2020-10-16 01:45:30,834 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 22 predicate places. [2020-10-16 01:45:30,834 INFO L481 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 300 flow [2020-10-16 01:45:30,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:45:30,834 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:30,834 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:45:30,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:45:30,835 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-16 01:45:30,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:30,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1593858452, now seen corresponding path program 1 times [2020-10-16 01:45:30,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:30,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212764592] [2020-10-16 01:45:30,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:45:30,932 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-16 01:45:30,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212764592] [2020-10-16 01:45:30,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:45:30,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:45:30,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153124284] [2020-10-16 01:45:30,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:45:30,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:45:30,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:45:30,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:45:30,935 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 168 [2020-10-16 01:45:30,936 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 300 flow. Second operand 6 states. [2020-10-16 01:45:30,936 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:45:30,936 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 168 [2020-10-16 01:45:30,937 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:45:31,101 INFO L129 PetriNetUnfolder]: 60/199 cut-off events. [2020-10-16 01:45:31,101 INFO L130 PetriNetUnfolder]: For 1047/1060 co-relation queries the response was YES. [2020-10-16 01:45:31,103 INFO L80 FinitePrefix]: Finished finitePrefix Result has 833 conditions, 199 events. 60/199 cut-off events. For 1047/1060 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1058 event pairs, 8 based on Foata normal form. 18/217 useless extension candidates. Maximal degree in co-relation 807. Up to 58 conditions per place. [2020-10-16 01:45:31,104 INFO L132 encePairwiseOnDemand]: 163/168 looper letters, 17 selfloop transitions, 7 changer transitions 11/50 dead transitions. [2020-10-16 01:45:31,104 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 50 transitions, 445 flow [2020-10-16 01:45:31,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:45:31,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:45:31,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 728 transitions. [2020-10-16 01:45:31,107 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2020-10-16 01:45:31,108 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 728 transitions. [2020-10-16 01:45:31,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 728 transitions. [2020-10-16 01:45:31,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:45:31,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 728 transitions. [2020-10-16 01:45:31,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:45:31,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:45:31,112 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:45:31,112 INFO L185 Difference]: Start difference. First operand has 55 places, 42 transitions, 300 flow. Second operand 6 states and 728 transitions. [2020-10-16 01:45:31,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 50 transitions, 445 flow [2020-10-16 01:45:31,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 50 transitions, 410 flow, removed 17 selfloop flow, removed 3 redundant places. [2020-10-16 01:45:31,119 INFO L241 Difference]: Finished difference. Result has 58 places, 36 transitions, 246 flow [2020-10-16 01:45:31,119 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=58, PETRI_TRANSITIONS=36} [2020-10-16 01:45:31,120 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 25 predicate places. [2020-10-16 01:45:31,120 INFO L481 AbstractCegarLoop]: Abstraction has has 58 places, 36 transitions, 246 flow [2020-10-16 01:45:31,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:45:31,120 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:31,120 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:45:31,120 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:45:31,121 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-16 01:45:31,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:31,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1672119409, now seen corresponding path program 1 times [2020-10-16 01:45:31,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:31,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200116724] [2020-10-16 01:45:31,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:45:31,198 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-16 01:45:31,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200116724] [2020-10-16 01:45:31,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:45:31,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:45:31,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323109982] [2020-10-16 01:45:31,200 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:45:31,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:45:31,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:45:31,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:45:31,202 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 168 [2020-10-16 01:45:31,202 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 36 transitions, 246 flow. Second operand 4 states. [2020-10-16 01:45:31,202 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:45:31,202 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 168 [2020-10-16 01:45:31,203 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:45:31,286 INFO L129 PetriNetUnfolder]: 106/281 cut-off events. [2020-10-16 01:45:31,286 INFO L130 PetriNetUnfolder]: For 875/904 co-relation queries the response was YES. [2020-10-16 01:45:31,288 INFO L80 FinitePrefix]: Finished finitePrefix Result has 903 conditions, 281 events. 106/281 cut-off events. For 875/904 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 1663 event pairs, 40 based on Foata normal form. 43/308 useless extension candidates. Maximal degree in co-relation 875. Up to 152 conditions per place. [2020-10-16 01:45:31,289 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 8 selfloop transitions, 7 changer transitions 4/45 dead transitions. [2020-10-16 01:45:31,290 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 45 transitions, 290 flow [2020-10-16 01:45:31,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:45:31,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:45:31,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 693 transitions. [2020-10-16 01:45:31,293 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.825 [2020-10-16 01:45:31,293 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 693 transitions. [2020-10-16 01:45:31,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 693 transitions. [2020-10-16 01:45:31,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:45:31,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 693 transitions. [2020-10-16 01:45:31,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:45:31,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:45:31,298 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:45:31,298 INFO L185 Difference]: Start difference. First operand has 58 places, 36 transitions, 246 flow. Second operand 5 states and 693 transitions. [2020-10-16 01:45:31,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 45 transitions, 290 flow [2020-10-16 01:45:31,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 45 transitions, 261 flow, removed 7 selfloop flow, removed 8 redundant places. [2020-10-16 01:45:31,305 INFO L241 Difference]: Finished difference. Result has 55 places, 39 transitions, 254 flow [2020-10-16 01:45:31,306 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=254, PETRI_PLACES=55, PETRI_TRANSITIONS=39} [2020-10-16 01:45:31,306 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 22 predicate places. [2020-10-16 01:45:31,306 INFO L481 AbstractCegarLoop]: Abstraction has has 55 places, 39 transitions, 254 flow [2020-10-16 01:45:31,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:45:31,307 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:31,307 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:45:31,307 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:45:31,307 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-16 01:45:31,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:31,308 INFO L82 PathProgramCache]: Analyzing trace with hash -862015459, now seen corresponding path program 1 times [2020-10-16 01:45:31,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:31,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885148157] [2020-10-16 01:45:31,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:45:31,399 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-16 01:45:31,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885148157] [2020-10-16 01:45:31,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:45:31,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:45:31,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515106513] [2020-10-16 01:45:31,401 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:45:31,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:45:31,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:45:31,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:45:31,402 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 168 [2020-10-16 01:45:31,403 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 39 transitions, 254 flow. Second operand 5 states. [2020-10-16 01:45:31,403 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:45:31,403 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 168 [2020-10-16 01:45:31,403 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:45:31,490 INFO L129 PetriNetUnfolder]: 53/186 cut-off events. [2020-10-16 01:45:31,491 INFO L130 PetriNetUnfolder]: For 518/643 co-relation queries the response was YES. [2020-10-16 01:45:31,492 INFO L80 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 186 events. 53/186 cut-off events. For 518/643 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 996 event pairs, 7 based on Foata normal form. 96/279 useless extension candidates. Maximal degree in co-relation 711. Up to 108 conditions per place. [2020-10-16 01:45:31,493 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 5 selfloop transitions, 13 changer transitions 5/49 dead transitions. [2020-10-16 01:45:31,493 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 49 transitions, 358 flow [2020-10-16 01:45:31,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:45:31,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:45:31,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 969 transitions. [2020-10-16 01:45:31,497 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8239795918367347 [2020-10-16 01:45:31,497 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 969 transitions. [2020-10-16 01:45:31,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 969 transitions. [2020-10-16 01:45:31,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:45:31,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 969 transitions. [2020-10-16 01:45:31,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:45:31,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:45:31,503 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:45:31,503 INFO L185 Difference]: Start difference. First operand has 55 places, 39 transitions, 254 flow. Second operand 7 states and 969 transitions. [2020-10-16 01:45:31,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 49 transitions, 358 flow [2020-10-16 01:45:31,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 49 transitions, 334 flow, removed 2 selfloop flow, removed 5 redundant places. [2020-10-16 01:45:31,508 INFO L241 Difference]: Finished difference. Result has 59 places, 44 transitions, 309 flow [2020-10-16 01:45:31,508 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=309, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2020-10-16 01:45:31,508 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 26 predicate places. [2020-10-16 01:45:31,508 INFO L481 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 309 flow [2020-10-16 01:45:31,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:45:31,509 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:31,509 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:45:31,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:45:31,509 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-16 01:45:31,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:31,510 INFO L82 PathProgramCache]: Analyzing trace with hash 341824608, now seen corresponding path program 1 times [2020-10-16 01:45:31,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:31,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446347722] [2020-10-16 01:45:31,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:45:31,647 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-16 01:45:31,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446347722] [2020-10-16 01:45:31,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:45:31,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:45:31,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256387891] [2020-10-16 01:45:31,648 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:45:31,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:45:31,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:45:31,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:45:31,650 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 168 [2020-10-16 01:45:31,651 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 309 flow. Second operand 6 states. [2020-10-16 01:45:31,651 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:45:31,651 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 168 [2020-10-16 01:45:31,652 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:45:31,748 INFO L129 PetriNetUnfolder]: 26/132 cut-off events. [2020-10-16 01:45:31,748 INFO L130 PetriNetUnfolder]: For 631/819 co-relation queries the response was YES. [2020-10-16 01:45:31,752 INFO L80 FinitePrefix]: Finished finitePrefix Result has 612 conditions, 132 events. 26/132 cut-off events. For 631/819 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 705 event pairs, 0 based on Foata normal form. 79/210 useless extension candidates. Maximal degree in co-relation 586. Up to 83 conditions per place. [2020-10-16 01:45:31,753 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 2 selfloop transitions, 17 changer transitions 5/48 dead transitions. [2020-10-16 01:45:31,753 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 48 transitions, 385 flow [2020-10-16 01:45:31,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 01:45:31,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 01:45:31,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1239 transitions. [2020-10-16 01:45:31,758 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8194444444444444 [2020-10-16 01:45:31,758 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1239 transitions. [2020-10-16 01:45:31,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1239 transitions. [2020-10-16 01:45:31,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:45:31,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1239 transitions. [2020-10-16 01:45:31,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 01:45:31,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 01:45:31,766 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 01:45:31,766 INFO L185 Difference]: Start difference. First operand has 59 places, 44 transitions, 309 flow. Second operand 9 states and 1239 transitions. [2020-10-16 01:45:31,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 48 transitions, 385 flow [2020-10-16 01:45:31,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 48 transitions, 333 flow, removed 21 selfloop flow, removed 5 redundant places. [2020-10-16 01:45:31,775 INFO L241 Difference]: Finished difference. Result has 65 places, 43 transitions, 298 flow [2020-10-16 01:45:31,775 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=298, PETRI_PLACES=65, PETRI_TRANSITIONS=43} [2020-10-16 01:45:31,775 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 32 predicate places. [2020-10-16 01:45:31,775 INFO L481 AbstractCegarLoop]: Abstraction has has 65 places, 43 transitions, 298 flow [2020-10-16 01:45:31,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:45:31,776 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:31,776 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] [2020-10-16 01:45:31,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 01:45:31,776 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-16 01:45:31,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:31,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1808707278, now seen corresponding path program 1 times [2020-10-16 01:45:31,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:31,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994626483] [2020-10-16 01:45:31,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:45:31,947 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-16 01:45:31,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994626483] [2020-10-16 01:45:31,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:45:31,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:45:31,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812274327] [2020-10-16 01:45:31,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:45:31,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:45:31,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:45:31,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:45:31,950 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 168 [2020-10-16 01:45:31,951 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 43 transitions, 298 flow. Second operand 7 states. [2020-10-16 01:45:31,951 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:45:31,951 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 168 [2020-10-16 01:45:31,952 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:45:32,152 INFO L129 PetriNetUnfolder]: 52/235 cut-off events. [2020-10-16 01:45:32,153 INFO L130 PetriNetUnfolder]: For 763/828 co-relation queries the response was YES. [2020-10-16 01:45:32,154 INFO L80 FinitePrefix]: Finished finitePrefix Result has 953 conditions, 235 events. 52/235 cut-off events. For 763/828 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1501 event pairs, 1 based on Foata normal form. 33/259 useless extension candidates. Maximal degree in co-relation 926. Up to 74 conditions per place. [2020-10-16 01:45:32,156 INFO L132 encePairwiseOnDemand]: 161/168 looper letters, 17 selfloop transitions, 9 changer transitions 4/57 dead transitions. [2020-10-16 01:45:32,156 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 57 transitions, 445 flow [2020-10-16 01:45:32,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:45:32,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:45:32,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 828 transitions. [2020-10-16 01:45:32,161 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7040816326530612 [2020-10-16 01:45:32,161 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 828 transitions. [2020-10-16 01:45:32,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 828 transitions. [2020-10-16 01:45:32,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:45:32,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 828 transitions. [2020-10-16 01:45:32,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:45:32,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:45:32,167 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:45:32,167 INFO L185 Difference]: Start difference. First operand has 65 places, 43 transitions, 298 flow. Second operand 7 states and 828 transitions. [2020-10-16 01:45:32,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 57 transitions, 445 flow [2020-10-16 01:45:32,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 57 transitions, 357 flow, removed 24 selfloop flow, removed 10 redundant places. [2020-10-16 01:45:32,178 INFO L241 Difference]: Finished difference. Result has 65 places, 47 transitions, 302 flow [2020-10-16 01:45:32,178 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=302, PETRI_PLACES=65, PETRI_TRANSITIONS=47} [2020-10-16 01:45:32,179 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 32 predicate places. [2020-10-16 01:45:32,179 INFO L481 AbstractCegarLoop]: Abstraction has has 65 places, 47 transitions, 302 flow [2020-10-16 01:45:32,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:45:32,179 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:32,179 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] [2020-10-16 01:45:32,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 01:45:32,179 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-16 01:45:32,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:32,180 INFO L82 PathProgramCache]: Analyzing trace with hash -156430726, now seen corresponding path program 2 times [2020-10-16 01:45:32,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:32,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354620315] [2020-10-16 01:45:32,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:45:32,275 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-16 01:45:32,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354620315] [2020-10-16 01:45:32,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:45:32,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:45:32,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111206082] [2020-10-16 01:45:32,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:45:32,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:45:32,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:45:32,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:45:32,279 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 168 [2020-10-16 01:45:32,280 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 47 transitions, 302 flow. Second operand 7 states. [2020-10-16 01:45:32,280 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:45:32,280 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 168 [2020-10-16 01:45:32,280 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:45:32,378 INFO L129 PetriNetUnfolder]: 39/217 cut-off events. [2020-10-16 01:45:32,378 INFO L130 PetriNetUnfolder]: For 449/495 co-relation queries the response was YES. [2020-10-16 01:45:32,379 INFO L80 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 217 events. 39/217 cut-off events. For 449/495 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1413 event pairs, 0 based on Foata normal form. 29/237 useless extension candidates. Maximal degree in co-relation 706. Up to 58 conditions per place. [2020-10-16 01:45:32,380 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 6 selfloop transitions, 2 changer transitions 14/51 dead transitions. [2020-10-16 01:45:32,380 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 51 transitions, 354 flow [2020-10-16 01:45:32,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:45:32,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:45:32,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 839 transitions. [2020-10-16 01:45:32,383 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7134353741496599 [2020-10-16 01:45:32,383 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 839 transitions. [2020-10-16 01:45:32,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 839 transitions. [2020-10-16 01:45:32,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:45:32,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 839 transitions. [2020-10-16 01:45:32,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:45:32,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:45:32,388 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:45:32,388 INFO L185 Difference]: Start difference. First operand has 65 places, 47 transitions, 302 flow. Second operand 7 states and 839 transitions. [2020-10-16 01:45:32,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 51 transitions, 354 flow [2020-10-16 01:45:32,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 51 transitions, 345 flow, removed 4 selfloop flow, removed 3 redundant places. [2020-10-16 01:45:32,394 INFO L241 Difference]: Finished difference. Result has 69 places, 36 transitions, 209 flow [2020-10-16 01:45:32,394 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=209, PETRI_PLACES=69, PETRI_TRANSITIONS=36} [2020-10-16 01:45:32,394 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 36 predicate places. [2020-10-16 01:45:32,394 INFO L481 AbstractCegarLoop]: Abstraction has has 69 places, 36 transitions, 209 flow [2020-10-16 01:45:32,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:45:32,394 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:45:32,395 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] [2020-10-16 01:45:32,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 01:45:32,395 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-16 01:45:32,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:45:32,395 INFO L82 PathProgramCache]: Analyzing trace with hash -533460460, now seen corresponding path program 3 times [2020-10-16 01:45:32,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:45:32,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878074421] [2020-10-16 01:45:32,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:45:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:45:32,431 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:45:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:45:32,469 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:45:32,506 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:45:32,506 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:45:32,507 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 01:45:32,527 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-16 01:45:32,527 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:32,528 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-16 01:45:32,528 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:32,529 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-16 01:45:32,529 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:32,529 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-16 01:45:32,529 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:32,529 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-16 01:45:32,529 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:32,530 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-16 01:45:32,530 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:32,530 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-16 01:45:32,530 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:32,530 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-16 01:45:32,530 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:32,531 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-16 01:45:32,531 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:32,531 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-16 01:45:32,531 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:32,531 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-16 01:45:32,531 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:32,532 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-16 01:45:32,532 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:32,533 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-16 01:45:32,533 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:32,533 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-16 01:45:32,533 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:32,534 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-16 01:45:32,534 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:32,534 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-16 01:45:32,534 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:32,534 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-16 01:45:32,534 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:32,535 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-16 01:45:32,535 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:32,535 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-16 01:45:32,535 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:32,535 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-16 01:45:32,536 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:32,536 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-16 01:45:32,536 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:32,536 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-16 01:45:32,536 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:32,537 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-16 01:45:32,537 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:32,537 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-16 01:45:32,537 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:32,537 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-16 01:45:32,537 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:32,538 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-16 01:45:32,538 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:32,538 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-16 01:45:32,538 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:32,538 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-16 01:45:32,538 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:45:32,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:45:32 BasicIcfg [2020-10-16 01:45:32,596 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:45:32,599 INFO L168 Benchmark]: Toolchain (without parser) took 12789.93 ms. Allocated memory was 252.2 MB in the beginning and 541.1 MB in the end (delta: 288.9 MB). Free memory was 208.2 MB in the beginning and 311.4 MB in the end (delta: -103.2 MB). Peak memory consumption was 185.7 MB. Max. memory is 14.2 GB. [2020-10-16 01:45:32,599 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 252.2 MB. Free memory is still 228.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:45:32,600 INFO L168 Benchmark]: CACSL2BoogieTranslator took 748.11 ms. Allocated memory was 252.2 MB in the beginning and 317.7 MB in the end (delta: 65.5 MB). Free memory was 208.2 MB in the beginning and 268.0 MB in the end (delta: -59.8 MB). Peak memory consumption was 33.0 MB. Max. memory is 14.2 GB. [2020-10-16 01:45:32,601 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.91 ms. Allocated memory is still 317.7 MB. Free memory was 268.0 MB in the beginning and 265.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:45:32,602 INFO L168 Benchmark]: Boogie Preprocessor took 36.49 ms. Allocated memory is still 317.7 MB. Free memory was 265.5 MB in the beginning and 262.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:45:32,602 INFO L168 Benchmark]: RCFGBuilder took 2039.11 ms. Allocated memory was 317.7 MB in the beginning and 359.1 MB in the end (delta: 41.4 MB). Free memory was 262.9 MB in the beginning and 206.4 MB in the end (delta: 56.6 MB). Peak memory consumption was 99.4 MB. Max. memory is 14.2 GB. [2020-10-16 01:45:32,603 INFO L168 Benchmark]: TraceAbstraction took 9897.80 ms. Allocated memory was 359.1 MB in the beginning and 541.1 MB in the end (delta: 181.9 MB). Free memory was 206.4 MB in the beginning and 311.4 MB in the end (delta: -105.0 MB). Peak memory consumption was 76.9 MB. Max. memory is 14.2 GB. [2020-10-16 01:45:32,616 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.26 ms. Allocated memory is still 252.2 MB. Free memory is still 228.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 748.11 ms. Allocated memory was 252.2 MB in the beginning and 317.7 MB in the end (delta: 65.5 MB). Free memory was 208.2 MB in the beginning and 268.0 MB in the end (delta: -59.8 MB). Peak memory consumption was 33.0 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 62.91 ms. Allocated memory is still 317.7 MB. Free memory was 268.0 MB in the beginning and 265.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 36.49 ms. Allocated memory is still 317.7 MB. Free memory was 265.5 MB in the beginning and 262.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2039.11 ms. Allocated memory was 317.7 MB in the beginning and 359.1 MB in the end (delta: 41.4 MB). Free memory was 262.9 MB in the beginning and 206.4 MB in the end (delta: 56.6 MB). Peak memory consumption was 99.4 MB. Max. memory is 14.2 GB. * TraceAbstraction took 9897.80 ms. Allocated memory was 359.1 MB in the beginning and 541.1 MB in the end (delta: 181.9 MB). Free memory was 206.4 MB in the beginning and 311.4 MB in the end (delta: -105.0 MB). Peak memory consumption was 76.9 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1043 VarBasedMoverChecksPositive, 50 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 31 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 147 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.1s, 96 PlacesBefore, 33 PlacesAfterwards, 88 TransitionsBefore, 24 TransitionsAfterwards, 1536 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 77 TotalNumberOfCompositions, 4027 MoverChecksTotal - 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; [L700] 0 int __unbuffered_p0_EAX = 0; [L701] 0 _Bool main$tmp_guard0; [L702] 0 _Bool main$tmp_guard1; [L704] 0 int x = 0; [L706] 0 int y = 0; [L707] 0 _Bool y$flush_delayed; [L708] 0 int y$mem_tmp; [L709] 0 _Bool y$r_buff0_thd0; [L710] 0 _Bool y$r_buff0_thd1; [L711] 0 _Bool y$r_buff0_thd2; [L712] 0 _Bool y$r_buff0_thd3; [L713] 0 _Bool y$r_buff1_thd0; [L714] 0 _Bool y$r_buff1_thd1; [L715] 0 _Bool y$r_buff1_thd2; [L716] 0 _Bool y$r_buff1_thd3; [L717] 0 _Bool y$read_delayed; [L718] 0 int *y$read_delayed_var; [L719] 0 int y$w_buff0; [L720] 0 _Bool y$w_buff0_used; [L721] 0 int y$w_buff1; [L722] 0 _Bool y$w_buff1_used; [L724] 0 int z = 0; [L725] 0 _Bool weak$$choice0; [L726] 0 _Bool weak$$choice2; [L804] 0 pthread_t t2516; [L805] FCALL, FORK 0 pthread_create(&t2516, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L806] 0 pthread_t t2517; [L807] FCALL, FORK 0 pthread_create(&t2517, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L808] 0 pthread_t t2518; [L809] FCALL, FORK 0 pthread_create(&t2518, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 3 y$w_buff1 = y$w_buff0 [L768] 3 y$w_buff0 = 2 [L769] 3 y$w_buff1_used = y$w_buff0_used [L770] 3 y$w_buff0_used = (_Bool)1 [L7] COND FALSE 3 !(!expression) [L772] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L773] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L774] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L775] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L776] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L779] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=1] [L730] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=2] [L735] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_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=2] [L747] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=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=2] [L750] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=1, 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=2] [L782] 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) [L782] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L782] 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) [L782] 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) [L783] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L783] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L784] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L784] 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 [L785] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L786] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L786] 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 [L753] 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) [L753] 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) [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L754] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L755] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$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 [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L756] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L757] 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 [L760] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 2 return 0; [L740] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L742] 1 return 0; [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L811] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L815] 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) [L815] 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) [L816] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L816] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L817] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L817] 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 [L818] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L818] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L819] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L819] 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 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 y$flush_delayed = weak$$choice2 [L825] 0 y$mem_tmp = y [L826] 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) [L826] 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) [L827] 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)) [L827] 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) [L827] 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)) [L827] 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)) [L828] 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)) [L828] 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) [L828] 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)) [L828] 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)) [L829] 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)) [L829] 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)) [L830] 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)) [L830] 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_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L830] 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)) [L830] 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)) [L831] 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)) [L831] 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)) [L832] 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)) [L832] 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)) [L833] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L834] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L834] 0 y = y$flush_delayed ? y$mem_tmp : y [L835] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_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=1, 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=2] - 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: 9.6s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 84 SDtfs, 81 SDslu, 80 SDs, 0 SdLazy, 435 SolverSat, 104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred in iteration=11, 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, 1.1s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 179 ConstructedInterpolants, 0 QuantifiedInterpolants, 17989 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...