/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 18:44:28,440 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 18:44:28,443 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 18:44:28,467 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 18:44:28,467 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 18:44:28,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 18:44:28,469 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 18:44:28,471 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 18:44:28,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 18:44:28,473 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 18:44:28,474 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 18:44:28,475 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 18:44:28,476 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 18:44:28,476 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 18:44:28,477 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 18:44:28,478 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 18:44:28,479 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 18:44:28,480 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 18:44:28,481 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 18:44:28,483 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 18:44:28,484 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 18:44:28,485 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 18:44:28,487 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 18:44:28,487 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 18:44:28,490 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 18:44:28,490 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 18:44:28,490 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 18:44:28,491 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 18:44:28,491 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 18:44:28,492 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 18:44:28,492 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 18:44:28,493 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 18:44:28,494 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 18:44:28,494 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 18:44:28,495 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 18:44:28,495 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 18:44:28,496 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 18:44:28,496 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 18:44:28,497 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 18:44:28,497 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 18:44:28,498 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 18:44:28,499 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-11 18:44:28,542 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 18:44:28,543 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 18:44:28,544 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 18:44:28,544 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 18:44:28,544 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 18:44:28,544 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 18:44:28,545 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 18:44:28,545 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 18:44:28,546 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 18:44:28,546 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 18:44:28,546 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 18:44:28,546 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 18:44:28,547 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 18:44:28,547 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 18:44:28,547 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 18:44:28,547 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 18:44:28,547 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 18:44:28,547 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 18:44:28,548 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 18:44:28,548 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 18:44:28,549 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 18:44:28,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:44:28,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 18:44:28,550 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 18:44:28,550 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 18:44:28,550 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 18:44:28,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 18:44:28,551 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 18:44:28,551 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 18:44:28,551 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 18:44:28,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 18:44:28,870 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 18:44:28,874 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 18:44:28,876 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 18:44:28,878 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 18:44:28,879 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i [2020-10-11 18:44:28,949 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5091dd2a/0ccdccace003453fa0221318023d68d7/FLAGca125c15f [2020-10-11 18:44:29,490 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 18:44:29,491 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i [2020-10-11 18:44:29,506 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5091dd2a/0ccdccace003453fa0221318023d68d7/FLAGca125c15f [2020-10-11 18:44:29,730 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5091dd2a/0ccdccace003453fa0221318023d68d7 [2020-10-11 18:44:29,739 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 18:44:29,741 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 18:44:29,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 18:44:29,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 18:44:29,746 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 18:44:29,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:44:29" (1/1) ... [2020-10-11 18:44:29,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d1586b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:29, skipping insertion in model container [2020-10-11 18:44:29,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:44:29" (1/1) ... [2020-10-11 18:44:29,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 18:44:29,816 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 18:44:30,431 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:44:30,453 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 18:44:30,527 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:44:30,620 INFO L208 MainTranslator]: Completed translation [2020-10-11 18:44:30,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:30 WrapperNode [2020-10-11 18:44:30,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 18:44:30,622 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 18:44:30,622 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 18:44:30,622 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 18:44:30,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:30" (1/1) ... [2020-10-11 18:44:30,650 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:30" (1/1) ... [2020-10-11 18:44:30,687 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 18:44:30,688 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 18:44:30,688 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 18:44:30,688 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 18:44:30,698 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:30" (1/1) ... [2020-10-11 18:44:30,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:30" (1/1) ... [2020-10-11 18:44:30,703 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:30" (1/1) ... [2020-10-11 18:44:30,704 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:30" (1/1) ... [2020-10-11 18:44:30,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:30" (1/1) ... [2020-10-11 18:44:30,719 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:30" (1/1) ... [2020-10-11 18:44:30,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:30" (1/1) ... [2020-10-11 18:44:30,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 18:44:30,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 18:44:30,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 18:44:30,729 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 18:44:30,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:44:30,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 18:44:30,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 18:44:30,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 18:44:30,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 18:44:30,795 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 18:44:30,795 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 18:44:30,795 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 18:44:30,796 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 18:44:30,796 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 18:44:30,796 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 18:44:30,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 18:44:30,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 18:44:30,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 18:44:30,804 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 18:44:32,660 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 18:44:32,661 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 18:44:32,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:44:32 BoogieIcfgContainer [2020-10-11 18:44:32,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 18:44:32,664 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 18:44:32,664 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 18:44:32,668 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 18:44:32,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:44:29" (1/3) ... [2020-10-11 18:44:32,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c5d1993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:44:32, skipping insertion in model container [2020-10-11 18:44:32,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:30" (2/3) ... [2020-10-11 18:44:32,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c5d1993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:44:32, skipping insertion in model container [2020-10-11 18:44:32,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:44:32" (3/3) ... [2020-10-11 18:44:32,672 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_rmo.opt.i [2020-10-11 18:44:32,684 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 18:44:32,692 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 18:44:32,693 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 18:44:32,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,721 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,721 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,723 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,723 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,726 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,726 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,727 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,727 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,727 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,728 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,734 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,734 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,739 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,740 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,740 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,746 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,747 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:32,765 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-11 18:44:32,787 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 18:44:32,788 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 18:44:32,788 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 18:44:32,788 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 18:44:32,788 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 18:44:32,788 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 18:44:32,788 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 18:44:32,788 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 18:44:32,803 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 98 places, 90 transitions, 195 flow [2020-10-11 18:44:32,849 INFO L129 PetriNetUnfolder]: 2/87 cut-off events. [2020-10-11 18:44:32,849 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:44:32,855 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-11 18:44:32,855 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 90 transitions, 195 flow [2020-10-11 18:44:32,862 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 87 transitions, 183 flow [2020-10-11 18:44:32,878 INFO L129 PetriNetUnfolder]: 0/56 cut-off events. [2020-10-11 18:44:32,878 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:44:32,879 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:32,880 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:44:32,881 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:32,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:32,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1099428094, now seen corresponding path program 1 times [2020-10-11 18:44:32,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:32,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224523341] [2020-10-11 18:44:32,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:33,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:44:33,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224523341] [2020-10-11 18:44:33,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:33,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 18:44:33,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900474739] [2020-10-11 18:44:33,252 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 18:44:33,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:33,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 18:44:33,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 18:44:33,367 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 90 [2020-10-11 18:44:33,369 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 87 transitions, 183 flow. Second operand 3 states. [2020-10-11 18:44:33,369 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:33,369 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 90 [2020-10-11 18:44:33,371 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:33,454 INFO L129 PetriNetUnfolder]: 0/84 cut-off events. [2020-10-11 18:44:33,457 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:44:33,458 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 84 events. 0/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 4/86 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-11 18:44:33,460 INFO L132 encePairwiseOnDemand]: 85/90 looper letters, 0 selfloop transitions, 2 changer transitions 11/84 dead transitions. [2020-10-11 18:44:33,460 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 84 transitions, 181 flow [2020-10-11 18:44:33,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 18:44:33,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 18:44:33,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2020-10-11 18:44:33,484 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9703703703703703 [2020-10-11 18:44:33,485 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 262 transitions. [2020-10-11 18:44:33,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 262 transitions. [2020-10-11 18:44:33,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:33,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 262 transitions. [2020-10-11 18:44:33,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 18:44:33,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 18:44:33,509 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 18:44:33,511 INFO L185 Difference]: Start difference. First operand has 95 places, 87 transitions, 183 flow. Second operand 3 states and 262 transitions. [2020-10-11 18:44:33,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 84 transitions, 181 flow [2020-10-11 18:44:33,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 84 transitions, 178 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-11 18:44:33,521 INFO L241 Difference]: Finished difference. Result has 93 places, 73 transitions, 156 flow [2020-10-11 18:44:33,524 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=93, PETRI_TRANSITIONS=73} [2020-10-11 18:44:33,525 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, -2 predicate places. [2020-10-11 18:44:33,526 INFO L481 AbstractCegarLoop]: Abstraction has has 93 places, 73 transitions, 156 flow [2020-10-11 18:44:33,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 18:44:33,526 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:33,526 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:44:33,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 18:44:33,527 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:33,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:33,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1557231127, now seen corresponding path program 1 times [2020-10-11 18:44:33,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:33,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734846938] [2020-10-11 18:44:33,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:33,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:33,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:44:33,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734846938] [2020-10-11 18:44:33,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:33,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:44:33,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499761129] [2020-10-11 18:44:33,851 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:44:33,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:33,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:44:33,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:44:34,076 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 90 [2020-10-11 18:44:34,077 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 73 transitions, 156 flow. Second operand 6 states. [2020-10-11 18:44:34,077 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:34,077 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 90 [2020-10-11 18:44:34,077 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:34,242 INFO L129 PetriNetUnfolder]: 24/154 cut-off events. [2020-10-11 18:44:34,242 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:44:34,243 INFO L80 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 154 events. 24/154 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 465 event pairs, 5 based on Foata normal form. 4/156 useless extension candidates. Maximal degree in co-relation 185. Up to 31 conditions per place. [2020-10-11 18:44:34,244 INFO L132 encePairwiseOnDemand]: 83/90 looper letters, 8 selfloop transitions, 3 changer transitions 19/94 dead transitions. [2020-10-11 18:44:34,245 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 94 transitions, 258 flow [2020-10-11 18:44:34,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:44:34,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:44:34,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 743 transitions. [2020-10-11 18:44:34,248 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.917283950617284 [2020-10-11 18:44:34,249 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 743 transitions. [2020-10-11 18:44:34,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 743 transitions. [2020-10-11 18:44:34,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:34,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 743 transitions. [2020-10-11 18:44:34,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:44:34,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:44:34,254 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:44:34,255 INFO L185 Difference]: Start difference. First operand has 93 places, 73 transitions, 156 flow. Second operand 9 states and 743 transitions. [2020-10-11 18:44:34,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 94 transitions, 258 flow [2020-10-11 18:44:34,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 94 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:44:34,259 INFO L241 Difference]: Finished difference. Result has 95 places, 75 transitions, 195 flow [2020-10-11 18:44:34,260 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=195, PETRI_PLACES=95, PETRI_TRANSITIONS=75} [2020-10-11 18:44:34,260 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 0 predicate places. [2020-10-11 18:44:34,260 INFO L481 AbstractCegarLoop]: Abstraction has has 95 places, 75 transitions, 195 flow [2020-10-11 18:44:34,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:44:34,261 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:34,261 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:44:34,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 18:44:34,261 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:34,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:34,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1881691606, now seen corresponding path program 1 times [2020-10-11 18:44:34,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:34,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526882448] [2020-10-11 18:44:34,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:34,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:44:34,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526882448] [2020-10-11 18:44:34,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:34,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:44:34,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578907697] [2020-10-11 18:44:34,437 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:44:34,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:34,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:44:34,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:44:34,636 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 90 [2020-10-11 18:44:34,637 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 75 transitions, 195 flow. Second operand 6 states. [2020-10-11 18:44:34,637 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:34,637 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 90 [2020-10-11 18:44:34,637 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:34,853 INFO L129 PetriNetUnfolder]: 74/331 cut-off events. [2020-10-11 18:44:34,853 INFO L130 PetriNetUnfolder]: For 271/274 co-relation queries the response was YES. [2020-10-11 18:44:34,861 INFO L80 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 331 events. 74/331 cut-off events. For 271/274 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1717 event pairs, 27 based on Foata normal form. 10/330 useless extension candidates. Maximal degree in co-relation 634. Up to 60 conditions per place. [2020-10-11 18:44:34,863 INFO L132 encePairwiseOnDemand]: 83/90 looper letters, 8 selfloop transitions, 3 changer transitions 19/96 dead transitions. [2020-10-11 18:44:34,863 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 96 transitions, 315 flow [2020-10-11 18:44:34,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:44:34,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:44:34,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 743 transitions. [2020-10-11 18:44:34,867 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.917283950617284 [2020-10-11 18:44:34,867 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 743 transitions. [2020-10-11 18:44:34,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 743 transitions. [2020-10-11 18:44:34,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:34,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 743 transitions. [2020-10-11 18:44:34,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:44:34,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:44:34,872 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:44:34,872 INFO L185 Difference]: Start difference. First operand has 95 places, 75 transitions, 195 flow. Second operand 9 states and 743 transitions. [2020-10-11 18:44:34,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 96 transitions, 315 flow [2020-10-11 18:44:34,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 96 transitions, 298 flow, removed 7 selfloop flow, removed 4 redundant places. [2020-10-11 18:44:34,880 INFO L241 Difference]: Finished difference. Result has 100 places, 77 transitions, 229 flow [2020-10-11 18:44:34,881 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=229, PETRI_PLACES=100, PETRI_TRANSITIONS=77} [2020-10-11 18:44:34,881 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 5 predicate places. [2020-10-11 18:44:34,881 INFO L481 AbstractCegarLoop]: Abstraction has has 100 places, 77 transitions, 229 flow [2020-10-11 18:44:34,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:44:34,882 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:34,882 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:44:34,882 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 18:44:34,882 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:34,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:34,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1513113552, now seen corresponding path program 1 times [2020-10-11 18:44:34,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:34,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145467388] [2020-10-11 18:44:34,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:35,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:44:35,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145467388] [2020-10-11 18:44:35,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:35,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:44:35,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535123349] [2020-10-11 18:44:35,059 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:44:35,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:35,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:44:35,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:44:35,203 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 90 [2020-10-11 18:44:35,203 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 77 transitions, 229 flow. Second operand 6 states. [2020-10-11 18:44:35,203 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:35,204 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 90 [2020-10-11 18:44:35,204 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:35,348 INFO L129 PetriNetUnfolder]: 34/246 cut-off events. [2020-10-11 18:44:35,348 INFO L130 PetriNetUnfolder]: For 428/476 co-relation queries the response was YES. [2020-10-11 18:44:35,350 INFO L80 FinitePrefix]: Finished finitePrefix Result has 624 conditions, 246 events. 34/246 cut-off events. For 428/476 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1174 event pairs, 15 based on Foata normal form. 8/247 useless extension candidates. Maximal degree in co-relation 572. Up to 35 conditions per place. [2020-10-11 18:44:35,351 INFO L132 encePairwiseOnDemand]: 84/90 looper letters, 12 selfloop transitions, 3 changer transitions 10/91 dead transitions. [2020-10-11 18:44:35,352 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 91 transitions, 377 flow [2020-10-11 18:44:35,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:44:35,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:44:35,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 737 transitions. [2020-10-11 18:44:35,355 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9098765432098765 [2020-10-11 18:44:35,355 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 737 transitions. [2020-10-11 18:44:35,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 737 transitions. [2020-10-11 18:44:35,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:35,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 737 transitions. [2020-10-11 18:44:35,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:44:35,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:44:35,359 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:44:35,359 INFO L185 Difference]: Start difference. First operand has 100 places, 77 transitions, 229 flow. Second operand 9 states and 737 transitions. [2020-10-11 18:44:35,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 91 transitions, 377 flow [2020-10-11 18:44:35,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 91 transitions, 346 flow, removed 14 selfloop flow, removed 4 redundant places. [2020-10-11 18:44:35,365 INFO L241 Difference]: Finished difference. Result has 105 places, 77 transitions, 241 flow [2020-10-11 18:44:35,366 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=241, PETRI_PLACES=105, PETRI_TRANSITIONS=77} [2020-10-11 18:44:35,366 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 10 predicate places. [2020-10-11 18:44:35,366 INFO L481 AbstractCegarLoop]: Abstraction has has 105 places, 77 transitions, 241 flow [2020-10-11 18:44:35,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:44:35,366 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:35,367 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:44:35,367 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 18:44:35,367 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:35,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:35,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1553584405, now seen corresponding path program 1 times [2020-10-11 18:44:35,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:35,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311779398] [2020-10-11 18:44:35,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:35,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:44:35,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311779398] [2020-10-11 18:44:35,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:35,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 18:44:35,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619252279] [2020-10-11 18:44:35,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 18:44:35,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:35,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 18:44:35,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-11 18:44:36,035 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 90 [2020-10-11 18:44:36,037 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 77 transitions, 241 flow. Second operand 9 states. [2020-10-11 18:44:36,037 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:36,037 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 90 [2020-10-11 18:44:36,038 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:36,619 INFO L129 PetriNetUnfolder]: 486/1152 cut-off events. [2020-10-11 18:44:36,620 INFO L130 PetriNetUnfolder]: For 3325/3373 co-relation queries the response was YES. [2020-10-11 18:44:36,629 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3495 conditions, 1152 events. 486/1152 cut-off events. For 3325/3373 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 7394 event pairs, 258 based on Foata normal form. 36/1141 useless extension candidates. Maximal degree in co-relation 3437. Up to 461 conditions per place. [2020-10-11 18:44:36,639 INFO L132 encePairwiseOnDemand]: 79/90 looper letters, 12 selfloop transitions, 9 changer transitions 34/118 dead transitions. [2020-10-11 18:44:36,640 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 118 transitions, 493 flow [2020-10-11 18:44:36,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:44:36,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:44:36,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1080 transitions. [2020-10-11 18:44:36,644 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2020-10-11 18:44:36,644 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1080 transitions. [2020-10-11 18:44:36,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1080 transitions. [2020-10-11 18:44:36,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:36,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1080 transitions. [2020-10-11 18:44:36,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:44:36,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:44:36,650 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:44:36,650 INFO L185 Difference]: Start difference. First operand has 105 places, 77 transitions, 241 flow. Second operand 14 states and 1080 transitions. [2020-10-11 18:44:36,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 118 transitions, 493 flow [2020-10-11 18:44:36,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 118 transitions, 448 flow, removed 21 selfloop flow, removed 7 redundant places. [2020-10-11 18:44:36,666 INFO L241 Difference]: Finished difference. Result has 116 places, 83 transitions, 308 flow [2020-10-11 18:44:36,666 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=308, PETRI_PLACES=116, PETRI_TRANSITIONS=83} [2020-10-11 18:44:36,666 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 21 predicate places. [2020-10-11 18:44:36,667 INFO L481 AbstractCegarLoop]: Abstraction has has 116 places, 83 transitions, 308 flow [2020-10-11 18:44:36,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 18:44:36,667 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:36,667 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:44:36,667 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 18:44:36,668 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:36,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:36,668 INFO L82 PathProgramCache]: Analyzing trace with hash -812493197, now seen corresponding path program 1 times [2020-10-11 18:44:36,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:36,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460525676] [2020-10-11 18:44:36,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:36,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:44:36,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460525676] [2020-10-11 18:44:36,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:36,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 18:44:36,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109896070] [2020-10-11 18:44:36,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 18:44:36,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:36,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 18:44:36,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-11 18:44:37,668 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 90 [2020-10-11 18:44:37,669 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 83 transitions, 308 flow. Second operand 9 states. [2020-10-11 18:44:37,669 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:37,669 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 90 [2020-10-11 18:44:37,669 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:38,056 INFO L129 PetriNetUnfolder]: 386/920 cut-off events. [2020-10-11 18:44:38,056 INFO L130 PetriNetUnfolder]: For 4125/4191 co-relation queries the response was YES. [2020-10-11 18:44:38,064 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3612 conditions, 920 events. 386/920 cut-off events. For 4125/4191 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5352 event pairs, 120 based on Foata normal form. 28/907 useless extension candidates. Maximal degree in co-relation 3545. Up to 386 conditions per place. [2020-10-11 18:44:38,071 INFO L132 encePairwiseOnDemand]: 82/90 looper letters, 18 selfloop transitions, 5 changer transitions 19/105 dead transitions. [2020-10-11 18:44:38,072 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 105 transitions, 538 flow [2020-10-11 18:44:38,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 18:44:38,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-11 18:44:38,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 843 transitions. [2020-10-11 18:44:38,075 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8515151515151516 [2020-10-11 18:44:38,076 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 843 transitions. [2020-10-11 18:44:38,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 843 transitions. [2020-10-11 18:44:38,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:38,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 843 transitions. [2020-10-11 18:44:38,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-11 18:44:38,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-11 18:44:38,081 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-11 18:44:38,081 INFO L185 Difference]: Start difference. First operand has 116 places, 83 transitions, 308 flow. Second operand 11 states and 843 transitions. [2020-10-11 18:44:38,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 105 transitions, 538 flow [2020-10-11 18:44:38,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 105 transitions, 514 flow, removed 11 selfloop flow, removed 4 redundant places. [2020-10-11 18:44:38,091 INFO L241 Difference]: Finished difference. Result has 120 places, 83 transitions, 324 flow [2020-10-11 18:44:38,091 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=324, PETRI_PLACES=120, PETRI_TRANSITIONS=83} [2020-10-11 18:44:38,092 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 25 predicate places. [2020-10-11 18:44:38,092 INFO L481 AbstractCegarLoop]: Abstraction has has 120 places, 83 transitions, 324 flow [2020-10-11 18:44:38,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 18:44:38,092 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:38,092 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:44:38,093 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 18:44:38,093 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:38,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:38,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1612298754, now seen corresponding path program 1 times [2020-10-11 18:44:38,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:38,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203817034] [2020-10-11 18:44:38,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:38,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:44:38,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203817034] [2020-10-11 18:44:38,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:38,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:44:38,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150644931] [2020-10-11 18:44:38,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:44:38,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:38,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:44:38,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:44:38,389 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 90 [2020-10-11 18:44:38,389 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 83 transitions, 324 flow. Second operand 6 states. [2020-10-11 18:44:38,389 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:38,390 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 90 [2020-10-11 18:44:38,390 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:38,690 INFO L129 PetriNetUnfolder]: 185/747 cut-off events. [2020-10-11 18:44:38,690 INFO L130 PetriNetUnfolder]: For 4763/4904 co-relation queries the response was YES. [2020-10-11 18:44:38,700 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3031 conditions, 747 events. 185/747 cut-off events. For 4763/4904 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5423 event pairs, 67 based on Foata normal form. 24/745 useless extension candidates. Maximal degree in co-relation 2960. Up to 151 conditions per place. [2020-10-11 18:44:38,705 INFO L132 encePairwiseOnDemand]: 84/90 looper letters, 15 selfloop transitions, 12 changer transitions 0/98 dead transitions. [2020-10-11 18:44:38,706 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 98 transitions, 537 flow [2020-10-11 18:44:38,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:44:38,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:44:38,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 737 transitions. [2020-10-11 18:44:38,709 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9098765432098765 [2020-10-11 18:44:38,710 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 737 transitions. [2020-10-11 18:44:38,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 737 transitions. [2020-10-11 18:44:38,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:38,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 737 transitions. [2020-10-11 18:44:38,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:44:38,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:44:38,715 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:44:38,715 INFO L185 Difference]: Start difference. First operand has 120 places, 83 transitions, 324 flow. Second operand 9 states and 737 transitions. [2020-10-11 18:44:38,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 98 transitions, 537 flow [2020-10-11 18:44:38,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 98 transitions, 455 flow, removed 37 selfloop flow, removed 12 redundant places. [2020-10-11 18:44:38,730 INFO L241 Difference]: Finished difference. Result has 117 places, 92 transitions, 432 flow [2020-10-11 18:44:38,731 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=432, PETRI_PLACES=117, PETRI_TRANSITIONS=92} [2020-10-11 18:44:38,731 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 22 predicate places. [2020-10-11 18:44:38,731 INFO L481 AbstractCegarLoop]: Abstraction has has 117 places, 92 transitions, 432 flow [2020-10-11 18:44:38,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:44:38,731 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:38,732 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:44:38,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 18:44:38,732 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:38,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:38,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1654289165, now seen corresponding path program 1 times [2020-10-11 18:44:38,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:38,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664283932] [2020-10-11 18:44:38,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:39,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:44:39,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664283932] [2020-10-11 18:44:39,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:39,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:44:39,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444051049] [2020-10-11 18:44:39,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:44:39,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:39,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:44:39,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:44:39,460 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 90 [2020-10-11 18:44:39,461 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 92 transitions, 432 flow. Second operand 11 states. [2020-10-11 18:44:39,462 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:39,462 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 90 [2020-10-11 18:44:39,462 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:40,212 INFO L129 PetriNetUnfolder]: 706/1873 cut-off events. [2020-10-11 18:44:40,213 INFO L130 PetriNetUnfolder]: For 9450/9616 co-relation queries the response was YES. [2020-10-11 18:44:40,236 INFO L80 FinitePrefix]: Finished finitePrefix Result has 7315 conditions, 1873 events. 706/1873 cut-off events. For 9450/9616 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 14962 event pairs, 360 based on Foata normal form. 61/1843 useless extension candidates. Maximal degree in co-relation 7244. Up to 580 conditions per place. [2020-10-11 18:44:40,246 INFO L132 encePairwiseOnDemand]: 78/90 looper letters, 13 selfloop transitions, 11 changer transitions 41/126 dead transitions. [2020-10-11 18:44:40,246 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 126 transitions, 846 flow [2020-10-11 18:44:40,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:44:40,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:44:40,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1040 transitions. [2020-10-11 18:44:40,250 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8253968253968254 [2020-10-11 18:44:40,251 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1040 transitions. [2020-10-11 18:44:40,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1040 transitions. [2020-10-11 18:44:40,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:40,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1040 transitions. [2020-10-11 18:44:40,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:44:40,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:44:40,257 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:44:40,257 INFO L185 Difference]: Start difference. First operand has 117 places, 92 transitions, 432 flow. Second operand 14 states and 1040 transitions. [2020-10-11 18:44:40,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 126 transitions, 846 flow [2020-10-11 18:44:40,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 126 transitions, 785 flow, removed 29 selfloop flow, removed 1 redundant places. [2020-10-11 18:44:40,291 INFO L241 Difference]: Finished difference. Result has 136 places, 84 transitions, 368 flow [2020-10-11 18:44:40,292 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=368, PETRI_PLACES=136, PETRI_TRANSITIONS=84} [2020-10-11 18:44:40,292 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 41 predicate places. [2020-10-11 18:44:40,292 INFO L481 AbstractCegarLoop]: Abstraction has has 136 places, 84 transitions, 368 flow [2020-10-11 18:44:40,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:44:40,293 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:40,293 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:44:40,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 18:44:40,293 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:40,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:40,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1277071525, now seen corresponding path program 1 times [2020-10-11 18:44:40,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:40,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794019083] [2020-10-11 18:44:40,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:40,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:44:40,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794019083] [2020-10-11 18:44:40,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:40,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:44:40,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238279458] [2020-10-11 18:44:40,644 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:44:40,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:40,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:44:40,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:44:40,994 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 90 [2020-10-11 18:44:40,995 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 84 transitions, 368 flow. Second operand 10 states. [2020-10-11 18:44:40,995 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:40,995 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 90 [2020-10-11 18:44:40,995 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:41,416 INFO L129 PetriNetUnfolder]: 337/975 cut-off events. [2020-10-11 18:44:41,416 INFO L130 PetriNetUnfolder]: For 9106/9182 co-relation queries the response was YES. [2020-10-11 18:44:41,425 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4561 conditions, 975 events. 337/975 cut-off events. For 9106/9182 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6491 event pairs, 156 based on Foata normal form. 31/958 useless extension candidates. Maximal degree in co-relation 4479. Up to 370 conditions per place. [2020-10-11 18:44:41,432 INFO L132 encePairwiseOnDemand]: 79/90 looper letters, 19 selfloop transitions, 11 changer transitions 10/102 dead transitions. [2020-10-11 18:44:41,433 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 102 transitions, 600 flow [2020-10-11 18:44:41,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:44:41,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:44:41,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 683 transitions. [2020-10-11 18:44:41,436 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8432098765432099 [2020-10-11 18:44:41,436 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 683 transitions. [2020-10-11 18:44:41,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 683 transitions. [2020-10-11 18:44:41,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:41,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 683 transitions. [2020-10-11 18:44:41,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:44:41,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:44:41,440 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:44:41,440 INFO L185 Difference]: Start difference. First operand has 136 places, 84 transitions, 368 flow. Second operand 9 states and 683 transitions. [2020-10-11 18:44:41,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 102 transitions, 600 flow [2020-10-11 18:44:41,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 102 transitions, 543 flow, removed 20 selfloop flow, removed 15 redundant places. [2020-10-11 18:44:41,454 INFO L241 Difference]: Finished difference. Result has 122 places, 90 transitions, 405 flow [2020-10-11 18:44:41,454 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=405, PETRI_PLACES=122, PETRI_TRANSITIONS=90} [2020-10-11 18:44:41,454 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 27 predicate places. [2020-10-11 18:44:41,454 INFO L481 AbstractCegarLoop]: Abstraction has has 122 places, 90 transitions, 405 flow [2020-10-11 18:44:41,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:44:41,455 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:41,455 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:44:41,455 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 18:44:41,455 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:41,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:41,456 INFO L82 PathProgramCache]: Analyzing trace with hash -555503079, now seen corresponding path program 2 times [2020-10-11 18:44:41,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:41,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529136287] [2020-10-11 18:44:41,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:41,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:44:41,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529136287] [2020-10-11 18:44:41,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:41,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:44:41,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197245176] [2020-10-11 18:44:41,691 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:44:41,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:41,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:44:41,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:44:42,669 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 90 [2020-10-11 18:44:42,669 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 90 transitions, 405 flow. Second operand 10 states. [2020-10-11 18:44:42,670 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:42,670 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 90 [2020-10-11 18:44:42,670 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:43,152 INFO L129 PetriNetUnfolder]: 342/1004 cut-off events. [2020-10-11 18:44:43,152 INFO L130 PetriNetUnfolder]: For 8322/8537 co-relation queries the response was YES. [2020-10-11 18:44:43,161 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4725 conditions, 1004 events. 342/1004 cut-off events. For 8322/8537 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 6847 event pairs, 150 based on Foata normal form. 41/997 useless extension candidates. Maximal degree in co-relation 4650. Up to 374 conditions per place. [2020-10-11 18:44:43,168 INFO L132 encePairwiseOnDemand]: 79/90 looper letters, 20 selfloop transitions, 12 changer transitions 19/113 dead transitions. [2020-10-11 18:44:43,168 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 113 transitions, 775 flow [2020-10-11 18:44:43,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:44:43,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:44:43,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 909 transitions. [2020-10-11 18:44:43,171 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8416666666666667 [2020-10-11 18:44:43,172 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 909 transitions. [2020-10-11 18:44:43,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 909 transitions. [2020-10-11 18:44:43,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:43,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 909 transitions. [2020-10-11 18:44:43,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:44:43,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:44:43,177 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:44:43,177 INFO L185 Difference]: Start difference. First operand has 122 places, 90 transitions, 405 flow. Second operand 12 states and 909 transitions. [2020-10-11 18:44:43,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 113 transitions, 775 flow [2020-10-11 18:44:43,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 113 transitions, 671 flow, removed 48 selfloop flow, removed 8 redundant places. [2020-10-11 18:44:43,190 INFO L241 Difference]: Finished difference. Result has 129 places, 92 transitions, 438 flow [2020-10-11 18:44:43,191 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=438, PETRI_PLACES=129, PETRI_TRANSITIONS=92} [2020-10-11 18:44:43,191 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 34 predicate places. [2020-10-11 18:44:43,191 INFO L481 AbstractCegarLoop]: Abstraction has has 129 places, 92 transitions, 438 flow [2020-10-11 18:44:43,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:44:43,192 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:43,192 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:44:43,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 18:44:43,192 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:43,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:43,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1242346283, now seen corresponding path program 3 times [2020-10-11 18:44:43,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:43,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582799510] [2020-10-11 18:44:43,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:43,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:44:43,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582799510] [2020-10-11 18:44:43,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:43,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:44:43,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314421882] [2020-10-11 18:44:43,407 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:44:43,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:43,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:44:43,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:44:44,531 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 90 [2020-10-11 18:44:44,532 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 92 transitions, 438 flow. Second operand 11 states. [2020-10-11 18:44:44,532 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:44,532 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 90 [2020-10-11 18:44:44,532 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:44,881 INFO L129 PetriNetUnfolder]: 343/984 cut-off events. [2020-10-11 18:44:44,881 INFO L130 PetriNetUnfolder]: For 10405/10554 co-relation queries the response was YES. [2020-10-11 18:44:44,892 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5340 conditions, 984 events. 343/984 cut-off events. For 10405/10554 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6537 event pairs, 147 based on Foata normal form. 41/976 useless extension candidates. Maximal degree in co-relation 5263. Up to 378 conditions per place. [2020-10-11 18:44:44,900 INFO L132 encePairwiseOnDemand]: 78/90 looper letters, 20 selfloop transitions, 15 changer transitions 10/107 dead transitions. [2020-10-11 18:44:44,900 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 107 transitions, 749 flow [2020-10-11 18:44:44,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-11 18:44:44,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-11 18:44:44,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 754 transitions. [2020-10-11 18:44:44,904 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8377777777777777 [2020-10-11 18:44:44,904 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 754 transitions. [2020-10-11 18:44:44,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 754 transitions. [2020-10-11 18:44:44,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:44,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 754 transitions. [2020-10-11 18:44:44,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-11 18:44:44,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-11 18:44:44,909 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-11 18:44:44,909 INFO L185 Difference]: Start difference. First operand has 129 places, 92 transitions, 438 flow. Second operand 10 states and 754 transitions. [2020-10-11 18:44:44,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 107 transitions, 749 flow [2020-10-11 18:44:44,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 107 transitions, 706 flow, removed 11 selfloop flow, removed 7 redundant places. [2020-10-11 18:44:44,924 INFO L241 Difference]: Finished difference. Result has 129 places, 96 transitions, 505 flow [2020-10-11 18:44:44,925 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=505, PETRI_PLACES=129, PETRI_TRANSITIONS=96} [2020-10-11 18:44:44,925 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 34 predicate places. [2020-10-11 18:44:44,925 INFO L481 AbstractCegarLoop]: Abstraction has has 129 places, 96 transitions, 505 flow [2020-10-11 18:44:44,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:44:44,925 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:44,925 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:44:44,926 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 18:44:44,926 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:44,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:44,926 INFO L82 PathProgramCache]: Analyzing trace with hash 68284829, now seen corresponding path program 4 times [2020-10-11 18:44:44,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:44,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885694431] [2020-10-11 18:44:44,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:45,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:44:45,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885694431] [2020-10-11 18:44:45,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:45,122 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:44:45,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258761390] [2020-10-11 18:44:45,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:44:45,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:45,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:44:45,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:44:46,114 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 90 [2020-10-11 18:44:46,115 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 96 transitions, 505 flow. Second operand 10 states. [2020-10-11 18:44:46,115 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:46,115 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 90 [2020-10-11 18:44:46,115 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:46,565 INFO L129 PetriNetUnfolder]: 283/954 cut-off events. [2020-10-11 18:44:46,566 INFO L130 PetriNetUnfolder]: For 10694/10750 co-relation queries the response was YES. [2020-10-11 18:44:46,572 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5034 conditions, 954 events. 283/954 cut-off events. For 10694/10750 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 6917 event pairs, 101 based on Foata normal form. 36/947 useless extension candidates. Maximal degree in co-relation 4956. Up to 273 conditions per place. [2020-10-11 18:44:46,577 INFO L132 encePairwiseOnDemand]: 80/90 looper letters, 24 selfloop transitions, 11 changer transitions 19/121 dead transitions. [2020-10-11 18:44:46,577 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 121 transitions, 1007 flow [2020-10-11 18:44:46,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:44:46,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:44:46,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 930 transitions. [2020-10-11 18:44:46,579 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8611111111111112 [2020-10-11 18:44:46,580 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 930 transitions. [2020-10-11 18:44:46,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 930 transitions. [2020-10-11 18:44:46,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:46,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 930 transitions. [2020-10-11 18:44:46,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:44:46,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:44:46,584 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:44:46,584 INFO L185 Difference]: Start difference. First operand has 129 places, 96 transitions, 505 flow. Second operand 12 states and 930 transitions. [2020-10-11 18:44:46,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 121 transitions, 1007 flow [2020-10-11 18:44:46,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 121 transitions, 950 flow, removed 27 selfloop flow, removed 5 redundant places. [2020-10-11 18:44:46,601 INFO L241 Difference]: Finished difference. Result has 139 places, 98 transitions, 559 flow [2020-10-11 18:44:46,602 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=559, PETRI_PLACES=139, PETRI_TRANSITIONS=98} [2020-10-11 18:44:46,602 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 44 predicate places. [2020-10-11 18:44:46,602 INFO L481 AbstractCegarLoop]: Abstraction has has 139 places, 98 transitions, 559 flow [2020-10-11 18:44:46,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:44:46,602 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:46,603 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:44:46,603 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 18:44:46,603 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:46,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:46,603 INFO L82 PathProgramCache]: Analyzing trace with hash -813252692, now seen corresponding path program 1 times [2020-10-11 18:44:46,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:46,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142408898] [2020-10-11 18:44:46,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:46,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:44:46,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142408898] [2020-10-11 18:44:46,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:46,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:44:46,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141285215] [2020-10-11 18:44:46,891 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:44:46,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:46,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:44:46,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:44:47,734 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 90 [2020-10-11 18:44:47,735 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 98 transitions, 559 flow. Second operand 11 states. [2020-10-11 18:44:47,735 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:47,735 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 90 [2020-10-11 18:44:47,735 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:48,029 INFO L129 PetriNetUnfolder]: 203/692 cut-off events. [2020-10-11 18:44:48,029 INFO L130 PetriNetUnfolder]: For 11907/12074 co-relation queries the response was YES. [2020-10-11 18:44:48,035 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4233 conditions, 692 events. 203/692 cut-off events. For 11907/12074 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4350 event pairs, 94 based on Foata normal form. 42/704 useless extension candidates. Maximal degree in co-relation 4149. Up to 290 conditions per place. [2020-10-11 18:44:48,042 INFO L132 encePairwiseOnDemand]: 78/90 looper letters, 23 selfloop transitions, 17 changer transitions 7/109 dead transitions. [2020-10-11 18:44:48,042 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 109 transitions, 861 flow [2020-10-11 18:44:48,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 18:44:48,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-11 18:44:48,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 826 transitions. [2020-10-11 18:44:48,048 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8343434343434344 [2020-10-11 18:44:48,048 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 826 transitions. [2020-10-11 18:44:48,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 826 transitions. [2020-10-11 18:44:48,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:48,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 826 transitions. [2020-10-11 18:44:48,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-11 18:44:48,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-11 18:44:48,058 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-11 18:44:48,058 INFO L185 Difference]: Start difference. First operand has 139 places, 98 transitions, 559 flow. Second operand 11 states and 826 transitions. [2020-10-11 18:44:48,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 109 transitions, 861 flow [2020-10-11 18:44:48,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 109 transitions, 787 flow, removed 33 selfloop flow, removed 9 redundant places. [2020-10-11 18:44:48,075 INFO L241 Difference]: Finished difference. Result has 138 places, 100 transitions, 607 flow [2020-10-11 18:44:48,076 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=607, PETRI_PLACES=138, PETRI_TRANSITIONS=100} [2020-10-11 18:44:48,076 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 43 predicate places. [2020-10-11 18:44:48,076 INFO L481 AbstractCegarLoop]: Abstraction has has 138 places, 100 transitions, 607 flow [2020-10-11 18:44:48,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:44:48,076 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:48,077 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:44:48,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 18:44:48,077 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:48,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:48,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1672441094, now seen corresponding path program 2 times [2020-10-11 18:44:48,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:48,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702414312] [2020-10-11 18:44:48,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:48,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:44:48,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702414312] [2020-10-11 18:44:48,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:48,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-11 18:44:48,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325086184] [2020-10-11 18:44:48,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 18:44:48,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:48,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 18:44:48,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-10-11 18:44:50,222 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 90 [2020-10-11 18:44:50,223 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 100 transitions, 607 flow. Second operand 13 states. [2020-10-11 18:44:50,223 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:50,223 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 90 [2020-10-11 18:44:50,223 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:50,608 INFO L129 PetriNetUnfolder]: 202/711 cut-off events. [2020-10-11 18:44:50,608 INFO L130 PetriNetUnfolder]: For 9317/9578 co-relation queries the response was YES. [2020-10-11 18:44:50,615 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4011 conditions, 711 events. 202/711 cut-off events. For 9317/9578 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4612 event pairs, 83 based on Foata normal form. 40/721 useless extension candidates. Maximal degree in co-relation 3926. Up to 289 conditions per place. [2020-10-11 18:44:50,635 INFO L132 encePairwiseOnDemand]: 78/90 looper letters, 26 selfloop transitions, 17 changer transitions 10/113 dead transitions. [2020-10-11 18:44:50,635 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 113 transitions, 925 flow [2020-10-11 18:44:50,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:44:50,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:44:50,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1017 transitions. [2020-10-11 18:44:50,641 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8071428571428572 [2020-10-11 18:44:50,641 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1017 transitions. [2020-10-11 18:44:50,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1017 transitions. [2020-10-11 18:44:50,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:50,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1017 transitions. [2020-10-11 18:44:50,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:44:50,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:44:50,648 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:44:50,648 INFO L185 Difference]: Start difference. First operand has 138 places, 100 transitions, 607 flow. Second operand 14 states and 1017 transitions. [2020-10-11 18:44:50,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 113 transitions, 925 flow [2020-10-11 18:44:50,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 113 transitions, 844 flow, removed 25 selfloop flow, removed 10 redundant places. [2020-10-11 18:44:50,673 INFO L241 Difference]: Finished difference. Result has 145 places, 101 transitions, 637 flow [2020-10-11 18:44:50,673 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=637, PETRI_PLACES=145, PETRI_TRANSITIONS=101} [2020-10-11 18:44:50,674 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 50 predicate places. [2020-10-11 18:44:50,674 INFO L481 AbstractCegarLoop]: Abstraction has has 145 places, 101 transitions, 637 flow [2020-10-11 18:44:50,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 18:44:50,674 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:50,674 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:44:50,674 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-11 18:44:50,675 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:50,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:50,675 INFO L82 PathProgramCache]: Analyzing trace with hash -410003298, now seen corresponding path program 3 times [2020-10-11 18:44:50,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:50,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560340099] [2020-10-11 18:44:50,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:50,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:50,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:44:50,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560340099] [2020-10-11 18:44:50,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:50,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:44:50,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271919215] [2020-10-11 18:44:50,976 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:44:50,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:50,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:44:50,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:44:52,503 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 90 [2020-10-11 18:44:52,504 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 101 transitions, 637 flow. Second operand 12 states. [2020-10-11 18:44:52,504 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:52,504 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 90 [2020-10-11 18:44:52,505 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:52,892 INFO L129 PetriNetUnfolder]: 206/737 cut-off events. [2020-10-11 18:44:52,892 INFO L130 PetriNetUnfolder]: For 11981/12247 co-relation queries the response was YES. [2020-10-11 18:44:52,899 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4384 conditions, 737 events. 206/737 cut-off events. For 11981/12247 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4871 event pairs, 85 based on Foata normal form. 42/750 useless extension candidates. Maximal degree in co-relation 4296. Up to 297 conditions per place. [2020-10-11 18:44:52,905 INFO L132 encePairwiseOnDemand]: 78/90 looper letters, 30 selfloop transitions, 13 changer transitions 10/114 dead transitions. [2020-10-11 18:44:52,905 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 114 transitions, 987 flow [2020-10-11 18:44:52,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:44:52,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:44:52,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 960 transitions. [2020-10-11 18:44:52,910 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8205128205128205 [2020-10-11 18:44:52,910 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 960 transitions. [2020-10-11 18:44:52,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 960 transitions. [2020-10-11 18:44:52,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:52,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 960 transitions. [2020-10-11 18:44:52,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:44:52,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:44:52,914 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:44:52,914 INFO L185 Difference]: Start difference. First operand has 145 places, 101 transitions, 637 flow. Second operand 13 states and 960 transitions. [2020-10-11 18:44:52,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 114 transitions, 987 flow [2020-10-11 18:44:52,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 114 transitions, 888 flow, removed 38 selfloop flow, removed 12 redundant places. [2020-10-11 18:44:52,939 INFO L241 Difference]: Finished difference. Result has 146 places, 102 transitions, 658 flow [2020-10-11 18:44:52,939 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=658, PETRI_PLACES=146, PETRI_TRANSITIONS=102} [2020-10-11 18:44:52,939 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 51 predicate places. [2020-10-11 18:44:52,939 INFO L481 AbstractCegarLoop]: Abstraction has has 146 places, 102 transitions, 658 flow [2020-10-11 18:44:52,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:44:52,940 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:52,940 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:44:52,940 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-11 18:44:52,940 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:52,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:52,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1037225712, now seen corresponding path program 4 times [2020-10-11 18:44:52,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:52,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900115019] [2020-10-11 18:44:52,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:53,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:44:53,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900115019] [2020-10-11 18:44:53,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:53,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-11 18:44:53,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190754712] [2020-10-11 18:44:53,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 18:44:53,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:53,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 18:44:53,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-10-11 18:44:55,418 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 90 [2020-10-11 18:44:55,419 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 102 transitions, 658 flow. Second operand 13 states. [2020-10-11 18:44:55,419 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:55,419 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 90 [2020-10-11 18:44:55,419 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:56,006 INFO L129 PetriNetUnfolder]: 208/745 cut-off events. [2020-10-11 18:44:56,006 INFO L130 PetriNetUnfolder]: For 12976/13254 co-relation queries the response was YES. [2020-10-11 18:44:56,012 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4571 conditions, 745 events. 208/745 cut-off events. For 12976/13254 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4983 event pairs, 62 based on Foata normal form. 45/760 useless extension candidates. Maximal degree in co-relation 4482. Up to 259 conditions per place. [2020-10-11 18:44:56,018 INFO L132 encePairwiseOnDemand]: 77/90 looper letters, 31 selfloop transitions, 22 changer transitions 10/123 dead transitions. [2020-10-11 18:44:56,018 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 123 transitions, 1138 flow [2020-10-11 18:44:56,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:44:56,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:44:56,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1094 transitions. [2020-10-11 18:44:56,026 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8103703703703704 [2020-10-11 18:44:56,026 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1094 transitions. [2020-10-11 18:44:56,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1094 transitions. [2020-10-11 18:44:56,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:56,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1094 transitions. [2020-10-11 18:44:56,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:44:56,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:44:56,030 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:44:56,032 INFO L185 Difference]: Start difference. First operand has 146 places, 102 transitions, 658 flow. Second operand 15 states and 1094 transitions. [2020-10-11 18:44:56,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 123 transitions, 1138 flow [2020-10-11 18:44:56,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 123 transitions, 1030 flow, removed 43 selfloop flow, removed 11 redundant places. [2020-10-11 18:44:56,059 INFO L241 Difference]: Finished difference. Result has 151 places, 106 transitions, 766 flow [2020-10-11 18:44:56,060 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=766, PETRI_PLACES=151, PETRI_TRANSITIONS=106} [2020-10-11 18:44:56,060 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 56 predicate places. [2020-10-11 18:44:56,060 INFO L481 AbstractCegarLoop]: Abstraction has has 151 places, 106 transitions, 766 flow [2020-10-11 18:44:56,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 18:44:56,060 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:56,061 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:44:56,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-11 18:44:56,061 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:56,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:56,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1562473210, now seen corresponding path program 5 times [2020-10-11 18:44:56,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:56,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759115316] [2020-10-11 18:44:56,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:56,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:44:56,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759115316] [2020-10-11 18:44:56,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:56,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:44:56,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864469754] [2020-10-11 18:44:56,312 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:44:56,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:56,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:44:56,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:44:58,001 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 90 [2020-10-11 18:44:58,002 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 106 transitions, 766 flow. Second operand 12 states. [2020-10-11 18:44:58,003 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:58,003 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 90 [2020-10-11 18:44:58,003 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:58,413 INFO L129 PetriNetUnfolder]: 160/763 cut-off events. [2020-10-11 18:44:58,413 INFO L130 PetriNetUnfolder]: For 10730/10870 co-relation queries the response was YES. [2020-10-11 18:44:58,417 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4073 conditions, 763 events. 160/763 cut-off events. For 10730/10870 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5739 event pairs, 48 based on Foata normal form. 31/765 useless extension candidates. Maximal degree in co-relation 3983. Up to 183 conditions per place. [2020-10-11 18:44:58,421 INFO L132 encePairwiseOnDemand]: 80/90 looper letters, 29 selfloop transitions, 13 changer transitions 10/120 dead transitions. [2020-10-11 18:44:58,421 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 120 transitions, 1120 flow [2020-10-11 18:44:58,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:44:58,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:44:58,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 983 transitions. [2020-10-11 18:44:58,423 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8401709401709402 [2020-10-11 18:44:58,423 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 983 transitions. [2020-10-11 18:44:58,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 983 transitions. [2020-10-11 18:44:58,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:58,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 983 transitions. [2020-10-11 18:44:58,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:44:58,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:44:58,427 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:44:58,427 INFO L185 Difference]: Start difference. First operand has 151 places, 106 transitions, 766 flow. Second operand 13 states and 983 transitions. [2020-10-11 18:44:58,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 120 transitions, 1120 flow [2020-10-11 18:44:58,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 120 transitions, 974 flow, removed 67 selfloop flow, removed 11 redundant places. [2020-10-11 18:44:58,451 INFO L241 Difference]: Finished difference. Result has 153 places, 106 transitions, 734 flow [2020-10-11 18:44:58,452 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=734, PETRI_PLACES=153, PETRI_TRANSITIONS=106} [2020-10-11 18:44:58,452 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 58 predicate places. [2020-10-11 18:44:58,452 INFO L481 AbstractCegarLoop]: Abstraction has has 153 places, 106 transitions, 734 flow [2020-10-11 18:44:58,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:44:58,452 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:58,453 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:44:58,453 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-11 18:44:58,453 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:58,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:58,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1722584142, now seen corresponding path program 1 times [2020-10-11 18:44:58,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:58,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570423729] [2020-10-11 18:44:58,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:58,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:44:58,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570423729] [2020-10-11 18:44:58,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:58,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:44:58,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796927605] [2020-10-11 18:44:58,554 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:44:58,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:58,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:44:58,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:44:58,704 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 90 [2020-10-11 18:44:58,705 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 106 transitions, 734 flow. Second operand 6 states. [2020-10-11 18:44:58,705 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:58,705 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 90 [2020-10-11 18:44:58,705 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:59,145 INFO L129 PetriNetUnfolder]: 1153/2799 cut-off events. [2020-10-11 18:44:59,145 INFO L130 PetriNetUnfolder]: For 9058/9203 co-relation queries the response was YES. [2020-10-11 18:44:59,172 INFO L80 FinitePrefix]: Finished finitePrefix Result has 8041 conditions, 2799 events. 1153/2799 cut-off events. For 9058/9203 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 25773 event pairs, 231 based on Foata normal form. 80/2566 useless extension candidates. Maximal degree in co-relation 7953. Up to 868 conditions per place. [2020-10-11 18:44:59,178 INFO L132 encePairwiseOnDemand]: 81/90 looper letters, 19 selfloop transitions, 16 changer transitions 6/131 dead transitions. [2020-10-11 18:44:59,179 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 131 transitions, 854 flow [2020-10-11 18:44:59,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:44:59,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:44:59,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 730 transitions. [2020-10-11 18:44:59,180 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9012345679012346 [2020-10-11 18:44:59,180 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 730 transitions. [2020-10-11 18:44:59,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 730 transitions. [2020-10-11 18:44:59,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:59,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 730 transitions. [2020-10-11 18:44:59,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:44:59,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:44:59,182 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:44:59,183 INFO L185 Difference]: Start difference. First operand has 153 places, 106 transitions, 734 flow. Second operand 9 states and 730 transitions. [2020-10-11 18:44:59,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 131 transitions, 854 flow [2020-10-11 18:44:59,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 131 transitions, 785 flow, removed 24 selfloop flow, removed 14 redundant places. [2020-10-11 18:44:59,209 INFO L241 Difference]: Finished difference. Result has 146 places, 114 transitions, 705 flow [2020-10-11 18:44:59,209 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=705, PETRI_PLACES=146, PETRI_TRANSITIONS=114} [2020-10-11 18:44:59,209 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 51 predicate places. [2020-10-11 18:44:59,209 INFO L481 AbstractCegarLoop]: Abstraction has has 146 places, 114 transitions, 705 flow [2020-10-11 18:44:59,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:44:59,209 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:59,210 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:44:59,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-11 18:44:59,210 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:59,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:59,210 INFO L82 PathProgramCache]: Analyzing trace with hash 77400176, now seen corresponding path program 1 times [2020-10-11 18:44:59,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:59,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628164439] [2020-10-11 18:44:59,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:59,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:44:59,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628164439] [2020-10-11 18:44:59,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:59,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:44:59,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267392409] [2020-10-11 18:44:59,326 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:44:59,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:59,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:44:59,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:44:59,446 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 90 [2020-10-11 18:44:59,447 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 114 transitions, 705 flow. Second operand 7 states. [2020-10-11 18:44:59,447 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:59,447 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 90 [2020-10-11 18:44:59,447 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:59,993 INFO L129 PetriNetUnfolder]: 960/2591 cut-off events. [2020-10-11 18:44:59,994 INFO L130 PetriNetUnfolder]: For 7814/10449 co-relation queries the response was YES. [2020-10-11 18:45:00,006 INFO L80 FinitePrefix]: Finished finitePrefix Result has 9342 conditions, 2591 events. 960/2591 cut-off events. For 7814/10449 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 25444 event pairs, 20 based on Foata normal form. 423/2757 useless extension candidates. Maximal degree in co-relation 9259. Up to 1027 conditions per place. [2020-10-11 18:45:00,011 INFO L132 encePairwiseOnDemand]: 81/90 looper letters, 15 selfloop transitions, 31 changer transitions 10/135 dead transitions. [2020-10-11 18:45:00,012 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 135 transitions, 920 flow [2020-10-11 18:45:00,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:45:00,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:45:00,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 974 transitions. [2020-10-11 18:45:00,014 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9018518518518519 [2020-10-11 18:45:00,014 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 974 transitions. [2020-10-11 18:45:00,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 974 transitions. [2020-10-11 18:45:00,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:00,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 974 transitions. [2020-10-11 18:45:00,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:45:00,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:45:00,017 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:45:00,017 INFO L185 Difference]: Start difference. First operand has 146 places, 114 transitions, 705 flow. Second operand 12 states and 974 transitions. [2020-10-11 18:45:00,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 135 transitions, 920 flow [2020-10-11 18:45:00,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 135 transitions, 867 flow, removed 7 selfloop flow, removed 11 redundant places. [2020-10-11 18:45:00,036 INFO L241 Difference]: Finished difference. Result has 149 places, 122 transitions, 779 flow [2020-10-11 18:45:00,036 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=779, PETRI_PLACES=149, PETRI_TRANSITIONS=122} [2020-10-11 18:45:00,036 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 54 predicate places. [2020-10-11 18:45:00,036 INFO L481 AbstractCegarLoop]: Abstraction has has 149 places, 122 transitions, 779 flow [2020-10-11 18:45:00,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:45:00,037 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:00,037 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:45:00,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-11 18:45:00,037 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:00,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:00,037 INFO L82 PathProgramCache]: Analyzing trace with hash 309613605, now seen corresponding path program 1 times [2020-10-11 18:45:00,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:00,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543725967] [2020-10-11 18:45:00,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:00,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:00,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543725967] [2020-10-11 18:45:00,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:00,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 18:45:00,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085058318] [2020-10-11 18:45:00,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 18:45:00,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:00,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 18:45:00,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 18:45:00,389 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 90 [2020-10-11 18:45:00,390 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 122 transitions, 779 flow. Second operand 8 states. [2020-10-11 18:45:00,390 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:00,390 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 90 [2020-10-11 18:45:00,390 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:01,065 INFO L129 PetriNetUnfolder]: 740/2301 cut-off events. [2020-10-11 18:45:01,065 INFO L130 PetriNetUnfolder]: For 9809/15789 co-relation queries the response was YES. [2020-10-11 18:45:01,079 INFO L80 FinitePrefix]: Finished finitePrefix Result has 9166 conditions, 2301 events. 740/2301 cut-off events. For 9809/15789 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 23944 event pairs, 0 based on Foata normal form. 543/2594 useless extension candidates. Maximal degree in co-relation 9084. Up to 836 conditions per place. [2020-10-11 18:45:01,082 INFO L132 encePairwiseOnDemand]: 81/90 looper letters, 10 selfloop transitions, 32 changer transitions 32/141 dead transitions. [2020-10-11 18:45:01,083 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 141 transitions, 1033 flow [2020-10-11 18:45:01,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:45:01,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:45:01,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1206 transitions. [2020-10-11 18:45:01,086 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8933333333333333 [2020-10-11 18:45:01,086 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1206 transitions. [2020-10-11 18:45:01,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1206 transitions. [2020-10-11 18:45:01,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:01,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1206 transitions. [2020-10-11 18:45:01,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:45:01,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:45:01,090 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:45:01,090 INFO L185 Difference]: Start difference. First operand has 149 places, 122 transitions, 779 flow. Second operand 15 states and 1206 transitions. [2020-10-11 18:45:01,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 141 transitions, 1033 flow [2020-10-11 18:45:01,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 141 transitions, 787 flow, removed 97 selfloop flow, removed 18 redundant places. [2020-10-11 18:45:01,181 INFO L241 Difference]: Finished difference. Result has 151 places, 106 transitions, 565 flow [2020-10-11 18:45:01,181 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=565, PETRI_PLACES=151, PETRI_TRANSITIONS=106} [2020-10-11 18:45:01,181 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 56 predicate places. [2020-10-11 18:45:01,182 INFO L481 AbstractCegarLoop]: Abstraction has has 151 places, 106 transitions, 565 flow [2020-10-11 18:45:01,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 18:45:01,182 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:01,182 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:45:01,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-11 18:45:01,182 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:01,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:01,183 INFO L82 PathProgramCache]: Analyzing trace with hash 734653388, now seen corresponding path program 1 times [2020-10-11 18:45:01,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:01,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885376224] [2020-10-11 18:45:01,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:45:01,211 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:45:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:45:01,246 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:45:01,289 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 18:45:01,289 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 18:45:01,289 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-11 18:45:01,314 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:45:01,314 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:01,315 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:45:01,315 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:01,315 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:45:01,316 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:01,316 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:45:01,316 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:01,316 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:45:01,316 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:01,316 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:45:01,317 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:01,317 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:45:01,317 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:01,317 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:45:01,317 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:01,317 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:45:01,318 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:01,318 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:45:01,318 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:01,318 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:45:01,318 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:01,319 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:45:01,320 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:01,320 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:45:01,320 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:01,320 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:45:01,320 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:01,320 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:45:01,320 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:01,321 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:45:01,321 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:01,321 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:45:01,321 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:01,321 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:45:01,321 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:01,322 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:45:01,322 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:01,322 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:45:01,322 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:01,322 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:45:01,322 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:01,323 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:45:01,323 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:01,323 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:45:01,323 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:01,323 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:45:01,323 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:01,324 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:45:01,324 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:01,324 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:45:01,324 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:01,324 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:45:01,324 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:01,324 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:45:01,325 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:01,325 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:45:01,325 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:01,325 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:45:01,325 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:01,325 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:45:01,326 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:01,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:45:01 BasicIcfg [2020-10-11 18:45:01,418 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 18:45:01,420 INFO L168 Benchmark]: Toolchain (without parser) took 31679.05 ms. Allocated memory was 252.7 MB in the beginning and 773.8 MB in the end (delta: 521.1 MB). Free memory was 207.8 MB in the beginning and 331.1 MB in the end (delta: -123.3 MB). Peak memory consumption was 397.8 MB. Max. memory is 14.2 GB. [2020-10-11 18:45:01,421 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 252.7 MB. Free memory is still 229.1 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 18:45:01,422 INFO L168 Benchmark]: CACSL2BoogieTranslator took 879.59 ms. Allocated memory was 252.7 MB in the beginning and 315.6 MB in the end (delta: 62.9 MB). Free memory was 207.8 MB in the beginning and 265.9 MB in the end (delta: -58.1 MB). Peak memory consumption was 30.6 MB. Max. memory is 14.2 GB. [2020-10-11 18:45:01,423 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.22 ms. Allocated memory is still 315.6 MB. Free memory was 265.9 MB in the beginning and 263.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:45:01,423 INFO L168 Benchmark]: Boogie Preprocessor took 40.58 ms. Allocated memory is still 315.6 MB. Free memory was 263.3 MB in the beginning and 260.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:45:01,427 INFO L168 Benchmark]: RCFGBuilder took 1934.68 ms. Allocated memory was 315.6 MB in the beginning and 358.1 MB in the end (delta: 42.5 MB). Free memory was 260.8 MB in the beginning and 211.4 MB in the end (delta: 49.4 MB). Peak memory consumption was 99.3 MB. Max. memory is 14.2 GB. [2020-10-11 18:45:01,428 INFO L168 Benchmark]: TraceAbstraction took 28753.34 ms. Allocated memory was 358.1 MB in the beginning and 773.8 MB in the end (delta: 415.8 MB). Free memory was 211.4 MB in the beginning and 331.1 MB in the end (delta: -119.6 MB). Peak memory consumption was 296.1 MB. Max. memory is 14.2 GB. [2020-10-11 18:45:01,435 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.44 ms. Allocated memory is still 252.7 MB. Free memory is still 229.1 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 879.59 ms. Allocated memory was 252.7 MB in the beginning and 315.6 MB in the end (delta: 62.9 MB). Free memory was 207.8 MB in the beginning and 265.9 MB in the end (delta: -58.1 MB). Peak memory consumption was 30.6 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 65.22 ms. Allocated memory is still 315.6 MB. Free memory was 265.9 MB in the beginning and 263.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 40.58 ms. Allocated memory is still 315.6 MB. Free memory was 263.3 MB in the beginning and 260.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1934.68 ms. Allocated memory was 315.6 MB in the beginning and 358.1 MB in the end (delta: 42.5 MB). Free memory was 260.8 MB in the beginning and 211.4 MB in the end (delta: 49.4 MB). Peak memory consumption was 99.3 MB. Max. memory is 14.2 GB. * TraceAbstraction took 28753.34 ms. Allocated memory was 358.1 MB in the beginning and 773.8 MB in the end (delta: 415.8 MB). Free memory was 211.4 MB in the beginning and 331.1 MB in the end (delta: -119.6 MB). Peak memory consumption was 296.1 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L704] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L705] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L706] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L707] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L708] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L709] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L710] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L711] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L712] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L713] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L714] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L715] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L716] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L717] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L718] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L719] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L720] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 0 int z = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L723] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L724] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=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] [L800] 0 pthread_t t2504; VAL [__unbuffered_cnt=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] [L801] FCALL, FORK 0 pthread_create(&t2504, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 0 pthread_t t2505; VAL [__unbuffered_cnt=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] [L803] FCALL, FORK 0 pthread_create(&t2505, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 0 pthread_t t2506; VAL [__unbuffered_cnt=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] [L805] FCALL, FORK 0 pthread_create(&t2506, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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] [L763] 3 y$w_buff1 = y$w_buff0 [L764] 3 y$w_buff0 = 2 [L765] 3 y$w_buff1_used = y$w_buff0_used [L766] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L768] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L769] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L770] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L771] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L772] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=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] [L775] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L728] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L731] 1 x = 1 VAL [__unbuffered_cnt=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] [L743] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L746] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L778] 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) [L778] 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) [L779] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L780] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L780] 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 [L781] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L781] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L782] 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 [L749] 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) [L749] 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) [L750] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L751] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] 2 y$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 [L752] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L752] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L753] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L753] 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 [L736] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L756] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L811] 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) [L811] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L811] 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) [L811] 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) [L812] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$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 [L814] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L815] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L815] 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 [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 y$flush_delayed = weak$$choice2 [L821] 0 y$mem_tmp = y [L822] 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) [L822] 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) [L823] 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)) [L823] 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) [L823] 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)) [L823] 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)) [L824] 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)) [L824] 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)) [L825] 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)) [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L825] 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)) [L825] 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)) [L826] 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)) [L826] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_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)) [L827] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L827] 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)) [L827] 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)) [L828] 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)) [L828] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L828] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L828] 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)) [L828] 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)) [L829] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L830] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L830] 0 y = y$flush_delayed ? y$mem_tmp : y [L831] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L7] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L7] 0 __VERIFIER_error() VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 89 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: 28.5s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 23.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 762 SDtfs, 1056 SDslu, 3435 SDs, 0 SdLazy, 3201 SolverSat, 427 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 293 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=779occurred in iteration=19, 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.8s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1237 NumberOfCodeBlocks, 1237 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1150 ConstructedInterpolants, 0 QuantifiedInterpolants, 394412 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...