/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix034_pso.opt_tso.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 05:59:54,625 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 05:59:54,676 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 05:59:54,679 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 05:59:54,679 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 05:59:54,680 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 05:59:54,680 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 05:59:54,697 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 05:59:54,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 05:59:54,698 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 05:59:54,698 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 05:59:54,699 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 05:59:54,699 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 05:59:54,699 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 05:59:54,700 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 05:59:54,700 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 05:59:54,700 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 05:59:54,701 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 05:59:54,701 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 05:59:54,701 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 05:59:54,701 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 05:59:54,702 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 05:59:54,702 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 05:59:54,702 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 05:59:54,703 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 05:59:54,703 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 05:59:54,703 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 05:59:54,703 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 05:59:54,704 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 05:59:54,704 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 05:59:54,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:59:54,704 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 05:59:54,705 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 05:59:54,705 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 05:59:54,705 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 05:59:54,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 05:59:54,705 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 05:59:54,705 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 05:59:54,706 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 05:59:54,706 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 05:59:54,706 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 05:59:54,706 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-04 05:59:54,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 05:59:54,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 05:59:54,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 05:59:54,912 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 05:59:54,912 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 05:59:54,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix034_pso.opt_tso.opt_bound2.i [2023-08-04 05:59:56,112 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 05:59:56,412 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 05:59:56,412 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix034_pso.opt_tso.opt_bound2.i [2023-08-04 05:59:56,436 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dff4a6c9d/63ff076e09d54ccf9dd4fbdce3251f84/FLAG3089fd36c [2023-08-04 05:59:56,453 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dff4a6c9d/63ff076e09d54ccf9dd4fbdce3251f84 [2023-08-04 05:59:56,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 05:59:56,461 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 05:59:56,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 05:59:56,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 05:59:56,465 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 05:59:56,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:59:56" (1/1) ... [2023-08-04 05:59:56,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70dd9493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:59:56, skipping insertion in model container [2023-08-04 05:59:56,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:59:56" (1/1) ... [2023-08-04 05:59:56,514 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 05:59:56,642 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix034_pso.opt_tso.opt_bound2.i[999,1012] [2023-08-04 05:59:56,797 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:59:56,809 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 05:59:56,821 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix034_pso.opt_tso.opt_bound2.i[999,1012] [2023-08-04 05:59:56,841 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-04 05:59:56,843 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-04 05:59:56,887 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:59:56,913 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:59:56,913 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:59:56,919 INFO L206 MainTranslator]: Completed translation [2023-08-04 05:59:56,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:59:56 WrapperNode [2023-08-04 05:59:56,920 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 05:59:56,921 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 05:59:56,921 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 05:59:56,921 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 05:59:56,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:59:56" (1/1) ... [2023-08-04 05:59:56,943 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:59:56" (1/1) ... [2023-08-04 05:59:56,965 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 137 [2023-08-04 05:59:56,965 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 05:59:56,966 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 05:59:56,966 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 05:59:56,966 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 05:59:56,974 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:59:56" (1/1) ... [2023-08-04 05:59:56,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:59:56" (1/1) ... [2023-08-04 05:59:56,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:59:56" (1/1) ... [2023-08-04 05:59:56,977 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:59:56" (1/1) ... [2023-08-04 05:59:56,986 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:59:56" (1/1) ... [2023-08-04 05:59:56,992 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:59:56" (1/1) ... [2023-08-04 05:59:56,994 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:59:56" (1/1) ... [2023-08-04 05:59:56,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:59:56" (1/1) ... [2023-08-04 05:59:56,998 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 05:59:56,999 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 05:59:56,999 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 05:59:56,999 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 05:59:57,000 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:59:56" (1/1) ... [2023-08-04 05:59:57,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:59:57,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:59:57,059 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) [2023-08-04 05:59:57,084 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 [2023-08-04 05:59:57,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 05:59:57,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 05:59:57,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 05:59:57,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 05:59:57,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 05:59:57,102 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 05:59:57,102 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 05:59:57,103 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 05:59:57,103 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 05:59:57,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 05:59:57,103 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 05:59:57,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 05:59:57,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 05:59:57,106 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 05:59:57,218 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 05:59:57,219 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 05:59:57,464 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 05:59:57,615 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 05:59:57,616 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-04 05:59:57,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:59:57 BoogieIcfgContainer [2023-08-04 05:59:57,618 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 05:59:57,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 05:59:57,623 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 05:59:57,625 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 05:59:57,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 05:59:56" (1/3) ... [2023-08-04 05:59:57,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ea6f12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:59:57, skipping insertion in model container [2023-08-04 05:59:57,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:59:56" (2/3) ... [2023-08-04 05:59:57,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ea6f12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:59:57, skipping insertion in model container [2023-08-04 05:59:57,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:59:57" (3/3) ... [2023-08-04 05:59:57,630 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix034_pso.opt_tso.opt_bound2.i [2023-08-04 05:59:57,638 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 05:59:57,646 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 05:59:57,646 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 05:59:57,646 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 05:59:57,694 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:59:57,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 105 transitions, 220 flow [2023-08-04 05:59:57,828 INFO L124 PetriNetUnfolderBase]: 14/223 cut-off events. [2023-08-04 05:59:57,829 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:59:57,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 223 events. 14/223 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 629 event pairs, 0 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 130. Up to 8 conditions per place. [2023-08-04 05:59:57,834 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 105 transitions, 220 flow [2023-08-04 05:59:57,839 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 104 transitions, 216 flow [2023-08-04 05:59:57,842 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:59:57,858 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 104 transitions, 216 flow [2023-08-04 05:59:57,862 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 104 transitions, 216 flow [2023-08-04 05:59:57,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 104 transitions, 216 flow [2023-08-04 05:59:57,927 INFO L124 PetriNetUnfolderBase]: 14/222 cut-off events. [2023-08-04 05:59:57,927 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:59:57,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 222 events. 14/222 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 627 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 128. Up to 8 conditions per place. [2023-08-04 05:59:57,930 INFO L119 LiptonReduction]: Number of co-enabled transitions 1472 [2023-08-04 06:00:00,858 INFO L134 LiptonReduction]: Checked pairs total: 3270 [2023-08-04 06:00:00,858 INFO L136 LiptonReduction]: Total number of compositions: 94 [2023-08-04 06:00:00,870 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 06:00:00,877 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=true, 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;@ce62fef, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:00:00,878 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 06:00:00,881 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:00:00,882 INFO L124 PetriNetUnfolderBase]: 1/12 cut-off events. [2023-08-04 06:00:00,882 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:00:00,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:00:00,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 06:00:00,883 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:00:00,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:00:00,888 INFO L85 PathProgramCache]: Analyzing trace with hash 442928861, now seen corresponding path program 1 times [2023-08-04 06:00:00,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:00:00,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144119945] [2023-08-04 06:00:00,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:00:00,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:00:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:00:01,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:00:01,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:00:01,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144119945] [2023-08-04 06:00:01,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144119945] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:00:01,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:00:01,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:00:01,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678826610] [2023-08-04 06:00:01,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:00:01,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:00:01,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:00:01,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:00:01,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:00:01,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 199 [2023-08-04 06:00:01,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 23 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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) [2023-08-04 06:00:01,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:00:01,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 199 [2023-08-04 06:00:01,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:00:01,352 INFO L124 PetriNetUnfolderBase]: 270/508 cut-off events. [2023-08-04 06:00:01,352 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:00:01,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1002 conditions, 508 events. 270/508 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2089 event pairs, 120 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 990. Up to 471 conditions per place. [2023-08-04 06:00:01,360 INFO L140 encePairwiseOnDemand]: 195/199 looper letters, 21 selfloop transitions, 2 changer transitions 1/26 dead transitions. [2023-08-04 06:00:01,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 26 transitions, 108 flow [2023-08-04 06:00:01,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:00:01,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:00:01,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 293 transitions. [2023-08-04 06:00:01,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.490787269681742 [2023-08-04 06:00:01,374 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 293 transitions. [2023-08-04 06:00:01,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 293 transitions. [2023-08-04 06:00:01,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:00:01,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 293 transitions. [2023-08-04 06:00:01,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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) [2023-08-04 06:00:01,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 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) [2023-08-04 06:00:01,385 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 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) [2023-08-04 06:00:01,387 INFO L175 Difference]: Start difference. First operand has 27 places, 23 transitions, 54 flow. Second operand 3 states and 293 transitions. [2023-08-04 06:00:01,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 26 transitions, 108 flow [2023-08-04 06:00:01,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 26 transitions, 108 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 06:00:01,391 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 60 flow [2023-08-04 06:00:01,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2023-08-04 06:00:01,395 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 3 predicate places. [2023-08-04 06:00:01,395 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 60 flow [2023-08-04 06:00:01,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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) [2023-08-04 06:00:01,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:00:01,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:00:01,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 06:00:01,397 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:00:01,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:00:01,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1949819660, now seen corresponding path program 1 times [2023-08-04 06:00:01,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:00:01,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011694615] [2023-08-04 06:00:01,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:00:01,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:00:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:00:01,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:00:01,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:00:01,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011694615] [2023-08-04 06:00:01,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011694615] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:00:01,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912365970] [2023-08-04 06:00:01,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:00:01,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:00:01,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:00:01,480 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 06:00:01,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-04 06:00:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:00:01,609 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 06:00:01,613 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:00:01,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:00:01,650 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:00:01,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:00:01,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912365970] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:00:01,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:00:01,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 06:00:01,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056667543] [2023-08-04 06:00:01,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:00:01,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 06:00:01,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:00:01,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 06:00:01,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:00:01,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 199 [2023-08-04 06:00:01,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 60 flow. Second operand has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 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) [2023-08-04 06:00:01,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:00:01,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 199 [2023-08-04 06:00:01,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:00:01,717 INFO L124 PetriNetUnfolderBase]: 6/20 cut-off events. [2023-08-04 06:00:01,717 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-04 06:00:01,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 20 events. 6/20 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 4/24 useless extension candidates. Maximal degree in co-relation 51. Up to 14 conditions per place. [2023-08-04 06:00:01,718 INFO L140 encePairwiseOnDemand]: 196/199 looper letters, 0 selfloop transitions, 0 changer transitions 11/11 dead transitions. [2023-08-04 06:00:01,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 11 transitions, 53 flow [2023-08-04 06:00:01,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:00:01,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:00:01,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 364 transitions. [2023-08-04 06:00:01,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.457286432160804 [2023-08-04 06:00:01,733 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 364 transitions. [2023-08-04 06:00:01,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 364 transitions. [2023-08-04 06:00:01,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:00:01,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 364 transitions. [2023-08-04 06:00:01,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 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) [2023-08-04 06:00:01,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 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) [2023-08-04 06:00:01,738 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 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) [2023-08-04 06:00:01,738 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 60 flow. Second operand 4 states and 364 transitions. [2023-08-04 06:00:01,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 11 transitions, 53 flow [2023-08-04 06:00:01,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 14 places, 11 transitions, 47 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-04 06:00:01,739 INFO L231 Difference]: Finished difference. Result has 14 places, 0 transitions, 0 flow [2023-08-04 06:00:01,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=17, PETRI_DIFFERENCE_MINUEND_PLACES=11, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=7, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=14, PETRI_TRANSITIONS=0} [2023-08-04 06:00:01,740 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, -13 predicate places. [2023-08-04 06:00:01,740 INFO L495 AbstractCegarLoop]: Abstraction has has 14 places, 0 transitions, 0 flow [2023-08-04 06:00:01,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 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) [2023-08-04 06:00:01,744 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 06:00:01,745 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 06:00:01,745 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 06:00:01,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 06:00:01,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:00:01,952 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 06:00:01,954 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 06:00:01,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 105 transitions, 220 flow [2023-08-04 06:00:01,982 INFO L124 PetriNetUnfolderBase]: 14/223 cut-off events. [2023-08-04 06:00:01,982 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:00:01,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 223 events. 14/223 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 629 event pairs, 0 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 130. Up to 8 conditions per place. [2023-08-04 06:00:01,984 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 105 transitions, 220 flow [2023-08-04 06:00:01,985 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 78 transitions, 166 flow [2023-08-04 06:00:01,985 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:00:01,985 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 78 transitions, 166 flow [2023-08-04 06:00:01,985 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 78 transitions, 166 flow [2023-08-04 06:00:01,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 78 transitions, 166 flow [2023-08-04 06:00:01,996 INFO L124 PetriNetUnfolderBase]: 2/115 cut-off events. [2023-08-04 06:00:01,996 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:00:01,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 162 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 76. Up to 4 conditions per place. [2023-08-04 06:00:01,997 INFO L119 LiptonReduction]: Number of co-enabled transitions 620 [2023-08-04 06:00:04,477 INFO L134 LiptonReduction]: Checked pairs total: 1347 [2023-08-04 06:00:04,477 INFO L136 LiptonReduction]: Total number of compositions: 66 [2023-08-04 06:00:04,479 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 06:00:04,480 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=true, 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;@ce62fef, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:00:04,480 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 06:00:04,483 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:00:04,483 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-08-04 06:00:04,483 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:00:04,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:00:04,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 06:00:04,483 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 06:00:04,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:00:04,484 INFO L85 PathProgramCache]: Analyzing trace with hash 506401241, now seen corresponding path program 1 times [2023-08-04 06:00:04,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:00:04,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258266423] [2023-08-04 06:00:04,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:00:04,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:00:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:00:04,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 06:00:04,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:00:04,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258266423] [2023-08-04 06:00:04,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258266423] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:00:04,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:00:04,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:00:04,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82835745] [2023-08-04 06:00:04,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:00:04,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:00:04,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:00:04,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:00:04,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:00:04,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 171 [2023-08-04 06:00:04,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 17 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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) [2023-08-04 06:00:04,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:00:04,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 171 [2023-08-04 06:00:04,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:00:04,590 INFO L124 PetriNetUnfolderBase]: 65/139 cut-off events. [2023-08-04 06:00:04,591 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:00:04,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 139 events. 65/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 444 event pairs, 20 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 272. Up to 126 conditions per place. [2023-08-04 06:00:04,592 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 17 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2023-08-04 06:00:04,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 21 transitions, 90 flow [2023-08-04 06:00:04,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:00:04,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:00:04,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2023-08-04 06:00:04,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5594541910331384 [2023-08-04 06:00:04,593 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 287 transitions. [2023-08-04 06:00:04,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 287 transitions. [2023-08-04 06:00:04,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:00:04,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 287 transitions. [2023-08-04 06:00:04,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 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) [2023-08-04 06:00:04,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 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) [2023-08-04 06:00:04,596 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 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) [2023-08-04 06:00:04,597 INFO L175 Difference]: Start difference. First operand has 22 places, 17 transitions, 44 flow. Second operand 3 states and 287 transitions. [2023-08-04 06:00:04,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 21 transitions, 90 flow [2023-08-04 06:00:04,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 21 transitions, 90 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 06:00:04,598 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 52 flow [2023-08-04 06:00:04,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2023-08-04 06:00:04,598 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 3 predicate places. [2023-08-04 06:00:04,599 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 52 flow [2023-08-04 06:00:04,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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) [2023-08-04 06:00:04,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:00:04,599 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 06:00:04,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 06:00:04,600 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 06:00:04,600 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:00:04,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1485987528, now seen corresponding path program 1 times [2023-08-04 06:00:04,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:00:04,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045240984] [2023-08-04 06:00:04,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:00:04,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:00:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:00:04,615 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 06:00:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:00:04,636 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 06:00:04,637 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 06:00:04,637 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 06:00:04,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 06:00:04,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-04 06:00:04,638 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 06:00:04,638 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (2/2) [2023-08-04 06:00:04,639 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 06:00:04,639 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 06:00:04,657 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 06:00:04,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 123 transitions, 270 flow [2023-08-04 06:00:04,695 INFO L124 PetriNetUnfolderBase]: 30/463 cut-off events. [2023-08-04 06:00:04,695 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 06:00:04,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 463 events. 30/463 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1993 event pairs, 0 based on Foata normal form. 0/406 useless extension candidates. Maximal degree in co-relation 332. Up to 18 conditions per place. [2023-08-04 06:00:04,697 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 123 transitions, 270 flow [2023-08-04 06:00:04,699 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 122 transitions, 264 flow [2023-08-04 06:00:04,699 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:00:04,699 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 122 transitions, 264 flow [2023-08-04 06:00:04,699 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 122 transitions, 264 flow [2023-08-04 06:00:04,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 122 transitions, 264 flow [2023-08-04 06:00:04,736 INFO L124 PetriNetUnfolderBase]: 30/462 cut-off events. [2023-08-04 06:00:04,736 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-04 06:00:04,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 462 events. 30/462 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1978 event pairs, 0 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 332. Up to 18 conditions per place. [2023-08-04 06:00:04,744 INFO L119 LiptonReduction]: Number of co-enabled transitions 3512 [2023-08-04 06:00:07,683 INFO L134 LiptonReduction]: Checked pairs total: 10320 [2023-08-04 06:00:07,683 INFO L136 LiptonReduction]: Total number of compositions: 98 [2023-08-04 06:00:07,685 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 06:00:07,686 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=true, 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;@ce62fef, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:00:07,686 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 06:00:07,689 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:00:07,689 INFO L124 PetriNetUnfolderBase]: 1/12 cut-off events. [2023-08-04 06:00:07,689 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:00:07,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:00:07,689 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 06:00:07,690 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:00:07,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:00:07,690 INFO L85 PathProgramCache]: Analyzing trace with hash 733128908, now seen corresponding path program 1 times [2023-08-04 06:00:07,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:00:07,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593374451] [2023-08-04 06:00:07,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:00:07,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:00:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:00:07,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:00:07,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:00:07,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593374451] [2023-08-04 06:00:07,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593374451] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:00:07,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:00:07,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:00:07,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002200293] [2023-08-04 06:00:07,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:00:07,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:00:07,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:00:07,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:00:07,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:00:07,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 221 [2023-08-04 06:00:07,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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) [2023-08-04 06:00:07,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:00:07,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 221 [2023-08-04 06:00:07,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:00:09,764 INFO L124 PetriNetUnfolderBase]: 11578/17993 cut-off events. [2023-08-04 06:00:09,765 INFO L125 PetriNetUnfolderBase]: For 380/380 co-relation queries the response was YES. [2023-08-04 06:00:09,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34473 conditions, 17993 events. 11578/17993 cut-off events. For 380/380 co-relation queries the response was YES. Maximal size of possible extension queue 793. Compared 122381 event pairs, 8296 based on Foata normal form. 0/14904 useless extension candidates. Maximal degree in co-relation 7582. Up to 15955 conditions per place. [2023-08-04 06:00:09,904 INFO L140 encePairwiseOnDemand]: 217/221 looper letters, 31 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-08-04 06:00:09,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 42 transitions, 170 flow [2023-08-04 06:00:09,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:00:09,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:00:09,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2023-08-04 06:00:09,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5098039215686274 [2023-08-04 06:00:09,906 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 338 transitions. [2023-08-04 06:00:09,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 338 transitions. [2023-08-04 06:00:09,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:00:09,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 338 transitions. [2023-08-04 06:00:09,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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) [2023-08-04 06:00:09,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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) [2023-08-04 06:00:09,910 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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) [2023-08-04 06:00:09,910 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 96 flow. Second operand 3 states and 338 transitions. [2023-08-04 06:00:09,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 42 transitions, 170 flow [2023-08-04 06:00:09,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 42 transitions, 168 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-04 06:00:09,915 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 104 flow [2023-08-04 06:00:09,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-08-04 06:00:09,919 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 3 predicate places. [2023-08-04 06:00:09,919 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 104 flow [2023-08-04 06:00:09,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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) [2023-08-04 06:00:09,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:00:09,919 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:00:09,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-04 06:00:09,920 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:00:09,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:00:09,920 INFO L85 PathProgramCache]: Analyzing trace with hash -747575452, now seen corresponding path program 1 times [2023-08-04 06:00:09,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:00:09,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153936261] [2023-08-04 06:00:09,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:00:09,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:00:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:00:09,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:00:09,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:00:09,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153936261] [2023-08-04 06:00:09,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153936261] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:00:09,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715321804] [2023-08-04 06:00:09,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:00:09,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:00:09,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:00:09,996 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 06:00:10,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-04 06:00:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:00:10,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 06:00:10,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:00:10,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:00:10,096 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:00:10,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:00:10,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715321804] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:00:10,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:00:10,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-04 06:00:10,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082486366] [2023-08-04 06:00:10,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:00:10,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 06:00:10,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:00:10,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 06:00:10,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 06:00:10,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 221 [2023-08-04 06:00:10,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 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) [2023-08-04 06:00:10,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:00:10,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 221 [2023-08-04 06:00:10,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:00:11,812 INFO L124 PetriNetUnfolderBase]: 9794/15045 cut-off events. [2023-08-04 06:00:11,812 INFO L125 PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES. [2023-08-04 06:00:11,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28756 conditions, 15045 events. 9794/15045 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 97610 event pairs, 4556 based on Foata normal form. 4/12616 useless extension candidates. Maximal degree in co-relation 7618. Up to 13225 conditions per place. [2023-08-04 06:00:11,887 INFO L140 encePairwiseOnDemand]: 217/221 looper letters, 36 selfloop transitions, 3 changer transitions 1/49 dead transitions. [2023-08-04 06:00:11,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 206 flow [2023-08-04 06:00:11,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:00:11,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:00:11,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 441 transitions. [2023-08-04 06:00:11,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.498868778280543 [2023-08-04 06:00:11,889 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 441 transitions. [2023-08-04 06:00:11,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 441 transitions. [2023-08-04 06:00:11,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:00:11,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 441 transitions. [2023-08-04 06:00:11,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 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) [2023-08-04 06:00:11,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 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) [2023-08-04 06:00:11,893 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 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) [2023-08-04 06:00:11,893 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 104 flow. Second operand 4 states and 441 transitions. [2023-08-04 06:00:11,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 206 flow [2023-08-04 06:00:11,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 49 transitions, 204 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:00:11,895 INFO L231 Difference]: Finished difference. Result has 53 places, 38 transitions, 116 flow [2023-08-04 06:00:11,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=53, PETRI_TRANSITIONS=38} [2023-08-04 06:00:11,896 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2023-08-04 06:00:11,896 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 116 flow [2023-08-04 06:00:11,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 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) [2023-08-04 06:00:11,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:00:11,896 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:00:11,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-04 06:00:12,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-08-04 06:00:12,102 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:00:12,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:00:12,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1464941393, now seen corresponding path program 1 times [2023-08-04 06:00:12,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:00:12,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293314686] [2023-08-04 06:00:12,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:00:12,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:00:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:00:12,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 06:00:12,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:00:12,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293314686] [2023-08-04 06:00:12,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293314686] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:00:12,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:00:12,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 06:00:12,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769440925] [2023-08-04 06:00:12,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:00:12,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:00:12,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:00:12,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:00:12,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:00:12,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 221 [2023-08-04 06:00:12,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 38 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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) [2023-08-04 06:00:12,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:00:12,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 221 [2023-08-04 06:00:12,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:00:13,356 INFO L124 PetriNetUnfolderBase]: 8362/13149 cut-off events. [2023-08-04 06:00:13,357 INFO L125 PetriNetUnfolderBase]: For 329/329 co-relation queries the response was YES. [2023-08-04 06:00:13,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24924 conditions, 13149 events. 8362/13149 cut-off events. For 329/329 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 85745 event pairs, 1642 based on Foata normal form. 0/11164 useless extension candidates. Maximal degree in co-relation 6589. Up to 10529 conditions per place. [2023-08-04 06:00:13,512 INFO L140 encePairwiseOnDemand]: 216/221 looper letters, 41 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2023-08-04 06:00:13,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 53 transitions, 239 flow [2023-08-04 06:00:13,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:00:13,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:00:13,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-08-04 06:00:13,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2023-08-04 06:00:13,514 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-08-04 06:00:13,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-08-04 06:00:13,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:00:13,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-08-04 06:00:13,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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) [2023-08-04 06:00:13,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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) [2023-08-04 06:00:13,519 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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) [2023-08-04 06:00:13,519 INFO L175 Difference]: Start difference. First operand has 53 places, 38 transitions, 116 flow. Second operand 3 states and 357 transitions. [2023-08-04 06:00:13,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 53 transitions, 239 flow [2023-08-04 06:00:13,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 232 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 06:00:13,522 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 130 flow [2023-08-04 06:00:13,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2023-08-04 06:00:13,524 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2023-08-04 06:00:13,524 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 130 flow [2023-08-04 06:00:13,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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) [2023-08-04 06:00:13,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:00:13,525 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:00:13,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 06:00:13,525 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:00:13,526 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:00:13,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1464943327, now seen corresponding path program 1 times [2023-08-04 06:00:13,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:00:13,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902092756] [2023-08-04 06:00:13,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:00:13,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:00:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:00:13,571 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 06:00:13,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:00:13,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902092756] [2023-08-04 06:00:13,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902092756] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:00:13,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:00:13,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 06:00:13,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016294895] [2023-08-04 06:00:13,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:00:13,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:00:13,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:00:13,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:00:13,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:00:13,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 221 [2023-08-04 06:00:13,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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) [2023-08-04 06:00:13,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:00:13,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 221 [2023-08-04 06:00:13,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:00:14,680 INFO L124 PetriNetUnfolderBase]: 8266/12701 cut-off events. [2023-08-04 06:00:14,680 INFO L125 PetriNetUnfolderBase]: For 1014/1014 co-relation queries the response was YES. [2023-08-04 06:00:14,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26348 conditions, 12701 events. 8266/12701 cut-off events. For 1014/1014 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 82888 event pairs, 6266 based on Foata normal form. 0/11024 useless extension candidates. Maximal degree in co-relation 6937. Up to 11017 conditions per place. [2023-08-04 06:00:14,737 INFO L140 encePairwiseOnDemand]: 218/221 looper letters, 40 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-08-04 06:00:14,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 51 transitions, 239 flow [2023-08-04 06:00:14,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:00:14,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:00:14,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2023-08-04 06:00:14,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5173453996983409 [2023-08-04 06:00:14,739 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 343 transitions. [2023-08-04 06:00:14,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 343 transitions. [2023-08-04 06:00:14,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:00:14,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 343 transitions. [2023-08-04 06:00:14,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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) [2023-08-04 06:00:14,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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) [2023-08-04 06:00:14,742 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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) [2023-08-04 06:00:14,742 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 130 flow. Second operand 3 states and 343 transitions. [2023-08-04 06:00:14,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 51 transitions, 239 flow [2023-08-04 06:00:14,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 51 transitions, 235 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:00:14,744 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 139 flow [2023-08-04 06:00:14,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2023-08-04 06:00:14,744 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 9 predicate places. [2023-08-04 06:00:14,745 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 139 flow [2023-08-04 06:00:14,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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) [2023-08-04 06:00:14,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:00:14,745 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:00:14,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 06:00:14,745 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:00:14,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:00:14,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1825523118, now seen corresponding path program 1 times [2023-08-04 06:00:14,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:00:14,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179750557] [2023-08-04 06:00:14,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:00:14,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:00:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:00:14,789 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 06:00:14,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:00:14,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179750557] [2023-08-04 06:00:14,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179750557] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:00:14,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011926011] [2023-08-04 06:00:14,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:00:14,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:00:14,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:00:14,793 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 06:00:14,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-04 06:00:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:00:14,880 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 06:00:14,881 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:00:14,898 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 06:00:14,898 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:00:14,916 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 06:00:14,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011926011] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:00:14,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:00:14,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 06:00:14,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794663320] [2023-08-04 06:00:14,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:00:14,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 06:00:14,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:00:14,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 06:00:14,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:00:14,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 221 [2023-08-04 06:00:14,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 103.2) internal successors, (516), 5 states have internal predecessors, (516), 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) [2023-08-04 06:00:14,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:00:14,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 221 [2023-08-04 06:00:14,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:00:15,962 INFO L124 PetriNetUnfolderBase]: 7690/11069 cut-off events. [2023-08-04 06:00:15,962 INFO L125 PetriNetUnfolderBase]: For 1718/1718 co-relation queries the response was YES. [2023-08-04 06:00:15,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24397 conditions, 11069 events. 7690/11069 cut-off events. For 1718/1718 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 64600 event pairs, 3514 based on Foata normal form. 64/9984 useless extension candidates. Maximal degree in co-relation 6417. Up to 7209 conditions per place. [2023-08-04 06:00:16,036 INFO L140 encePairwiseOnDemand]: 217/221 looper letters, 55 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2023-08-04 06:00:16,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 68 transitions, 325 flow [2023-08-04 06:00:16,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:00:16,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:00:16,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 455 transitions. [2023-08-04 06:00:16,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5147058823529411 [2023-08-04 06:00:16,038 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 455 transitions. [2023-08-04 06:00:16,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 455 transitions. [2023-08-04 06:00:16,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:00:16,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 455 transitions. [2023-08-04 06:00:16,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 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) [2023-08-04 06:00:16,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 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) [2023-08-04 06:00:16,041 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 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) [2023-08-04 06:00:16,041 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 139 flow. Second operand 4 states and 455 transitions. [2023-08-04 06:00:16,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 68 transitions, 325 flow [2023-08-04 06:00:16,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 68 transitions, 323 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:00:16,044 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 157 flow [2023-08-04 06:00:16,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2023-08-04 06:00:16,045 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 13 predicate places. [2023-08-04 06:00:16,045 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 157 flow [2023-08-04 06:00:16,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.2) internal successors, (516), 5 states have internal predecessors, (516), 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) [2023-08-04 06:00:16,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:00:16,045 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:00:16,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-04 06:00:16,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:00:16,254 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:00:16,254 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:00:16,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1397473050, now seen corresponding path program 1 times [2023-08-04 06:00:16,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:00:16,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890200749] [2023-08-04 06:00:16,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:00:16,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:00:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:00:16,276 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 06:00:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:00:16,316 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 06:00:16,317 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 06:00:16,317 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 06:00:16,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 06:00:16,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 06:00:16,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 06:00:16,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-04 06:00:16,318 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-04 06:00:16,319 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-04 06:00:16,320 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 06:00:16,320 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 06:00:16,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 06:00:16 BasicIcfg [2023-08-04 06:00:16,407 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 06:00:16,408 INFO L158 Benchmark]: Toolchain (without parser) took 19947.59ms. Allocated memory was 551.6MB in the beginning and 1.4GB in the end (delta: 843.1MB). Free memory was 498.2MB in the beginning and 738.5MB in the end (delta: -240.3MB). Peak memory consumption was 605.2MB. Max. memory is 16.0GB. [2023-08-04 06:00:16,410 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 360.7MB. Free memory is still 309.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 06:00:16,410 INFO L158 Benchmark]: CACSL2BoogieTranslator took 458.49ms. Allocated memory is still 551.6MB. Free memory was 498.2MB in the beginning and 475.5MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-04 06:00:16,410 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.53ms. Allocated memory is still 551.6MB. Free memory was 475.5MB in the beginning and 473.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 06:00:16,410 INFO L158 Benchmark]: Boogie Preprocessor took 32.08ms. Allocated memory is still 551.6MB. Free memory was 473.1MB in the beginning and 471.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 06:00:16,411 INFO L158 Benchmark]: RCFGBuilder took 619.84ms. Allocated memory is still 551.6MB. Free memory was 471.3MB in the beginning and 501.7MB in the end (delta: -30.4MB). Peak memory consumption was 25.1MB. Max. memory is 16.0GB. [2023-08-04 06:00:16,411 INFO L158 Benchmark]: TraceAbstraction took 18784.99ms. Allocated memory was 551.6MB in the beginning and 1.4GB in the end (delta: 843.1MB). Free memory was 501.7MB in the beginning and 738.5MB in the end (delta: -236.8MB). Peak memory consumption was 607.3MB. Max. memory is 16.0GB. [2023-08-04 06:00:16,413 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 360.7MB. Free memory is still 309.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 458.49ms. Allocated memory is still 551.6MB. Free memory was 498.2MB in the beginning and 475.5MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 44.53ms. Allocated memory is still 551.6MB. Free memory was 475.5MB in the beginning and 473.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 32.08ms. Allocated memory is still 551.6MB. Free memory was 473.1MB in the beginning and 471.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 619.84ms. Allocated memory is still 551.6MB. Free memory was 471.3MB in the beginning and 501.7MB in the end (delta: -30.4MB). Peak memory consumption was 25.1MB. Max. memory is 16.0GB. * TraceAbstraction took 18784.99ms. Allocated memory was 551.6MB in the beginning and 1.4GB in the end (delta: 843.1MB). Free memory was 501.7MB in the beginning and 738.5MB in the end (delta: -236.8MB). Peak memory consumption was 607.3MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 105 PlacesBefore, 27 PlacesAfterwards, 104 TransitionsBefore, 23 TransitionsAfterwards, 1472 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 3 ChoiceCompositions, 94 TotalNumberOfCompositions, 3270 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1774, independent: 1656, independent conditional: 0, independent unconditional: 1656, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 824, independent: 788, independent conditional: 0, independent unconditional: 788, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1774, independent: 868, independent conditional: 0, independent unconditional: 868, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 824, unknown conditional: 0, unknown unconditional: 824] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 55, Positive conditional cache size: 0, Positive unconditional cache size: 55, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 82 PlacesBefore, 22 PlacesAfterwards, 78 TransitionsBefore, 17 TransitionsAfterwards, 620 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 23 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 66 TotalNumberOfCompositions, 1347 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 724, independent: 646, independent conditional: 0, independent unconditional: 646, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 323, independent: 314, independent conditional: 0, independent unconditional: 314, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 724, independent: 332, independent conditional: 0, independent unconditional: 332, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 323, unknown conditional: 0, unknown unconditional: 323] , Statistics on independence cache: Total cache size (in pairs): 37, Positive cache size: 32, Positive conditional cache size: 0, Positive unconditional cache size: 32, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 127 PlacesBefore, 46 PlacesAfterwards, 122 TransitionsBefore, 38 TransitionsAfterwards, 3512 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 3 ChoiceCompositions, 98 TotalNumberOfCompositions, 10320 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5312, independent: 5081, independent conditional: 0, independent unconditional: 5081, dependent: 231, dependent conditional: 0, dependent unconditional: 231, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1836, independent: 1786, independent conditional: 0, independent unconditional: 1786, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5312, independent: 3295, independent conditional: 0, independent unconditional: 3295, dependent: 181, dependent conditional: 0, dependent unconditional: 181, unknown: 1836, unknown conditional: 0, unknown unconditional: 1836] , Statistics on independence cache: Total cache size (in pairs): 201, Positive cache size: 182, Positive conditional cache size: 0, Positive unconditional cache size: 182, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L813] 0 pthread_t t903[2]; [L814] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t903={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L814] COND TRUE 0 asdf<2 [L814] FCALL, FORK 0 pthread_create(&t903[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t903[asdf], ((void *)0), P0, ((void *)0))=-3, t903={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L814] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t903={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L814] COND TRUE 0 asdf<2 [L814] FCALL, FORK 0 pthread_create(&t903[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t903[asdf], ((void *)0), P0, ((void *)0))=-2, t903={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L814] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t903={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L814] COND FALSE 0 !(asdf<2) [L815] 0 pthread_t t904[2]; [L816] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t903={5:0}, t904={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L816] COND TRUE 0 asdf<2 [L816] FCALL, FORK 0 pthread_create(&t904[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t904[asdf], ((void *)0), P1, ((void *)0))=-1, t903={5:0}, t904={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L771] 3 x$w_buff1 = x$w_buff0 [L772] 3 x$w_buff0 = 1 [L773] 3 x$w_buff1_used = x$w_buff0_used [L774] 3 x$w_buff0_used = (_Bool)1 [L775] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L775] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 3 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L816] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t903={5:0}, t904={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L816] COND TRUE 0 asdf<2 [L816] FCALL, FORK 0 pthread_create(&t904[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t904[asdf], ((void *)0), P1, ((void *)0))=0, t903={5:0}, t904={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L771] 4 x$w_buff1 = x$w_buff0 [L772] 4 x$w_buff0 = 1 [L773] 4 x$w_buff1_used = x$w_buff0_used [L774] 4 x$w_buff0_used = (_Bool)1 [L775] CALL 4 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND TRUE 4 !expression [L19] 4 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=1, x$w_buff1_used=1, x=0, y=0, z=0] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 120 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: 4.2s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 79 IncrementalHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 2 mSDtfsCounter, 79 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=1, InterpolantAutomatonStates: 7, 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.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 51 SizeOfPredicates, 0 NumberOfNonLiveVariables, 151 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/3 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 138 locations, 6 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: 11.7s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 134 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 93 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 365 IncrementalHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 9 mSDtfsCounter, 365 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=5, InterpolantAutomatonStates: 17, 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.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 101 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 188 SizeOfPredicates, 0 NumberOfNonLiveVariables, 333 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 30/36 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 5 procedures, 120 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: 2.7s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=1, InterpolantAutomatonStates: 3, 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1/1 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! [2023-08-04 06:00:16,443 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...