/usr/bin/java -Xmx8000000000 -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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-0612a5f-m [2022-09-20 20:41:41,769 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-20 20:41:41,771 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-20 20:41:41,811 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-20 20:41:41,811 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-20 20:41:41,812 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-20 20:41:41,814 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-20 20:41:41,820 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-20 20:41:41,822 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-20 20:41:41,823 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-20 20:41:41,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-20 20:41:41,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-20 20:41:41,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-20 20:41:41,826 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-20 20:41:41,827 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-20 20:41:41,828 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-20 20:41:41,828 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-20 20:41:41,829 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-20 20:41:41,831 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-20 20:41:41,832 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-20 20:41:41,833 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-20 20:41:41,834 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-20 20:41:41,835 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-20 20:41:41,836 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-20 20:41:41,839 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-20 20:41:41,840 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-20 20:41:41,840 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-20 20:41:41,841 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-20 20:41:41,841 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-20 20:41:41,842 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-20 20:41:41,842 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-20 20:41:41,843 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-20 20:41:41,844 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-20 20:41:41,844 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-20 20:41:41,845 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-20 20:41:41,845 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-20 20:41:41,846 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-20 20:41:41,846 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-20 20:41:41,846 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-20 20:41:41,847 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-20 20:41:41,847 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-20 20:41:41,848 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-NoLbe.epf [2022-09-20 20:41:41,866 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-20 20:41:41,866 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-20 20:41:41,867 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-20 20:41:41,867 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-20 20:41:41,867 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-20 20:41:41,868 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-20 20:41:41,868 INFO L138 SettingsManager]: * Use SBE=true [2022-09-20 20:41:41,868 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-20 20:41:41,868 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-20 20:41:41,868 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-20 20:41:41,868 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-20 20:41:41,868 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-20 20:41:41,868 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-20 20:41:41,869 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-20 20:41:41,869 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-20 20:41:41,869 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-20 20:41:41,869 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-20 20:41:41,869 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-20 20:41:41,869 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-20 20:41:41,869 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-20 20:41:41,869 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-20 20:41:41,870 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-20 20:41:41,870 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-20 20:41:41,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 20:41:41,870 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-20 20:41:41,870 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-20 20:41:41,870 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-20 20:41:41,870 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-20 20:41:41,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-20 20:41:41,871 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-20 20:41:41,871 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-20 20:41:41,871 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 [2022-09-20 20:41:42,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-20 20:41:42,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-20 20:41:42,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-20 20:41:42,130 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-20 20:41:42,131 INFO L275 PluginConnector]: CDTParser initialized [2022-09-20 20:41:42,132 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2022-09-20 20:41:42,198 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7043f8ba/227b4cf96c614053b61593ac4bfee599/FLAG30d980df1 [2022-09-20 20:41:42,637 INFO L306 CDTParser]: Found 1 translation units. [2022-09-20 20:41:42,638 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2022-09-20 20:41:42,660 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7043f8ba/227b4cf96c614053b61593ac4bfee599/FLAG30d980df1 [2022-09-20 20:41:43,156 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7043f8ba/227b4cf96c614053b61593ac4bfee599 [2022-09-20 20:41:43,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-20 20:41:43,160 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-20 20:41:43,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-20 20:41:43,161 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-20 20:41:43,164 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-20 20:41:43,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 08:41:43" (1/1) ... [2022-09-20 20:41:43,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32283657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:43, skipping insertion in model container [2022-09-20 20:41:43,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 08:41:43" (1/1) ... [2022-09-20 20:41:43,171 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-20 20:41:43,212 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-20 20:41:43,435 WARN L230 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_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-09-20 20:41:43,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 20:41:43,657 INFO L203 MainTranslator]: Completed pre-run [2022-09-20 20:41:43,672 WARN L230 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_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-09-20 20:41:43,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 20:41:43,751 INFO L208 MainTranslator]: Completed translation [2022-09-20 20:41:43,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:43 WrapperNode [2022-09-20 20:41:43,751 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-20 20:41:43,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-20 20:41:43,753 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-20 20:41:43,754 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-20 20:41:43,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:43" (1/1) ... [2022-09-20 20:41:43,785 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:43" (1/1) ... [2022-09-20 20:41:43,816 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 258 [2022-09-20 20:41:43,816 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-20 20:41:43,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-20 20:41:43,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-20 20:41:43,817 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-20 20:41:43,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:43" (1/1) ... [2022-09-20 20:41:43,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:43" (1/1) ... [2022-09-20 20:41:43,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:43" (1/1) ... [2022-09-20 20:41:43,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:43" (1/1) ... [2022-09-20 20:41:43,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:43" (1/1) ... [2022-09-20 20:41:43,840 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:43" (1/1) ... [2022-09-20 20:41:43,843 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:43" (1/1) ... [2022-09-20 20:41:43,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-20 20:41:43,851 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-20 20:41:43,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-20 20:41:43,852 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-20 20:41:43,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:43" (1/1) ... [2022-09-20 20:41:43,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 20:41:43,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 20:41:43,886 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-09-20 20:41:43,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-09-20 20:41:43,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-20 20:41:43,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-09-20 20:41:43,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-20 20:41:43,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-20 20:41:43,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-20 20:41:43,925 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-09-20 20:41:43,925 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-09-20 20:41:43,925 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-09-20 20:41:43,925 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-09-20 20:41:43,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-20 20:41:43,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-09-20 20:41:43,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-20 20:41:43,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-20 20:41:43,927 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-20 20:41:44,025 INFO L234 CfgBuilder]: Building ICFG [2022-09-20 20:41:44,027 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-20 20:41:44,489 INFO L275 CfgBuilder]: Performing block encoding [2022-09-20 20:41:44,812 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-20 20:41:44,813 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-09-20 20:41:44,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 08:41:44 BoogieIcfgContainer [2022-09-20 20:41:44,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-20 20:41:44,820 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-20 20:41:44,820 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-20 20:41:44,823 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-20 20:41:44,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 08:41:43" (1/3) ... [2022-09-20 20:41:44,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a6ff618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 08:41:44, skipping insertion in model container [2022-09-20 20:41:44,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:43" (2/3) ... [2022-09-20 20:41:44,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a6ff618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 08:41:44, skipping insertion in model container [2022-09-20 20:41:44,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 08:41:44" (3/3) ... [2022-09-20 20:41:44,826 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i [2022-09-20 20:41:44,846 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-20 20:41:44,847 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-09-20 20:41:44,847 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-20 20:41:44,903 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-09-20 20:41:44,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 93 transitions, 196 flow [2022-09-20 20:41:44,992 INFO L130 PetriNetUnfolder]: 2/91 cut-off events. [2022-09-20 20:41:44,992 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 20:41:44,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 2/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-09-20 20:41:44,997 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 93 transitions, 196 flow [2022-09-20 20:41:45,001 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 91 transitions, 188 flow [2022-09-20 20:41:45,016 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-20 20:41:45,024 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3bd9c998, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-20 20:41:45,024 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-09-20 20:41:45,039 INFO L130 PetriNetUnfolder]: 0/41 cut-off events. [2022-09-20 20:41:45,040 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 20:41:45,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:45,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:41:45,042 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 20:41:45,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:45,046 INFO L85 PathProgramCache]: Analyzing trace with hash -761824995, now seen corresponding path program 1 times [2022-09-20 20:41:45,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:45,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112326004] [2022-09-20 20:41:45,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:45,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:45,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:45,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:45,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112326004] [2022-09-20 20:41:45,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112326004] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:45,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:45,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-20 20:41:45,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957636892] [2022-09-20 20:41:45,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:45,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-20 20:41:45,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:45,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-20 20:41:45,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-20 20:41:45,399 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 93 [2022-09-20 20:41:45,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 91 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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) [2022-09-20 20:41:45,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:45,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 93 [2022-09-20 20:41:45,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:45,539 INFO L130 PetriNetUnfolder]: 18/233 cut-off events. [2022-09-20 20:41:45,539 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-09-20 20:41:45,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 233 events. 18/233 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 803 event pairs, 12 based on Foata normal form. 8/227 useless extension candidates. Maximal degree in co-relation 239. Up to 31 conditions per place. [2022-09-20 20:41:45,545 INFO L137 encePairwiseOnDemand]: 88/93 looper letters, 10 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2022-09-20 20:41:45,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 91 transitions, 215 flow [2022-09-20 20:41:45,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-20 20:41:45,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-20 20:41:45,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2022-09-20 20:41:45,565 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.931899641577061 [2022-09-20 20:41:45,565 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 260 transitions. [2022-09-20 20:41:45,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 260 transitions. [2022-09-20 20:41:45,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:45,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 260 transitions. [2022-09-20 20:41:45,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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) [2022-09-20 20:41:45,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 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) [2022-09-20 20:41:45,580 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 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) [2022-09-20 20:41:45,581 INFO L175 Difference]: Start difference. First operand has 96 places, 91 transitions, 188 flow. Second operand 3 states and 260 transitions. [2022-09-20 20:41:45,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 91 transitions, 215 flow [2022-09-20 20:41:45,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 91 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-09-20 20:41:45,587 INFO L231 Difference]: Finished difference. Result has 94 places, 87 transitions, 182 flow [2022-09-20 20:41:45,589 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=94, PETRI_TRANSITIONS=87} [2022-09-20 20:41:45,592 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, -2 predicate places. [2022-09-20 20:41:45,592 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 87 transitions, 182 flow [2022-09-20 20:41:45,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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) [2022-09-20 20:41:45,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:45,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:41:45,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-20 20:41:45,594 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 20:41:45,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:45,594 INFO L85 PathProgramCache]: Analyzing trace with hash -29849764, now seen corresponding path program 1 times [2022-09-20 20:41:45,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:45,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820667555] [2022-09-20 20:41:45,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:45,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:45,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:45,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:45,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820667555] [2022-09-20 20:41:45,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820667555] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:45,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:45,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 20:41:45,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088535653] [2022-09-20 20:41:45,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:45,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 20:41:45,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:45,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 20:41:45,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 20:41:45,901 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 93 [2022-09-20 20:41:45,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 87 transitions, 182 flow. Second operand has 6 states, 6 states have (on average 74.66666666666667) internal successors, (448), 6 states have internal predecessors, (448), 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) [2022-09-20 20:41:45,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:45,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 93 [2022-09-20 20:41:45,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:46,271 INFO L130 PetriNetUnfolder]: 179/654 cut-off events. [2022-09-20 20:41:46,272 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-09-20 20:41:46,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1031 conditions, 654 events. 179/654 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3816 event pairs, 62 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 984. Up to 186 conditions per place. [2022-09-20 20:41:46,281 INFO L137 encePairwiseOnDemand]: 86/93 looper letters, 17 selfloop transitions, 3 changer transitions 43/125 dead transitions. [2022-09-20 20:41:46,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 125 transitions, 382 flow [2022-09-20 20:41:46,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 20:41:46,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 20:41:46,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 713 transitions. [2022-09-20 20:41:46,289 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8518518518518519 [2022-09-20 20:41:46,289 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 713 transitions. [2022-09-20 20:41:46,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 713 transitions. [2022-09-20 20:41:46,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:46,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 713 transitions. [2022-09-20 20:41:46,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 79.22222222222223) internal successors, (713), 9 states have internal predecessors, (713), 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) [2022-09-20 20:41:46,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 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) [2022-09-20 20:41:46,298 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 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) [2022-09-20 20:41:46,298 INFO L175 Difference]: Start difference. First operand has 94 places, 87 transitions, 182 flow. Second operand 9 states and 713 transitions. [2022-09-20 20:41:46,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 125 transitions, 382 flow [2022-09-20 20:41:46,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 125 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-09-20 20:41:46,303 INFO L231 Difference]: Finished difference. Result has 107 places, 79 transitions, 201 flow [2022-09-20 20:41:46,303 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=201, PETRI_PLACES=107, PETRI_TRANSITIONS=79} [2022-09-20 20:41:46,304 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 11 predicate places. [2022-09-20 20:41:46,304 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 79 transitions, 201 flow [2022-09-20 20:41:46,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.66666666666667) internal successors, (448), 6 states have internal predecessors, (448), 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) [2022-09-20 20:41:46,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:46,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:41:46,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-20 20:41:46,305 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 20:41:46,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:46,306 INFO L85 PathProgramCache]: Analyzing trace with hash 600139611, now seen corresponding path program 1 times [2022-09-20 20:41:46,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:46,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232930585] [2022-09-20 20:41:46,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:46,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:46,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:46,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:46,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232930585] [2022-09-20 20:41:46,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232930585] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:46,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:46,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-09-20 20:41:46,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060489995] [2022-09-20 20:41:46,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:46,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-09-20 20:41:46,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:46,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-09-20 20:41:46,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-09-20 20:41:46,653 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 93 [2022-09-20 20:41:46,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 79 transitions, 201 flow. Second operand has 11 states, 11 states have (on average 71.27272727272727) internal successors, (784), 11 states have internal predecessors, (784), 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) [2022-09-20 20:41:46,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:46,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 93 [2022-09-20 20:41:46,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:47,026 INFO L130 PetriNetUnfolder]: 160/440 cut-off events. [2022-09-20 20:41:47,027 INFO L131 PetriNetUnfolder]: For 343/345 co-relation queries the response was YES. [2022-09-20 20:41:47,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 440 events. 160/440 cut-off events. For 343/345 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1906 event pairs, 45 based on Foata normal form. 12/437 useless extension candidates. Maximal degree in co-relation 956. Up to 170 conditions per place. [2022-09-20 20:41:47,030 INFO L137 encePairwiseOnDemand]: 80/93 looper letters, 16 selfloop transitions, 11 changer transitions 34/122 dead transitions. [2022-09-20 20:41:47,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 122 transitions, 441 flow [2022-09-20 20:41:47,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-09-20 20:41:47,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-09-20 20:41:47,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1184 transitions. [2022-09-20 20:41:47,034 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7956989247311828 [2022-09-20 20:41:47,034 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1184 transitions. [2022-09-20 20:41:47,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1184 transitions. [2022-09-20 20:41:47,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:47,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1184 transitions. [2022-09-20 20:41:47,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 74.0) internal successors, (1184), 16 states have internal predecessors, (1184), 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) [2022-09-20 20:41:47,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 93.0) internal successors, (1581), 17 states have internal predecessors, (1581), 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) [2022-09-20 20:41:47,043 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 93.0) internal successors, (1581), 17 states have internal predecessors, (1581), 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) [2022-09-20 20:41:47,044 INFO L175 Difference]: Start difference. First operand has 107 places, 79 transitions, 201 flow. Second operand 16 states and 1184 transitions. [2022-09-20 20:41:47,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 122 transitions, 441 flow [2022-09-20 20:41:47,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 122 transitions, 420 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-09-20 20:41:47,052 INFO L231 Difference]: Finished difference. Result has 113 places, 85 transitions, 280 flow [2022-09-20 20:41:47,053 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=280, PETRI_PLACES=113, PETRI_TRANSITIONS=85} [2022-09-20 20:41:47,054 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 17 predicate places. [2022-09-20 20:41:47,055 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 85 transitions, 280 flow [2022-09-20 20:41:47,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 71.27272727272727) internal successors, (784), 11 states have internal predecessors, (784), 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) [2022-09-20 20:41:47,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:47,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:41:47,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-20 20:41:47,056 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 20:41:47,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:47,057 INFO L85 PathProgramCache]: Analyzing trace with hash -871931512, now seen corresponding path program 1 times [2022-09-20 20:41:47,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:47,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044056549] [2022-09-20 20:41:47,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:47,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:47,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:47,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:47,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044056549] [2022-09-20 20:41:47,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044056549] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:47,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:47,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 20:41:47,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715713876] [2022-09-20 20:41:47,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:47,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 20:41:47,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:47,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 20:41:47,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 20:41:47,234 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 93 [2022-09-20 20:41:47,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 85 transitions, 280 flow. Second operand has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 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) [2022-09-20 20:41:47,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:47,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 93 [2022-09-20 20:41:47,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:47,506 INFO L130 PetriNetUnfolder]: 181/562 cut-off events. [2022-09-20 20:41:47,506 INFO L131 PetriNetUnfolder]: For 1536/1593 co-relation queries the response was YES. [2022-09-20 20:41:47,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1851 conditions, 562 events. 181/562 cut-off events. For 1536/1593 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2984 event pairs, 35 based on Foata normal form. 12/557 useless extension candidates. Maximal degree in co-relation 1783. Up to 158 conditions per place. [2022-09-20 20:41:47,511 INFO L137 encePairwiseOnDemand]: 87/93 looper letters, 28 selfloop transitions, 3 changer transitions 23/118 dead transitions. [2022-09-20 20:41:47,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 118 transitions, 611 flow [2022-09-20 20:41:47,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 20:41:47,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 20:41:47,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 705 transitions. [2022-09-20 20:41:47,513 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8422939068100358 [2022-09-20 20:41:47,514 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 705 transitions. [2022-09-20 20:41:47,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 705 transitions. [2022-09-20 20:41:47,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:47,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 705 transitions. [2022-09-20 20:41:47,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 78.33333333333333) internal successors, (705), 9 states have internal predecessors, (705), 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) [2022-09-20 20:41:47,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 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) [2022-09-20 20:41:47,518 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 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) [2022-09-20 20:41:47,518 INFO L175 Difference]: Start difference. First operand has 113 places, 85 transitions, 280 flow. Second operand 9 states and 705 transitions. [2022-09-20 20:41:47,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 118 transitions, 611 flow [2022-09-20 20:41:47,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 118 transitions, 577 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-09-20 20:41:47,525 INFO L231 Difference]: Finished difference. Result has 113 places, 85 transitions, 291 flow [2022-09-20 20:41:47,526 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=291, PETRI_PLACES=113, PETRI_TRANSITIONS=85} [2022-09-20 20:41:47,531 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 17 predicate places. [2022-09-20 20:41:47,531 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 85 transitions, 291 flow [2022-09-20 20:41:47,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 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) [2022-09-20 20:41:47,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:47,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:41:47,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-20 20:41:47,537 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 20:41:47,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:47,537 INFO L85 PathProgramCache]: Analyzing trace with hash 938958484, now seen corresponding path program 1 times [2022-09-20 20:41:47,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:47,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287167454] [2022-09-20 20:41:47,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:47,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:47,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:47,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:47,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287167454] [2022-09-20 20:41:47,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287167454] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:47,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:47,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 20:41:47,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626025301] [2022-09-20 20:41:47,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:47,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 20:41:47,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:47,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 20:41:47,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-09-20 20:41:47,721 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 93 [2022-09-20 20:41:47,722 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 85 transitions, 291 flow. Second operand has 8 states, 8 states have (on average 73.625) internal successors, (589), 8 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) [2022-09-20 20:41:47,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:47,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 93 [2022-09-20 20:41:47,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:48,055 INFO L130 PetriNetUnfolder]: 146/459 cut-off events. [2022-09-20 20:41:48,055 INFO L131 PetriNetUnfolder]: For 1784/1841 co-relation queries the response was YES. [2022-09-20 20:41:48,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1589 conditions, 459 events. 146/459 cut-off events. For 1784/1841 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2202 event pairs, 60 based on Foata normal form. 8/443 useless extension candidates. Maximal degree in co-relation 1517. Up to 199 conditions per place. [2022-09-20 20:41:48,060 INFO L137 encePairwiseOnDemand]: 84/93 looper letters, 25 selfloop transitions, 7 changer transitions 25/120 dead transitions. [2022-09-20 20:41:48,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 120 transitions, 667 flow [2022-09-20 20:41:48,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-20 20:41:48,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-09-20 20:41:48,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1063 transitions. [2022-09-20 20:41:48,063 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8164362519201229 [2022-09-20 20:41:48,063 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1063 transitions. [2022-09-20 20:41:48,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1063 transitions. [2022-09-20 20:41:48,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:48,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1063 transitions. [2022-09-20 20:41:48,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 75.92857142857143) internal successors, (1063), 14 states have internal predecessors, (1063), 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) [2022-09-20 20:41:48,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 93.0) internal successors, (1395), 15 states have internal predecessors, (1395), 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) [2022-09-20 20:41:48,069 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 93.0) internal successors, (1395), 15 states have internal predecessors, (1395), 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) [2022-09-20 20:41:48,069 INFO L175 Difference]: Start difference. First operand has 113 places, 85 transitions, 291 flow. Second operand 14 states and 1063 transitions. [2022-09-20 20:41:48,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 120 transitions, 667 flow [2022-09-20 20:41:48,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 120 transitions, 610 flow, removed 27 selfloop flow, removed 7 redundant places. [2022-09-20 20:41:48,077 INFO L231 Difference]: Finished difference. Result has 123 places, 87 transitions, 327 flow [2022-09-20 20:41:48,077 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=327, PETRI_PLACES=123, PETRI_TRANSITIONS=87} [2022-09-20 20:41:48,078 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 27 predicate places. [2022-09-20 20:41:48,078 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 87 transitions, 327 flow [2022-09-20 20:41:48,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 73.625) internal successors, (589), 8 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) [2022-09-20 20:41:48,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:48,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:41:48,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-20 20:41:48,079 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 20:41:48,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:48,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1370138173, now seen corresponding path program 1 times [2022-09-20 20:41:48,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:48,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735901508] [2022-09-20 20:41:48,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:48,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:48,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:48,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:48,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735901508] [2022-09-20 20:41:48,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735901508] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:48,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:48,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-09-20 20:41:48,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484469648] [2022-09-20 20:41:48,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:48,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-20 20:41:48,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:48,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-20 20:41:48,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-09-20 20:41:48,319 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 93 [2022-09-20 20:41:48,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 87 transitions, 327 flow. Second operand has 9 states, 9 states have (on average 71.66666666666667) internal successors, (645), 9 states have internal predecessors, (645), 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) [2022-09-20 20:41:48,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:48,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 93 [2022-09-20 20:41:48,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:48,754 INFO L130 PetriNetUnfolder]: 171/508 cut-off events. [2022-09-20 20:41:48,755 INFO L131 PetriNetUnfolder]: For 2904/2989 co-relation queries the response was YES. [2022-09-20 20:41:48,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2142 conditions, 508 events. 171/508 cut-off events. For 2904/2989 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2598 event pairs, 47 based on Foata normal form. 23/503 useless extension candidates. Maximal degree in co-relation 2062. Up to 207 conditions per place. [2022-09-20 20:41:48,760 INFO L137 encePairwiseOnDemand]: 81/93 looper letters, 26 selfloop transitions, 12 changer transitions 32/131 dead transitions. [2022-09-20 20:41:48,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 131 transitions, 831 flow [2022-09-20 20:41:48,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-09-20 20:41:48,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-09-20 20:41:48,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1184 transitions. [2022-09-20 20:41:48,764 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7956989247311828 [2022-09-20 20:41:48,764 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1184 transitions. [2022-09-20 20:41:48,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1184 transitions. [2022-09-20 20:41:48,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:48,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1184 transitions. [2022-09-20 20:41:48,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 74.0) internal successors, (1184), 16 states have internal predecessors, (1184), 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) [2022-09-20 20:41:48,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 93.0) internal successors, (1581), 17 states have internal predecessors, (1581), 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) [2022-09-20 20:41:48,772 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 93.0) internal successors, (1581), 17 states have internal predecessors, (1581), 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) [2022-09-20 20:41:48,772 INFO L175 Difference]: Start difference. First operand has 123 places, 87 transitions, 327 flow. Second operand 16 states and 1184 transitions. [2022-09-20 20:41:48,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 131 transitions, 831 flow [2022-09-20 20:41:48,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 131 transitions, 780 flow, removed 22 selfloop flow, removed 8 redundant places. [2022-09-20 20:41:48,780 INFO L231 Difference]: Finished difference. Result has 133 places, 96 transitions, 451 flow [2022-09-20 20:41:48,781 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=451, PETRI_PLACES=133, PETRI_TRANSITIONS=96} [2022-09-20 20:41:48,782 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 37 predicate places. [2022-09-20 20:41:48,782 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 96 transitions, 451 flow [2022-09-20 20:41:48,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 71.66666666666667) internal successors, (645), 9 states have internal predecessors, (645), 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) [2022-09-20 20:41:48,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:48,782 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:41:48,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-20 20:41:48,783 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 20:41:48,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:48,783 INFO L85 PathProgramCache]: Analyzing trace with hash -999123527, now seen corresponding path program 2 times [2022-09-20 20:41:48,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:48,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330061818] [2022-09-20 20:41:48,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:48,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:48,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:48,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:48,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330061818] [2022-09-20 20:41:48,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330061818] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:48,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:48,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-09-20 20:41:48,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271670750] [2022-09-20 20:41:48,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:48,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-20 20:41:48,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:48,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-20 20:41:48,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-09-20 20:41:48,964 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 93 [2022-09-20 20:41:48,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 96 transitions, 451 flow. Second operand has 9 states, 9 states have (on average 72.55555555555556) internal successors, (653), 9 states have internal predecessors, (653), 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) [2022-09-20 20:41:48,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:48,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 93 [2022-09-20 20:41:48,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:49,230 INFO L130 PetriNetUnfolder]: 141/462 cut-off events. [2022-09-20 20:41:49,230 INFO L131 PetriNetUnfolder]: For 4542/4597 co-relation queries the response was YES. [2022-09-20 20:41:49,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2334 conditions, 462 events. 141/462 cut-off events. For 4542/4597 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2308 event pairs, 40 based on Foata normal form. 25/462 useless extension candidates. Maximal degree in co-relation 2247. Up to 168 conditions per place. [2022-09-20 20:41:49,235 INFO L137 encePairwiseOnDemand]: 82/93 looper letters, 21 selfloop transitions, 14 changer transitions 22/119 dead transitions. [2022-09-20 20:41:49,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 119 transitions, 839 flow [2022-09-20 20:41:49,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-09-20 20:41:49,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-09-20 20:41:49,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 901 transitions. [2022-09-20 20:41:49,238 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.807347670250896 [2022-09-20 20:41:49,238 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 901 transitions. [2022-09-20 20:41:49,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 901 transitions. [2022-09-20 20:41:49,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:49,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 901 transitions. [2022-09-20 20:41:49,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 75.08333333333333) internal successors, (901), 12 states have internal predecessors, (901), 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) [2022-09-20 20:41:49,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 93.0) internal successors, (1209), 13 states have internal predecessors, (1209), 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) [2022-09-20 20:41:49,243 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 93.0) internal successors, (1209), 13 states have internal predecessors, (1209), 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) [2022-09-20 20:41:49,244 INFO L175 Difference]: Start difference. First operand has 133 places, 96 transitions, 451 flow. Second operand 12 states and 901 transitions. [2022-09-20 20:41:49,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 119 transitions, 839 flow [2022-09-20 20:41:49,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 119 transitions, 761 flow, removed 37 selfloop flow, removed 8 redundant places. [2022-09-20 20:41:49,253 INFO L231 Difference]: Finished difference. Result has 133 places, 95 transitions, 450 flow [2022-09-20 20:41:49,253 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=450, PETRI_PLACES=133, PETRI_TRANSITIONS=95} [2022-09-20 20:41:49,254 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 37 predicate places. [2022-09-20 20:41:49,254 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 95 transitions, 450 flow [2022-09-20 20:41:49,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 72.55555555555556) internal successors, (653), 9 states have internal predecessors, (653), 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) [2022-09-20 20:41:49,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:49,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:41:49,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-09-20 20:41:49,255 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 20:41:49,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:49,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1330604476, now seen corresponding path program 1 times [2022-09-20 20:41:49,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:49,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113036306] [2022-09-20 20:41:49,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:49,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:49,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:49,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:49,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113036306] [2022-09-20 20:41:49,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113036306] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:49,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:49,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-09-20 20:41:49,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005929164] [2022-09-20 20:41:49,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:49,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-09-20 20:41:49,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:49,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-09-20 20:41:49,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-09-20 20:41:49,516 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 93 [2022-09-20 20:41:49,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 95 transitions, 450 flow. Second operand has 11 states, 11 states have (on average 71.45454545454545) internal successors, (786), 11 states have internal predecessors, (786), 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) [2022-09-20 20:41:49,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:49,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 93 [2022-09-20 20:41:49,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:49,915 INFO L130 PetriNetUnfolder]: 107/399 cut-off events. [2022-09-20 20:41:49,915 INFO L131 PetriNetUnfolder]: For 4052/4231 co-relation queries the response was YES. [2022-09-20 20:41:49,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1974 conditions, 399 events. 107/399 cut-off events. For 4052/4231 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1982 event pairs, 14 based on Foata normal form. 35/409 useless extension candidates. Maximal degree in co-relation 1883. Up to 102 conditions per place. [2022-09-20 20:41:49,919 INFO L137 encePairwiseOnDemand]: 81/93 looper letters, 24 selfloop transitions, 17 changer transitions 28/130 dead transitions. [2022-09-20 20:41:49,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 130 transitions, 1031 flow [2022-09-20 20:41:49,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-09-20 20:41:49,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-09-20 20:41:49,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1250 transitions. [2022-09-20 20:41:49,922 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7906388361796332 [2022-09-20 20:41:49,922 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1250 transitions. [2022-09-20 20:41:49,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1250 transitions. [2022-09-20 20:41:49,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:49,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1250 transitions. [2022-09-20 20:41:49,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 73.52941176470588) internal successors, (1250), 17 states have internal predecessors, (1250), 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) [2022-09-20 20:41:49,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 93.0) internal successors, (1674), 18 states have internal predecessors, (1674), 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) [2022-09-20 20:41:49,929 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 93.0) internal successors, (1674), 18 states have internal predecessors, (1674), 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) [2022-09-20 20:41:49,929 INFO L175 Difference]: Start difference. First operand has 133 places, 95 transitions, 450 flow. Second operand 17 states and 1250 transitions. [2022-09-20 20:41:49,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 130 transitions, 1031 flow [2022-09-20 20:41:49,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 130 transitions, 879 flow, removed 67 selfloop flow, removed 13 redundant places. [2022-09-20 20:41:49,938 INFO L231 Difference]: Finished difference. Result has 141 places, 95 transitions, 494 flow [2022-09-20 20:41:49,939 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=494, PETRI_PLACES=141, PETRI_TRANSITIONS=95} [2022-09-20 20:41:49,939 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 45 predicate places. [2022-09-20 20:41:49,939 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 95 transitions, 494 flow [2022-09-20 20:41:49,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 71.45454545454545) internal successors, (786), 11 states have internal predecessors, (786), 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) [2022-09-20 20:41:49,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:49,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:41:49,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-09-20 20:41:49,940 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 20:41:49,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:49,941 INFO L85 PathProgramCache]: Analyzing trace with hash -872873794, now seen corresponding path program 1 times [2022-09-20 20:41:49,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:49,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621045937] [2022-09-20 20:41:49,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:49,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:50,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:50,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:50,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621045937] [2022-09-20 20:41:50,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621045937] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:50,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:50,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 20:41:50,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732985952] [2022-09-20 20:41:50,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:50,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 20:41:50,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:50,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 20:41:50,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 20:41:50,025 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 93 [2022-09-20 20:41:50,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 95 transitions, 494 flow. Second operand has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 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) [2022-09-20 20:41:50,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:50,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 93 [2022-09-20 20:41:50,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:50,288 INFO L130 PetriNetUnfolder]: 278/750 cut-off events. [2022-09-20 20:41:50,288 INFO L131 PetriNetUnfolder]: For 6800/6895 co-relation queries the response was YES. [2022-09-20 20:41:50,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3123 conditions, 750 events. 278/750 cut-off events. For 6800/6895 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4356 event pairs, 21 based on Foata normal form. 54/775 useless extension candidates. Maximal degree in co-relation 3033. Up to 174 conditions per place. [2022-09-20 20:41:50,295 INFO L137 encePairwiseOnDemand]: 84/93 looper letters, 27 selfloop transitions, 5 changer transitions 48/144 dead transitions. [2022-09-20 20:41:50,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 144 transitions, 1143 flow [2022-09-20 20:41:50,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 20:41:50,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 20:41:50,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 779 transitions. [2022-09-20 20:41:50,298 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8376344086021505 [2022-09-20 20:41:50,298 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 779 transitions. [2022-09-20 20:41:50,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 779 transitions. [2022-09-20 20:41:50,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:50,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 779 transitions. [2022-09-20 20:41:50,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 77.9) internal successors, (779), 10 states have internal predecessors, (779), 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) [2022-09-20 20:41:50,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 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) [2022-09-20 20:41:50,303 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 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) [2022-09-20 20:41:50,303 INFO L175 Difference]: Start difference. First operand has 141 places, 95 transitions, 494 flow. Second operand 10 states and 779 transitions. [2022-09-20 20:41:50,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 144 transitions, 1143 flow [2022-09-20 20:41:50,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 144 transitions, 1023 flow, removed 32 selfloop flow, removed 21 redundant places. [2022-09-20 20:41:50,315 INFO L231 Difference]: Finished difference. Result has 126 places, 87 transitions, 381 flow [2022-09-20 20:41:50,316 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=381, PETRI_PLACES=126, PETRI_TRANSITIONS=87} [2022-09-20 20:41:50,317 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 30 predicate places. [2022-09-20 20:41:50,317 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 87 transitions, 381 flow [2022-09-20 20:41:50,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 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) [2022-09-20 20:41:50,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:50,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:41:50,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-20 20:41:50,318 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 20:41:50,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:50,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1931288650, now seen corresponding path program 1 times [2022-09-20 20:41:50,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:50,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192768178] [2022-09-20 20:41:50,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:50,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:50,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:50,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:50,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192768178] [2022-09-20 20:41:50,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192768178] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:50,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:50,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 20:41:50,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538510015] [2022-09-20 20:41:50,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:50,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 20:41:50,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:50,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 20:41:50,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 20:41:50,403 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 93 [2022-09-20 20:41:50,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 87 transitions, 381 flow. Second operand has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 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) [2022-09-20 20:41:50,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:50,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 93 [2022-09-20 20:41:50,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:50,574 INFO L130 PetriNetUnfolder]: 54/262 cut-off events. [2022-09-20 20:41:50,575 INFO L131 PetriNetUnfolder]: For 1448/1456 co-relation queries the response was YES. [2022-09-20 20:41:50,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 995 conditions, 262 events. 54/262 cut-off events. For 1448/1456 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1066 event pairs, 2 based on Foata normal form. 20/280 useless extension candidates. Maximal degree in co-relation 923. Up to 46 conditions per place. [2022-09-20 20:41:50,577 INFO L137 encePairwiseOnDemand]: 85/93 looper letters, 19 selfloop transitions, 7 changer transitions 21/108 dead transitions. [2022-09-20 20:41:50,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 108 transitions, 691 flow [2022-09-20 20:41:50,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 20:41:50,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 20:41:50,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 758 transitions. [2022-09-20 20:41:50,580 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8150537634408602 [2022-09-20 20:41:50,580 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 758 transitions. [2022-09-20 20:41:50,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 758 transitions. [2022-09-20 20:41:50,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:50,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 758 transitions. [2022-09-20 20:41:50,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 75.8) internal successors, (758), 10 states have internal predecessors, (758), 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) [2022-09-20 20:41:50,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 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) [2022-09-20 20:41:50,584 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 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) [2022-09-20 20:41:50,584 INFO L175 Difference]: Start difference. First operand has 126 places, 87 transitions, 381 flow. Second operand 10 states and 758 transitions. [2022-09-20 20:41:50,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 108 transitions, 691 flow [2022-09-20 20:41:50,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 108 transitions, 488 flow, removed 97 selfloop flow, removed 17 redundant places. [2022-09-20 20:41:50,589 INFO L231 Difference]: Finished difference. Result has 118 places, 83 transitions, 296 flow [2022-09-20 20:41:50,589 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=296, PETRI_PLACES=118, PETRI_TRANSITIONS=83} [2022-09-20 20:41:50,591 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 22 predicate places. [2022-09-20 20:41:50,591 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 83 transitions, 296 flow [2022-09-20 20:41:50,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 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) [2022-09-20 20:41:50,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:50,592 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:41:50,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-09-20 20:41:50,592 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 20:41:50,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:50,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1596495984, now seen corresponding path program 1 times [2022-09-20 20:41:50,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:50,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745452826] [2022-09-20 20:41:50,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:50,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:50,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:50,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:50,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745452826] [2022-09-20 20:41:50,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745452826] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:50,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:50,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-09-20 20:41:50,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014557785] [2022-09-20 20:41:50,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:50,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-09-20 20:41:50,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:50,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-09-20 20:41:50,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-09-20 20:41:50,901 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 93 [2022-09-20 20:41:50,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 83 transitions, 296 flow. Second operand has 12 states, 12 states have (on average 69.66666666666667) internal successors, (836), 12 states have internal predecessors, (836), 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) [2022-09-20 20:41:50,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:50,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 93 [2022-09-20 20:41:50,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:51,129 INFO L130 PetriNetUnfolder]: 5/141 cut-off events. [2022-09-20 20:41:51,130 INFO L131 PetriNetUnfolder]: For 121/123 co-relation queries the response was YES. [2022-09-20 20:41:51,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 141 events. 5/141 cut-off events. For 121/123 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 266 event pairs, 0 based on Foata normal form. 3/144 useless extension candidates. Maximal degree in co-relation 263. Up to 17 conditions per place. [2022-09-20 20:41:51,131 INFO L137 encePairwiseOnDemand]: 83/93 looper letters, 23 selfloop transitions, 6 changer transitions 9/96 dead transitions. [2022-09-20 20:41:51,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 96 transitions, 406 flow [2022-09-20 20:41:51,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 20:41:51,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 20:41:51,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 787 transitions. [2022-09-20 20:41:51,133 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7693059628543499 [2022-09-20 20:41:51,133 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 787 transitions. [2022-09-20 20:41:51,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 787 transitions. [2022-09-20 20:41:51,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:51,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 787 transitions. [2022-09-20 20:41:51,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 71.54545454545455) internal successors, (787), 11 states have internal predecessors, (787), 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) [2022-09-20 20:41:51,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 93.0) internal successors, (1116), 12 states have internal predecessors, (1116), 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) [2022-09-20 20:41:51,137 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 93.0) internal successors, (1116), 12 states have internal predecessors, (1116), 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) [2022-09-20 20:41:51,137 INFO L175 Difference]: Start difference. First operand has 118 places, 83 transitions, 296 flow. Second operand 11 states and 787 transitions. [2022-09-20 20:41:51,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 96 transitions, 406 flow [2022-09-20 20:41:51,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 96 transitions, 324 flow, removed 19 selfloop flow, removed 21 redundant places. [2022-09-20 20:41:51,141 INFO L231 Difference]: Finished difference. Result has 106 places, 80 transitions, 221 flow [2022-09-20 20:41:51,141 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=221, PETRI_PLACES=106, PETRI_TRANSITIONS=80} [2022-09-20 20:41:51,141 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 10 predicate places. [2022-09-20 20:41:51,141 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 80 transitions, 221 flow [2022-09-20 20:41:51,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 69.66666666666667) internal successors, (836), 12 states have internal predecessors, (836), 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) [2022-09-20 20:41:51,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:51,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:41:51,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-09-20 20:41:51,143 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 20:41:51,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:51,143 INFO L85 PathProgramCache]: Analyzing trace with hash 766511394, now seen corresponding path program 2 times [2022-09-20 20:41:51,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:51,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957806273] [2022-09-20 20:41:51,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:51,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 20:41:51,195 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-20 20:41:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 20:41:51,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-20 20:41:51,271 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-09-20 20:41:51,272 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-09-20 20:41:51,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-09-20 20:41:51,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-09-20 20:41:51,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-09-20 20:41:51,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-09-20 20:41:51,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-09-20 20:41:51,274 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:41:51,280 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-20 20:41:51,280 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-20 20:41:51,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 08:41:51 BasicIcfg [2022-09-20 20:41:51,375 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-20 20:41:51,375 INFO L158 Benchmark]: Toolchain (without parser) took 8215.80ms. Allocated memory was 192.9MB in the beginning and 343.9MB in the end (delta: 151.0MB). Free memory was 159.9MB in the beginning and 220.9MB in the end (delta: -61.0MB). Peak memory consumption was 90.0MB. Max. memory is 8.0GB. [2022-09-20 20:41:51,376 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 192.9MB. Free memory is still 147.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-20 20:41:51,376 INFO L158 Benchmark]: CACSL2BoogieTranslator took 591.72ms. Allocated memory was 192.9MB in the beginning and 268.4MB in the end (delta: 75.5MB). Free memory was 159.7MB in the beginning and 225.2MB in the end (delta: -65.6MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. [2022-09-20 20:41:51,376 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.94ms. Allocated memory is still 268.4MB. Free memory was 225.2MB in the beginning and 222.4MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-09-20 20:41:51,376 INFO L158 Benchmark]: Boogie Preprocessor took 30.79ms. Allocated memory is still 268.4MB. Free memory was 222.4MB in the beginning and 220.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-20 20:41:51,377 INFO L158 Benchmark]: RCFGBuilder took 964.10ms. Allocated memory is still 268.4MB. Free memory was 220.3MB in the beginning and 211.8MB in the end (delta: 8.5MB). Peak memory consumption was 51.0MB. Max. memory is 8.0GB. [2022-09-20 20:41:51,377 INFO L158 Benchmark]: TraceAbstraction took 6555.41ms. Allocated memory was 268.4MB in the beginning and 343.9MB in the end (delta: 75.5MB). Free memory was 211.3MB in the beginning and 220.9MB in the end (delta: -9.6MB). Peak memory consumption was 65.9MB. Max. memory is 8.0GB. [2022-09-20 20:41:51,381 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.19ms. Allocated memory is still 192.9MB. Free memory is still 147.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 591.72ms. Allocated memory was 192.9MB in the beginning and 268.4MB in the end (delta: 75.5MB). Free memory was 159.7MB in the beginning and 225.2MB in the end (delta: -65.6MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.94ms. Allocated memory is still 268.4MB. Free memory was 225.2MB in the beginning and 222.4MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.79ms. Allocated memory is still 268.4MB. Free memory was 222.4MB in the beginning and 220.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 964.10ms. Allocated memory is still 268.4MB. Free memory was 220.3MB in the beginning and 211.8MB in the end (delta: 8.5MB). Peak memory consumption was 51.0MB. Max. memory is 8.0GB. * TraceAbstraction took 6555.41ms. Allocated memory was 268.4MB in the beginning and 343.9MB in the end (delta: 75.5MB). Free memory was 211.3MB in the beginning and 220.9MB in the end (delta: -9.6MB). Peak memory consumption was 65.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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; VAL [__unbuffered_cnt=0] [L709] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L710] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L712] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L714] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L715] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L716] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L717] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L718] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L719] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L720] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L721] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L722] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L723] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L724] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L725] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L726] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L727] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L728] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L729] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L730] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L790] 0 pthread_t t2473; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473={5: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] [L791] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2473, ((void *)0), P0, ((void *)0))=-1, t2473={5: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] [L792] 0 pthread_t t2474; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473={5:0}, t2474={3: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] [L793] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2474, ((void *)0), P1, ((void *)0))=0, t2473={5:0}, t2474={3: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 [L738] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L738] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [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 [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 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473={5:0}, t2474={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [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 [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473={5:0}, t2474={3:0}, weak$$choice0=49, weak$$choice2=255, 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] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 791]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 111 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 432 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 432 mSDsluCounter, 479 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 644 mSDsCounter, 142 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1083 IncrementalHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 142 mSolverCounterUnsat, 99 mSDtfsCounter, 1083 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=494occurred in iteration=8, InterpolantAutomatonStates: 127, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 775 NumberOfCodeBlocks, 775 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 692 ConstructedInterpolants, 0 QuantifiedInterpolants, 3901 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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! [2022-09-20 20:41:51,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...