/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 20:28:49,736 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 20:28:49,737 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 20:28:49,756 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 20:28:49,756 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 20:28:49,757 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 20:28:49,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 20:28:49,759 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 20:28:49,760 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 20:28:49,761 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 20:28:49,761 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 20:28:49,762 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 20:28:49,762 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 20:28:49,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 20:28:49,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 20:28:49,778 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 20:28:49,778 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 20:28:49,782 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 20:28:49,786 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 20:28:49,792 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 20:28:49,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 20:28:49,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 20:28:49,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 20:28:49,798 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 20:28:49,801 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 20:28:49,802 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 20:28:49,802 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 20:28:49,802 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 20:28:49,803 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 20:28:49,803 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 20:28:49,803 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 20:28:49,804 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 20:28:49,804 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 20:28:49,805 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 20:28:49,805 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 20:28:49,805 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 20:28:49,806 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 20:28:49,806 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 20:28:49,806 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 20:28:49,806 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 20:28:49,807 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 20:28:49,810 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2021-03-11 20:28:49,837 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 20:28:49,837 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 20:28:49,838 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 20:28:49,838 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 20:28:49,839 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 20:28:49,839 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 20:28:49,839 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 20:28:49,839 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 20:28:49,839 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 20:28:49,839 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 20:28:49,839 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 20:28:49,839 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 20:28:49,839 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 20:28:49,839 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 20:28:49,840 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 20:28:49,840 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 20:28:49,840 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 20:28:49,840 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 20:28:49,840 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 20:28:49,840 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 20:28:49,840 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 20:28:49,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:28:49,840 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 20:28:49,840 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 20:28:49,841 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 20:28:49,841 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 20:28:49,841 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 20:28:49,841 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 20:28:49,841 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-11 20:28:50,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 20:28:50,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 20:28:50,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 20:28:50,087 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 20:28:50,090 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 20:28:50,090 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i [2021-03-11 20:28:50,153 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4db5f0bf1/136ce41f379c4639b61d3482ff9f9ef5/FLAGf9b064e91 [2021-03-11 20:28:50,583 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 20:28:50,583 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i [2021-03-11 20:28:50,593 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4db5f0bf1/136ce41f379c4639b61d3482ff9f9ef5/FLAGf9b064e91 [2021-03-11 20:28:50,602 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4db5f0bf1/136ce41f379c4639b61d3482ff9f9ef5 [2021-03-11 20:28:50,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 20:28:50,607 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 20:28:50,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 20:28:50,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 20:28:50,610 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 20:28:50,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:28:50" (1/1) ... [2021-03-11 20:28:50,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@adb44ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:28:50, skipping insertion in model container [2021-03-11 20:28:50,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:28:50" (1/1) ... [2021-03-11 20:28:50,616 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 20:28:50,644 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 20:28:50,742 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i[950,963] [2021-03-11 20:28:50,923 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:28:50,929 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 20:28:50,939 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i[950,963] [2021-03-11 20:28:50,959 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:28:51,001 INFO L208 MainTranslator]: Completed translation [2021-03-11 20:28:51,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:28:51 WrapperNode [2021-03-11 20:28:51,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 20:28:51,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 20:28:51,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 20:28:51,002 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 20:28:51,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:28:51" (1/1) ... [2021-03-11 20:28:51,017 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:28:51" (1/1) ... [2021-03-11 20:28:51,033 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 20:28:51,033 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 20:28:51,033 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 20:28:51,033 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 20:28:51,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:28:51" (1/1) ... [2021-03-11 20:28:51,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:28:51" (1/1) ... [2021-03-11 20:28:51,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:28:51" (1/1) ... [2021-03-11 20:28:51,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:28:51" (1/1) ... [2021-03-11 20:28:51,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:28:51" (1/1) ... [2021-03-11 20:28:51,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:28:51" (1/1) ... [2021-03-11 20:28:51,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:28:51" (1/1) ... [2021-03-11 20:28:51,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 20:28:51,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 20:28:51,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 20:28:51,053 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 20:28:51,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:28:51" (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 [2021-03-11 20:28:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 20:28:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 20:28:51,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 20:28:51,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 20:28:51,106 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 20:28:51,106 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 20:28:51,107 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 20:28:51,107 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 20:28:51,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 20:28:51,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 20:28:51,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 20:28:51,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 20:28:51,108 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 20:28:52,304 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 20:28:52,304 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 20:28:52,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:28:52 BoogieIcfgContainer [2021-03-11 20:28:52,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 20:28:52,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 20:28:52,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 20:28:52,308 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 20:28:52,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 08:28:50" (1/3) ... [2021-03-11 20:28:52,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4acc064c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:28:52, skipping insertion in model container [2021-03-11 20:28:52,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:28:51" (2/3) ... [2021-03-11 20:28:52,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4acc064c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:28:52, skipping insertion in model container [2021-03-11 20:28:52,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:28:52" (3/3) ... [2021-03-11 20:28:52,310 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_rmo.oepc.i [2021-03-11 20:28:52,314 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 20:28:52,317 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 20:28:52,318 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 20:28:52,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,362 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,362 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,362 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,362 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,362 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,362 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,363 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,363 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,366 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,366 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,366 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,366 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,369 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,370 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,370 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,371 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,371 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,372 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,372 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:28:52,374 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 20:28:52,386 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-11 20:28:52,407 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 20:28:52,407 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 20:28:52,407 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 20:28:52,407 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 20:28:52,407 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 20:28:52,407 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 20:28:52,407 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 20:28:52,407 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 20:28:52,420 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 79 transitions, 168 flow [2021-03-11 20:28:52,446 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2021-03-11 20:28:52,446 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:28:52,455 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-11 20:28:52,455 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 79 transitions, 168 flow [2021-03-11 20:28:52,460 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 77 transitions, 160 flow [2021-03-11 20:28:52,463 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 20:28:52,468 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 77 transitions, 160 flow [2021-03-11 20:28:52,470 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 77 transitions, 160 flow [2021-03-11 20:28:52,471 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 77 transitions, 160 flow [2021-03-11 20:28:52,490 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2021-03-11 20:28:52,490 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:28:52,490 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-11 20:28:52,491 INFO L116 LiptonReduction]: Number of co-enabled transitions 926 [2021-03-11 20:28:52,938 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-11 20:28:53,340 WARN L205 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-11 20:28:53,482 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-11 20:28:55,773 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2021-03-11 20:28:55,890 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-03-11 20:28:56,117 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2021-03-11 20:28:56,218 INFO L131 LiptonReduction]: Checked pairs total: 2282 [2021-03-11 20:28:56,219 INFO L133 LiptonReduction]: Total number of compositions: 70 [2021-03-11 20:28:56,220 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3759 [2021-03-11 20:28:56,229 INFO L129 PetriNetUnfolder]: 0/4 cut-off events. [2021-03-11 20:28:56,229 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:28:56,230 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:28:56,230 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2021-03-11 20:28:56,230 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:28:56,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:28:56,235 INFO L82 PathProgramCache]: Analyzing trace with hash 911288, now seen corresponding path program 1 times [2021-03-11 20:28:56,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:28:56,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547466598] [2021-03-11 20:28:56,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:28:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:28:56,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:56,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:28:56,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:28:56,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547466598] [2021-03-11 20:28:56,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:28:56,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:28:56,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6320048] [2021-03-11 20:28:56,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:28:56,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:28:56,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:28:56,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:28:56,429 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 149 [2021-03-11 20:28:56,432 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:56,433 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:28:56,433 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 149 [2021-03-11 20:28:56,433 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:28:56,477 INFO L129 PetriNetUnfolder]: 16/58 cut-off events. [2021-03-11 20:28:56,477 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:28:56,478 INFO L84 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 58 events. 16/58 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 200 event pairs, 11 based on Foata normal form. 6/57 useless extension candidates. Maximal degree in co-relation 91. Up to 27 conditions per place. [2021-03-11 20:28:56,479 INFO L132 encePairwiseOnDemand]: 145/149 looper letters, 7 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2021-03-11 20:28:56,480 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 20 transitions, 64 flow [2021-03-11 20:28:56,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:28:56,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:28:56,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2021-03-11 20:28:56,494 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8523489932885906 [2021-03-11 20:28:56,495 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 381 transitions. [2021-03-11 20:28:56,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 381 transitions. [2021-03-11 20:28:56,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:28:56,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 381 transitions. [2021-03-11 20:28:56,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:56,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:56,507 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:56,508 INFO L185 Difference]: Start difference. First operand has 25 places, 19 transitions, 44 flow. Second operand 3 states and 381 transitions. [2021-03-11 20:28:56,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 20 transitions, 64 flow [2021-03-11 20:28:56,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 20 transitions, 62 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:28:56,511 INFO L241 Difference]: Finished difference. Result has 24 places, 17 transitions, 42 flow [2021-03-11 20:28:56,512 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=24, PETRI_TRANSITIONS=17} [2021-03-11 20:28:56,512 INFO L335 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2021-03-11 20:28:56,512 INFO L480 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 42 flow [2021-03-11 20:28:56,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:56,513 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:28:56,513 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:28:56,513 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 20:28:56,513 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:28:56,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:28:56,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1368173984, now seen corresponding path program 1 times [2021-03-11 20:28:56,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:28:56,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888895661] [2021-03-11 20:28:56,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:28:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:28:56,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:56,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-11 20:28:56,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:56,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:28:56,610 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 20:28:56,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 20:28:56,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:28:56,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888895661] [2021-03-11 20:28:56,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:28:56,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:28:56,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462034704] [2021-03-11 20:28:56,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:28:56,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:28:56,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:28:56,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:28:56,624 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 149 [2021-03-11 20:28:56,624 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 42 flow. Second operand has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:56,624 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:28:56,624 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 149 [2021-03-11 20:28:56,624 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:28:56,705 INFO L129 PetriNetUnfolder]: 75/194 cut-off events. [2021-03-11 20:28:56,705 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:28:56,706 INFO L84 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 194 events. 75/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1036 event pairs, 11 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 351. Up to 56 conditions per place. [2021-03-11 20:28:56,706 INFO L132 encePairwiseOnDemand]: 144/149 looper letters, 10 selfloop transitions, 5 changer transitions 15/38 dead transitions. [2021-03-11 20:28:56,706 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 38 transitions, 144 flow [2021-03-11 20:28:56,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:28:56,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:28:56,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 768 transitions. [2021-03-11 20:28:56,708 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7363374880153404 [2021-03-11 20:28:56,708 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 768 transitions. [2021-03-11 20:28:56,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 768 transitions. [2021-03-11 20:28:56,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:28:56,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 768 transitions. [2021-03-11 20:28:56,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.71428571428571) internal successors, (768), 7 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:56,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 149.0) internal successors, (1192), 8 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:56,713 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 149.0) internal successors, (1192), 8 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:56,713 INFO L185 Difference]: Start difference. First operand has 24 places, 17 transitions, 42 flow. Second operand 7 states and 768 transitions. [2021-03-11 20:28:56,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 38 transitions, 144 flow [2021-03-11 20:28:56,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 38 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:28:56,714 INFO L241 Difference]: Finished difference. Result has 33 places, 18 transitions, 66 flow [2021-03-11 20:28:56,714 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=66, PETRI_PLACES=33, PETRI_TRANSITIONS=18} [2021-03-11 20:28:56,715 INFO L335 CegarLoopForPetriNet]: 25 programPoint places, 8 predicate places. [2021-03-11 20:28:56,715 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 18 transitions, 66 flow [2021-03-11 20:28:56,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:56,715 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:28:56,715 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:28:56,715 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 20:28:56,716 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:28:56,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:28:56,716 INFO L82 PathProgramCache]: Analyzing trace with hash 536372742, now seen corresponding path program 1 times [2021-03-11 20:28:56,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:28:56,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734971792] [2021-03-11 20:28:56,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:28:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:28:56,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:56,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 20:28:56,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:56,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 20:28:56,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:56,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:28:56,826 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 20:28:56,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 20:28:56,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:28:56,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734971792] [2021-03-11 20:28:56,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:28:56,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:28:56,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580622400] [2021-03-11 20:28:56,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:28:56,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:28:56,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:28:56,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:28:56,842 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 149 [2021-03-11 20:28:56,843 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 18 transitions, 66 flow. Second operand has 6 states, 6 states have (on average 90.83333333333333) internal successors, (545), 6 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:56,843 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:28:56,843 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 149 [2021-03-11 20:28:56,843 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:28:56,975 INFO L129 PetriNetUnfolder]: 169/328 cut-off events. [2021-03-11 20:28:56,976 INFO L130 PetriNetUnfolder]: For 243/245 co-relation queries the response was YES. [2021-03-11 20:28:56,978 INFO L84 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 328 events. 169/328 cut-off events. For 243/245 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1432 event pairs, 140 based on Foata normal form. 16/337 useless extension candidates. Maximal degree in co-relation 767. Up to 269 conditions per place. [2021-03-11 20:28:56,979 INFO L132 encePairwiseOnDemand]: 144/149 looper letters, 15 selfloop transitions, 4 changer transitions 12/38 dead transitions. [2021-03-11 20:28:56,979 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 38 transitions, 176 flow [2021-03-11 20:28:56,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:28:56,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:28:56,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 664 transitions. [2021-03-11 20:28:56,981 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6366251198465963 [2021-03-11 20:28:56,981 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 664 transitions. [2021-03-11 20:28:56,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 664 transitions. [2021-03-11 20:28:56,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:28:56,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 664 transitions. [2021-03-11 20:28:56,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.85714285714286) internal successors, (664), 7 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:56,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 149.0) internal successors, (1192), 8 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:56,984 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 149.0) internal successors, (1192), 8 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:56,985 INFO L185 Difference]: Start difference. First operand has 33 places, 18 transitions, 66 flow. Second operand 7 states and 664 transitions. [2021-03-11 20:28:56,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 38 transitions, 176 flow [2021-03-11 20:28:56,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 38 transitions, 170 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-03-11 20:28:56,988 INFO L241 Difference]: Finished difference. Result has 37 places, 20 transitions, 91 flow [2021-03-11 20:28:56,988 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=91, PETRI_PLACES=37, PETRI_TRANSITIONS=20} [2021-03-11 20:28:56,988 INFO L335 CegarLoopForPetriNet]: 25 programPoint places, 12 predicate places. [2021-03-11 20:28:56,988 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 20 transitions, 91 flow [2021-03-11 20:28:56,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 90.83333333333333) internal successors, (545), 6 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:56,988 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:28:56,988 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:28:56,989 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 20:28:56,989 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:28:56,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:28:56,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1262021262, now seen corresponding path program 1 times [2021-03-11 20:28:56,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:28:56,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968326630] [2021-03-11 20:28:56,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:28:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:28:57,077 INFO L142 QuantifierPusher]: treesize reduction 4, result has 84.0 percent of original size [2021-03-11 20:28:57,080 INFO L147 QuantifierPusher]: treesize reduction 4, result has 81.0 percent of original size 17 [2021-03-11 20:28:57,092 INFO L142 QuantifierPusher]: treesize reduction 4, result has 84.0 percent of original size [2021-03-11 20:28:57,093 INFO L147 QuantifierPusher]: treesize reduction 4, result has 81.0 percent of original size 17 [2021-03-11 20:28:57,104 INFO L142 QuantifierPusher]: treesize reduction 4, result has 77.8 percent of original size [2021-03-11 20:28:57,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 20:28:57,114 INFO L142 QuantifierPusher]: treesize reduction 4, result has 73.3 percent of original size [2021-03-11 20:28:57,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-11 20:28:57,121 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 20:28:57,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 20:28:57,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:28:57,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968326630] [2021-03-11 20:28:57,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:28:57,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:28:57,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178675356] [2021-03-11 20:28:57,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 20:28:57,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:28:57,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 20:28:57,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-11 20:28:57,136 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 149 [2021-03-11 20:28:57,137 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 20 transitions, 91 flow. Second operand has 7 states, 7 states have (on average 90.85714285714286) internal successors, (636), 7 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:57,137 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:28:57,137 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 149 [2021-03-11 20:28:57,137 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:28:57,239 INFO L129 PetriNetUnfolder]: 157/319 cut-off events. [2021-03-11 20:28:57,240 INFO L130 PetriNetUnfolder]: For 446/448 co-relation queries the response was YES. [2021-03-11 20:28:57,241 INFO L84 FinitePrefix]: Finished finitePrefix Result has 869 conditions, 319 events. 157/319 cut-off events. For 446/448 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1415 event pairs, 68 based on Foata normal form. 26/344 useless extension candidates. Maximal degree in co-relation 851. Up to 259 conditions per place. [2021-03-11 20:28:57,244 INFO L132 encePairwiseOnDemand]: 143/149 looper letters, 14 selfloop transitions, 5 changer transitions 8/34 dead transitions. [2021-03-11 20:28:57,244 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 34 transitions, 193 flow [2021-03-11 20:28:57,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:28:57,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:28:57,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 569 transitions. [2021-03-11 20:28:57,246 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6364653243847874 [2021-03-11 20:28:57,246 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 569 transitions. [2021-03-11 20:28:57,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 569 transitions. [2021-03-11 20:28:57,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:28:57,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 569 transitions. [2021-03-11 20:28:57,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:57,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 149.0) internal successors, (1043), 7 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:57,249 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 149.0) internal successors, (1043), 7 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:57,250 INFO L185 Difference]: Start difference. First operand has 37 places, 20 transitions, 91 flow. Second operand 6 states and 569 transitions. [2021-03-11 20:28:57,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 34 transitions, 193 flow [2021-03-11 20:28:57,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 34 transitions, 186 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-11 20:28:57,255 INFO L241 Difference]: Finished difference. Result has 39 places, 22 transitions, 119 flow [2021-03-11 20:28:57,255 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=119, PETRI_PLACES=39, PETRI_TRANSITIONS=22} [2021-03-11 20:28:57,256 INFO L335 CegarLoopForPetriNet]: 25 programPoint places, 14 predicate places. [2021-03-11 20:28:57,256 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 22 transitions, 119 flow [2021-03-11 20:28:57,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 90.85714285714286) internal successors, (636), 7 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:57,256 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:28:57,256 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:28:57,256 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 20:28:57,257 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:28:57,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:28:57,258 INFO L82 PathProgramCache]: Analyzing trace with hash 83265744, now seen corresponding path program 1 times [2021-03-11 20:28:57,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:28:57,258 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526490755] [2021-03-11 20:28:57,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:28:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:28:57,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:57,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-11 20:28:57,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:57,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-11 20:28:57,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:57,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-11 20:28:57,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:57,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-11 20:28:57,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:57,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-11 20:28:57,352 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 20:28:57,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 20:28:57,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:28:57,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526490755] [2021-03-11 20:28:57,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:28:57,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:28:57,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10595316] [2021-03-11 20:28:57,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 20:28:57,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:28:57,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 20:28:57,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-11 20:28:57,375 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 149 [2021-03-11 20:28:57,375 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 22 transitions, 119 flow. Second operand has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:57,375 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:28:57,375 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 149 [2021-03-11 20:28:57,376 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:28:57,516 INFO L129 PetriNetUnfolder]: 176/351 cut-off events. [2021-03-11 20:28:57,516 INFO L130 PetriNetUnfolder]: For 667/679 co-relation queries the response was YES. [2021-03-11 20:28:57,517 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1082 conditions, 351 events. 176/351 cut-off events. For 667/679 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1579 event pairs, 50 based on Foata normal form. 22/372 useless extension candidates. Maximal degree in co-relation 1062. Up to 246 conditions per place. [2021-03-11 20:28:57,518 INFO L132 encePairwiseOnDemand]: 140/149 looper letters, 18 selfloop transitions, 14 changer transitions 5/44 dead transitions. [2021-03-11 20:28:57,518 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 44 transitions, 265 flow [2021-03-11 20:28:57,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-11 20:28:57,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-11 20:28:57,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 755 transitions. [2021-03-11 20:28:57,520 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6333892617449665 [2021-03-11 20:28:57,520 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 755 transitions. [2021-03-11 20:28:57,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 755 transitions. [2021-03-11 20:28:57,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:28:57,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 755 transitions. [2021-03-11 20:28:57,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.375) internal successors, (755), 8 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:57,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 149.0) internal successors, (1341), 9 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:57,523 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 149.0) internal successors, (1341), 9 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:57,524 INFO L185 Difference]: Start difference. First operand has 39 places, 22 transitions, 119 flow. Second operand 8 states and 755 transitions. [2021-03-11 20:28:57,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 44 transitions, 265 flow [2021-03-11 20:28:57,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 44 transitions, 250 flow, removed 4 selfloop flow, removed 3 redundant places. [2021-03-11 20:28:57,528 INFO L241 Difference]: Finished difference. Result has 45 places, 30 transitions, 191 flow [2021-03-11 20:28:57,528 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=191, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2021-03-11 20:28:57,528 INFO L335 CegarLoopForPetriNet]: 25 programPoint places, 20 predicate places. [2021-03-11 20:28:57,528 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 191 flow [2021-03-11 20:28:57,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:57,529 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:28:57,529 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:28:57,529 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 20:28:57,529 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:28:57,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:28:57,531 INFO L82 PathProgramCache]: Analyzing trace with hash 375630774, now seen corresponding path program 2 times [2021-03-11 20:28:57,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:28:57,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145015091] [2021-03-11 20:28:57,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:28:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:28:57,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:57,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-11 20:28:57,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:57,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-11 20:28:57,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:57,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-11 20:28:57,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:57,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 20:28:57,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:57,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-11 20:28:57,641 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 20:28:57,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 20:28:57,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:28:57,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145015091] [2021-03-11 20:28:57,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:28:57,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 20:28:57,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174266879] [2021-03-11 20:28:57,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 20:28:57,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:28:57,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 20:28:57,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-11 20:28:57,658 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 149 [2021-03-11 20:28:57,662 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 30 transitions, 191 flow. Second operand has 8 states, 8 states have (on average 86.875) internal successors, (695), 8 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:57,662 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:28:57,662 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 149 [2021-03-11 20:28:57,662 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:28:57,839 INFO L129 PetriNetUnfolder]: 167/333 cut-off events. [2021-03-11 20:28:57,840 INFO L130 PetriNetUnfolder]: For 969/983 co-relation queries the response was YES. [2021-03-11 20:28:57,840 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1311 conditions, 333 events. 167/333 cut-off events. For 969/983 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1487 event pairs, 84 based on Foata normal form. 28/356 useless extension candidates. Maximal degree in co-relation 1288. Up to 223 conditions per place. [2021-03-11 20:28:57,842 INFO L132 encePairwiseOnDemand]: 141/149 looper letters, 19 selfloop transitions, 16 changer transitions 8/50 dead transitions. [2021-03-11 20:28:57,842 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 50 transitions, 384 flow [2021-03-11 20:28:57,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 20:28:57,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 20:28:57,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 812 transitions. [2021-03-11 20:28:57,844 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6055182699478001 [2021-03-11 20:28:57,844 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 812 transitions. [2021-03-11 20:28:57,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 812 transitions. [2021-03-11 20:28:57,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:28:57,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 812 transitions. [2021-03-11 20:28:57,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 90.22222222222223) internal successors, (812), 9 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:57,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 149.0) internal successors, (1490), 10 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:57,847 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 149.0) internal successors, (1490), 10 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:57,848 INFO L185 Difference]: Start difference. First operand has 45 places, 30 transitions, 191 flow. Second operand 9 states and 812 transitions. [2021-03-11 20:28:57,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 50 transitions, 384 flow [2021-03-11 20:28:57,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 371 flow, removed 6 selfloop flow, removed 3 redundant places. [2021-03-11 20:28:57,851 INFO L241 Difference]: Finished difference. Result has 52 places, 34 transitions, 261 flow [2021-03-11 20:28:57,851 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=261, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2021-03-11 20:28:57,851 INFO L335 CegarLoopForPetriNet]: 25 programPoint places, 27 predicate places. [2021-03-11 20:28:57,852 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 261 flow [2021-03-11 20:28:57,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 86.875) internal successors, (695), 8 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:57,852 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:28:57,852 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:28:57,852 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 20:28:57,852 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:28:57,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:28:57,852 INFO L82 PathProgramCache]: Analyzing trace with hash 106022181, now seen corresponding path program 1 times [2021-03-11 20:28:57,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:28:57,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949202563] [2021-03-11 20:28:57,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:28:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:28:57,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:57,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:28:57,901 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 20:28:57,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:28:57,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:57,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:28:57,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:28:57,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949202563] [2021-03-11 20:28:57,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:28:57,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:28:57,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215388755] [2021-03-11 20:28:57,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:28:57,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:28:57,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:28:57,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:28:57,908 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 149 [2021-03-11 20:28:57,909 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 34 transitions, 261 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:57,909 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:28:57,909 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 149 [2021-03-11 20:28:57,909 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:28:57,936 INFO L129 PetriNetUnfolder]: 34/126 cut-off events. [2021-03-11 20:28:57,936 INFO L130 PetriNetUnfolder]: For 453/482 co-relation queries the response was YES. [2021-03-11 20:28:57,937 INFO L84 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 126 events. 34/126 cut-off events. For 453/482 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 603 event pairs, 9 based on Foata normal form. 45/169 useless extension candidates. Maximal degree in co-relation 480. Up to 49 conditions per place. [2021-03-11 20:28:57,937 INFO L132 encePairwiseOnDemand]: 144/149 looper letters, 5 selfloop transitions, 7 changer transitions 3/38 dead transitions. [2021-03-11 20:28:57,937 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 38 transitions, 283 flow [2021-03-11 20:28:57,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:28:57,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:28:57,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2021-03-11 20:28:57,939 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7906040268456376 [2021-03-11 20:28:57,939 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 589 transitions. [2021-03-11 20:28:57,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 589 transitions. [2021-03-11 20:28:57,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:28:57,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 589 transitions. [2021-03-11 20:28:57,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:57,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 149.0) internal successors, (894), 6 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:57,942 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 149.0) internal successors, (894), 6 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:57,942 INFO L185 Difference]: Start difference. First operand has 52 places, 34 transitions, 261 flow. Second operand 5 states and 589 transitions. [2021-03-11 20:28:57,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 38 transitions, 283 flow [2021-03-11 20:28:57,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 38 transitions, 248 flow, removed 5 selfloop flow, removed 8 redundant places. [2021-03-11 20:28:57,945 INFO L241 Difference]: Finished difference. Result has 49 places, 35 transitions, 245 flow [2021-03-11 20:28:57,945 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=245, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2021-03-11 20:28:57,945 INFO L335 CegarLoopForPetriNet]: 25 programPoint places, 24 predicate places. [2021-03-11 20:28:57,945 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 245 flow [2021-03-11 20:28:57,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:57,946 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:28:57,946 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:28:57,946 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 20:28:57,946 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:28:57,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:28:57,947 INFO L82 PathProgramCache]: Analyzing trace with hash 991233952, now seen corresponding path program 1 times [2021-03-11 20:28:57,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:28:57,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70115632] [2021-03-11 20:28:57,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:28:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:28:57,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:57,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:28:57,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:57,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:28:57,996 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 20:28:57,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:28:58,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:58,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:28:58,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:28:58,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70115632] [2021-03-11 20:28:58,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:28:58,007 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:28:58,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663142350] [2021-03-11 20:28:58,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:28:58,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:28:58,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:28:58,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:28:58,008 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 149 [2021-03-11 20:28:58,009 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 245 flow. Second operand has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:58,009 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:28:58,009 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 149 [2021-03-11 20:28:58,009 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:28:58,041 INFO L129 PetriNetUnfolder]: 11/71 cut-off events. [2021-03-11 20:28:58,041 INFO L130 PetriNetUnfolder]: For 383/468 co-relation queries the response was YES. [2021-03-11 20:28:58,041 INFO L84 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 71 events. 11/71 cut-off events. For 383/468 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 289 event pairs, 0 based on Foata normal form. 72/143 useless extension candidates. Maximal degree in co-relation 270. Up to 22 conditions per place. [2021-03-11 20:28:58,042 INFO L132 encePairwiseOnDemand]: 144/149 looper letters, 2 selfloop transitions, 9 changer transitions 10/36 dead transitions. [2021-03-11 20:28:58,042 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 36 transitions, 272 flow [2021-03-11 20:28:58,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:28:58,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:28:58,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 820 transitions. [2021-03-11 20:28:58,044 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7861936720997124 [2021-03-11 20:28:58,044 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 820 transitions. [2021-03-11 20:28:58,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 820 transitions. [2021-03-11 20:28:58,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:28:58,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 820 transitions. [2021-03-11 20:28:58,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.14285714285714) internal successors, (820), 7 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:58,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 149.0) internal successors, (1192), 8 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:58,047 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 149.0) internal successors, (1192), 8 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:58,048 INFO L185 Difference]: Start difference. First operand has 49 places, 35 transitions, 245 flow. Second operand 7 states and 820 transitions. [2021-03-11 20:28:58,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 36 transitions, 272 flow [2021-03-11 20:28:58,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 36 transitions, 234 flow, removed 12 selfloop flow, removed 4 redundant places. [2021-03-11 20:28:58,049 INFO L241 Difference]: Finished difference. Result has 54 places, 26 transitions, 180 flow [2021-03-11 20:28:58,049 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=180, PETRI_PLACES=54, PETRI_TRANSITIONS=26} [2021-03-11 20:28:58,049 INFO L335 CegarLoopForPetriNet]: 25 programPoint places, 29 predicate places. [2021-03-11 20:28:58,049 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 26 transitions, 180 flow [2021-03-11 20:28:58,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:58,050 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:28:58,050 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:28:58,050 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 20:28:58,050 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:28:58,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:28:58,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1187993813, now seen corresponding path program 1 times [2021-03-11 20:28:58,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:28:58,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632682641] [2021-03-11 20:28:58,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:28:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:28:58,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:58,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:28:58,166 INFO L142 QuantifierPusher]: treesize reduction 4, result has 88.9 percent of original size [2021-03-11 20:28:58,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-11 20:28:58,186 INFO L142 QuantifierPusher]: treesize reduction 26, result has 60.6 percent of original size [2021-03-11 20:28:58,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-11 20:28:58,213 INFO L142 QuantifierPusher]: treesize reduction 26, result has 62.9 percent of original size [2021-03-11 20:28:58,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-11 20:28:58,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:58,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 20:28:58,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:28:58,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 20:28:58,257 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 20:28:58,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 20:28:58,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:28:58,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632682641] [2021-03-11 20:28:58,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:28:58,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 20:28:58,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539379802] [2021-03-11 20:28:58,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 20:28:58,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:28:58,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 20:28:58,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-03-11 20:28:58,277 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 149 [2021-03-11 20:28:58,278 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 26 transitions, 180 flow. Second operand has 8 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:58,278 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:28:58,278 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 149 [2021-03-11 20:28:58,278 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:28:58,414 INFO L129 PetriNetUnfolder]: 3/51 cut-off events. [2021-03-11 20:28:58,414 INFO L130 PetriNetUnfolder]: For 222/233 co-relation queries the response was YES. [2021-03-11 20:28:58,415 INFO L84 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 51 events. 3/51 cut-off events. For 222/233 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 164 event pairs, 0 based on Foata normal form. 9/60 useless extension candidates. Maximal degree in co-relation 200. Up to 17 conditions per place. [2021-03-11 20:28:58,415 INFO L132 encePairwiseOnDemand]: 142/149 looper letters, 9 selfloop transitions, 4 changer transitions 9/32 dead transitions. [2021-03-11 20:28:58,415 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 32 transitions, 259 flow [2021-03-11 20:28:58,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:28:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:28:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 683 transitions. [2021-03-11 20:28:58,417 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6548418024928092 [2021-03-11 20:28:58,417 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 683 transitions. [2021-03-11 20:28:58,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 683 transitions. [2021-03-11 20:28:58,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:28:58,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 683 transitions. [2021-03-11 20:28:58,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.57142857142857) internal successors, (683), 7 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:58,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 149.0) internal successors, (1192), 8 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:58,421 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 149.0) internal successors, (1192), 8 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:58,421 INFO L185 Difference]: Start difference. First operand has 54 places, 26 transitions, 180 flow. Second operand 7 states and 683 transitions. [2021-03-11 20:28:58,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 32 transitions, 259 flow [2021-03-11 20:28:58,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 192 flow, removed 19 selfloop flow, removed 14 redundant places. [2021-03-11 20:28:58,423 INFO L241 Difference]: Finished difference. Result has 44 places, 20 transitions, 104 flow [2021-03-11 20:28:58,423 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=104, PETRI_PLACES=44, PETRI_TRANSITIONS=20} [2021-03-11 20:28:58,423 INFO L335 CegarLoopForPetriNet]: 25 programPoint places, 19 predicate places. [2021-03-11 20:28:58,424 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 20 transitions, 104 flow [2021-03-11 20:28:58,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:28:58,424 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:28:58,424 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:28:58,424 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 20:28:58,424 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:28:58,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:28:58,425 INFO L82 PathProgramCache]: Analyzing trace with hash -160598965, now seen corresponding path program 2 times [2021-03-11 20:28:58,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:28:58,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362797295] [2021-03-11 20:28:58,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:28:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:28:58,464 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:28:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:28:58,496 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:28:58,526 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 20:28:58,526 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 20:28:58,526 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 20:28:58,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 08:28:58 BasicIcfg [2021-03-11 20:28:58,587 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 20:28:58,588 INFO L168 Benchmark]: Toolchain (without parser) took 7983.00 ms. Allocated memory was 255.9 MB in the beginning and 576.7 MB in the end (delta: 320.9 MB). Free memory was 235.0 MB in the beginning and 451.6 MB in the end (delta: -216.6 MB). Peak memory consumption was 103.8 MB. Max. memory is 16.0 GB. [2021-03-11 20:28:58,588 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 20:28:58,591 INFO L168 Benchmark]: CACSL2BoogieTranslator took 393.20 ms. Allocated memory was 255.9 MB in the beginning and 339.7 MB in the end (delta: 83.9 MB). Free memory was 234.1 MB in the beginning and 300.3 MB in the end (delta: -66.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-11 20:28:58,592 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.88 ms. Allocated memory is still 339.7 MB. Free memory was 300.3 MB in the beginning and 297.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-11 20:28:58,594 INFO L168 Benchmark]: Boogie Preprocessor took 19.33 ms. Allocated memory is still 339.7 MB. Free memory was 297.2 MB in the beginning and 295.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:28:58,594 INFO L168 Benchmark]: RCFGBuilder took 1252.38 ms. Allocated memory is still 339.7 MB. Free memory was 295.1 MB in the beginning and 231.4 MB in the end (delta: 63.7 MB). Peak memory consumption was 65.7 MB. Max. memory is 16.0 GB. [2021-03-11 20:28:58,594 INFO L168 Benchmark]: TraceAbstraction took 6281.11 ms. Allocated memory was 339.7 MB in the beginning and 576.7 MB in the end (delta: 237.0 MB). Free memory was 231.4 MB in the beginning and 451.6 MB in the end (delta: -220.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-11 20:28:58,600 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 393.20 ms. Allocated memory was 255.9 MB in the beginning and 339.7 MB in the end (delta: 83.9 MB). Free memory was 234.1 MB in the beginning and 300.3 MB in the end (delta: -66.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 30.88 ms. Allocated memory is still 339.7 MB. Free memory was 300.3 MB in the beginning and 297.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 19.33 ms. Allocated memory is still 339.7 MB. Free memory was 297.2 MB in the beginning and 295.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1252.38 ms. Allocated memory is still 339.7 MB. Free memory was 295.1 MB in the beginning and 231.4 MB in the end (delta: 63.7 MB). Peak memory consumption was 65.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 6281.11 ms. Allocated memory was 339.7 MB in the beginning and 576.7 MB in the end (delta: 237.0 MB). Free memory was 231.4 MB in the beginning and 451.6 MB in the end (delta: -220.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3748.9ms, 82 PlacesBefore, 25 PlacesAfterwards, 77 TransitionsBefore, 19 TransitionsAfterwards, 926 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 70 TotalNumberOfCompositions, 2282 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1042, positive: 938, positive conditional: 0, positive unconditional: 938, negative: 104, negative conditional: 0, negative unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 610, positive: 581, positive conditional: 0, positive unconditional: 581, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 610, positive: 569, positive conditional: 0, positive unconditional: 569, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 41, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 462, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 437, negative conditional: 0, negative unconditional: 437, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1042, positive: 357, positive conditional: 0, positive unconditional: 357, negative: 75, negative conditional: 0, negative unconditional: 75, unknown: 610, unknown conditional: 0, unknown unconditional: 610] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L714] 0 int y = 0; [L715] 0 _Bool y$flush_delayed; [L716] 0 int y$mem_tmp; [L717] 0 _Bool y$r_buff0_thd0; [L718] 0 _Bool y$r_buff0_thd1; [L719] 0 _Bool y$r_buff0_thd2; [L720] 0 _Bool y$r_buff1_thd0; [L721] 0 _Bool y$r_buff1_thd1; [L722] 0 _Bool y$r_buff1_thd2; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2481; [L791] FCALL, FORK 0 pthread_create(&t2481, ((void *)0), P0, ((void *)0)) 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L745] 1 x = 1 VAL [__unbuffered_cnt=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L792] 0 pthread_t t2482; [L793] FCALL, FORK 0 pthread_create(&t2482, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L762] 2 x = 2 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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L765] 2 y = 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=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L768] 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) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] 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) [L768] 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) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 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 [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 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 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L799] 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) [L799] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L799] 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) [L799] 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) [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L801] 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 [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L803] 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 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] 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) [L810] 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) [L811] 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)) [L811] 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)) [L812] 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)) [L812] 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)) [L813] 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)) [L813] 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)) [L814] 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)) [L814] 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)) [L815] 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)) [L815] 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)) [L816] 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)) [L816] 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)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 78 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 6123.4ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1026.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3820.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 66 SDtfs, 90 SDslu, 110 SDs, 0 SdLazy, 357 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 346.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 436.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=261occurred in iteration=6, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 23.5ms SsaConstructionTime, 266.6ms SatisfiabilityAnalysisTime, 771.5ms InterpolantComputationTime, 109 NumberOfCodeBlocks, 109 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 84 ConstructedInterpolants, 0 QuantifiedInterpolants, 874 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...