/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_safe033_tso_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 07:29:05,703 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 07:29:05,742 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 07:29:05,745 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 07:29:05,745 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 07:29:05,746 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 07:29:05,746 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 07:29:05,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 07:29:05,759 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 07:29:05,760 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 07:29:05,760 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 07:29:05,760 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 07:29:05,761 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 07:29:05,761 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 07:29:05,761 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 07:29:05,761 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 07:29:05,761 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 07:29:05,762 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 07:29:05,762 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 07:29:05,762 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 07:29:05,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 07:29:05,763 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 07:29:05,763 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 07:29:05,763 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 07:29:05,763 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 07:29:05,763 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 07:29:05,764 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 07:29:05,764 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 07:29:05,764 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 07:29:05,764 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 07:29:05,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 07:29:05,765 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 07:29:05,765 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 07:29:05,765 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 07:29:05,765 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 07:29:05,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 07:29:05,765 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 07:29:05,766 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 07:29:05,766 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 07:29:05,766 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 07:29:05,766 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 07:29:05,767 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 07:29:05,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 07:29:05,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 07:29:05,961 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 07:29:05,962 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 07:29:05,962 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 07:29:05,963 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe033_tso_bound2.i [2023-08-04 07:29:07,057 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 07:29:07,195 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 07:29:07,195 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe033_tso_bound2.i [2023-08-04 07:29:07,205 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fbcde449/5cb30426630c4b8e8bd441962accd647/FLAGd6e078043 [2023-08-04 07:29:07,217 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fbcde449/5cb30426630c4b8e8bd441962accd647 [2023-08-04 07:29:07,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 07:29:07,222 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 07:29:07,223 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 07:29:07,223 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 07:29:07,225 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 07:29:07,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 07:29:07" (1/1) ... [2023-08-04 07:29:07,226 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24b88aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:29:07, skipping insertion in model container [2023-08-04 07:29:07,226 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 07:29:07" (1/1) ... [2023-08-04 07:29:07,262 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 07:29:07,355 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_safe033_tso_bound2.i[945,958] [2023-08-04 07:29:07,437 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 07:29:07,443 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 07:29:07,450 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_safe033_tso_bound2.i[945,958] [2023-08-04 07:29:07,456 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 07:29:07,457 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 07:29:07,469 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 07:29:07,488 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 07:29:07,488 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 07:29:07,493 INFO L206 MainTranslator]: Completed translation [2023-08-04 07:29:07,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:29:07 WrapperNode [2023-08-04 07:29:07,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 07:29:07,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 07:29:07,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 07:29:07,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 07:29:07,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:29:07" (1/1) ... [2023-08-04 07:29:07,512 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:29:07" (1/1) ... [2023-08-04 07:29:07,527 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2023-08-04 07:29:07,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 07:29:07,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 07:29:07,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 07:29:07,529 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 07:29:07,536 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:29:07" (1/1) ... [2023-08-04 07:29:07,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:29:07" (1/1) ... [2023-08-04 07:29:07,538 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:29:07" (1/1) ... [2023-08-04 07:29:07,538 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:29:07" (1/1) ... [2023-08-04 07:29:07,541 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:29:07" (1/1) ... [2023-08-04 07:29:07,544 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:29:07" (1/1) ... [2023-08-04 07:29:07,544 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:29:07" (1/1) ... [2023-08-04 07:29:07,545 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:29:07" (1/1) ... [2023-08-04 07:29:07,547 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 07:29:07,547 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 07:29:07,547 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 07:29:07,547 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 07:29:07,548 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:29:07" (1/1) ... [2023-08-04 07:29:07,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 07:29:07,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:29:07,589 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 07:29:07,604 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 07:29:07,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 07:29:07,614 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 07:29:07,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 07:29:07,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 07:29:07,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 07:29:07,615 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 07:29:07,615 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 07:29:07,616 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 07:29:07,616 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 07:29:07,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 07:29:07,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 07:29:07,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 07:29:07,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 07:29:07,617 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 07:29:07,710 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 07:29:07,713 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 07:29:07,844 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 07:29:07,848 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 07:29:07,848 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-04 07:29:07,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 07:29:07 BoogieIcfgContainer [2023-08-04 07:29:07,854 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 07:29:07,856 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 07:29:07,856 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 07:29:07,858 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 07:29:07,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 07:29:07" (1/3) ... [2023-08-04 07:29:07,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47dd16a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 07:29:07, skipping insertion in model container [2023-08-04 07:29:07,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:29:07" (2/3) ... [2023-08-04 07:29:07,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47dd16a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 07:29:07, skipping insertion in model container [2023-08-04 07:29:07,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 07:29:07" (3/3) ... [2023-08-04 07:29:07,859 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_safe033_tso_bound2.i [2023-08-04 07:29:07,867 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 07:29:07,873 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 07:29:07,873 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 07:29:07,873 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 07:29:07,908 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 07:29:07,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 81 transitions, 172 flow [2023-08-04 07:29:07,974 INFO L124 PetriNetUnfolderBase]: 14/192 cut-off events. [2023-08-04 07:29:07,974 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:29:07,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 192 events. 14/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 560 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 109. Up to 8 conditions per place. [2023-08-04 07:29:07,978 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 81 transitions, 172 flow [2023-08-04 07:29:07,981 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 69 transitions, 144 flow [2023-08-04 07:29:07,983 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 07:29:07,989 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 69 transitions, 144 flow [2023-08-04 07:29:07,991 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 69 transitions, 144 flow [2023-08-04 07:29:07,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 69 transitions, 144 flow [2023-08-04 07:29:08,019 INFO L124 PetriNetUnfolderBase]: 10/149 cut-off events. [2023-08-04 07:29:08,019 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:29:08,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 149 events. 10/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 370 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 87. Up to 8 conditions per place. [2023-08-04 07:29:08,021 INFO L119 LiptonReduction]: Number of co-enabled transitions 840 [2023-08-04 07:29:09,239 INFO L134 LiptonReduction]: Checked pairs total: 1574 [2023-08-04 07:29:09,239 INFO L136 LiptonReduction]: Total number of compositions: 61 [2023-08-04 07:29:09,249 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 07:29:09,253 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;@2b8a8c67, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 07:29:09,253 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 07:29:09,255 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 07:29:09,255 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-08-04 07:29:09,255 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:29:09,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:29:09,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-04 07:29:09,256 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:29:09,259 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:29:09,259 INFO L85 PathProgramCache]: Analyzing trace with hash 9035768, now seen corresponding path program 1 times [2023-08-04 07:29:09,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:29:09,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864756817] [2023-08-04 07:29:09,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:29:09,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:29:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:29:09,414 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 07:29:09,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:29:09,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864756817] [2023-08-04 07:29:09,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864756817] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:29:09,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:29:09,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:29:09,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118661320] [2023-08-04 07:29:09,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:29:09,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:29:09,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:29:09,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:29:09,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:29:09,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 142 [2023-08-04 07:29:09,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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 07:29:09,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:29:09,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 142 [2023-08-04 07:29:09,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:29:09,525 INFO L124 PetriNetUnfolderBase]: 66/150 cut-off events. [2023-08-04 07:29:09,525 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-04 07:29:09,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 150 events. 66/150 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 542 event pairs, 44 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 284. Up to 130 conditions per place. [2023-08-04 07:29:09,527 INFO L140 encePairwiseOnDemand]: 138/142 looper letters, 14 selfloop transitions, 2 changer transitions 1/19 dead transitions. [2023-08-04 07:29:09,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 19 transitions, 78 flow [2023-08-04 07:29:09,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:29:09,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:29:09,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2023-08-04 07:29:09,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5375586854460094 [2023-08-04 07:29:09,544 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 229 transitions. [2023-08-04 07:29:09,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 229 transitions. [2023-08-04 07:29:09,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:29:09,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 229 transitions. [2023-08-04 07:29:09,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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 07:29:09,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 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 07:29:09,553 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 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 07:29:09,554 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 40 flow. Second operand 3 states and 229 transitions. [2023-08-04 07:29:09,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 19 transitions, 78 flow [2023-08-04 07:29:09,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 19 transitions, 78 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 07:29:09,557 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 46 flow [2023-08-04 07:29:09,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=46, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2023-08-04 07:29:09,560 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2023-08-04 07:29:09,560 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 46 flow [2023-08-04 07:29:09,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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 07:29:09,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:29:09,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:29:09,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 07:29:09,561 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:29:09,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:29:09,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1216432428, now seen corresponding path program 1 times [2023-08-04 07:29:09,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:29:09,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545710240] [2023-08-04 07:29:09,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:29:09,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:29:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:29:09,638 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 07:29:09,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:29:09,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545710240] [2023-08-04 07:29:09,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545710240] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:29:09,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470716609] [2023-08-04 07:29:09,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:29:09,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:29:09,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:29:09,642 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 07:29:09,664 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 07:29:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:29:09,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 07:29:09,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:29:09,729 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 07:29:09,729 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 07:29:09,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470716609] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:29:09,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 07:29:09,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 07:29:09,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177945092] [2023-08-04 07:29:09,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:29:09,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:29:09,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:29:09,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:29:09,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:29:09,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 142 [2023-08-04 07:29:09,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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 07:29:09,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:29:09,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 142 [2023-08-04 07:29:09,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:29:09,795 INFO L124 PetriNetUnfolderBase]: 62/130 cut-off events. [2023-08-04 07:29:09,795 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-04 07:29:09,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 130 events. 62/130 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 426 event pairs, 37 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 263. Up to 100 conditions per place. [2023-08-04 07:29:09,798 INFO L140 encePairwiseOnDemand]: 139/142 looper letters, 16 selfloop transitions, 2 changer transitions 1/21 dead transitions. [2023-08-04 07:29:09,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 21 transitions, 94 flow [2023-08-04 07:29:09,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:29:09,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:29:09,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2023-08-04 07:29:09,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.539906103286385 [2023-08-04 07:29:09,808 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 230 transitions. [2023-08-04 07:29:09,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 230 transitions. [2023-08-04 07:29:09,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:29:09,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 230 transitions. [2023-08-04 07:29:09,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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 07:29:09,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 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 07:29:09,812 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 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 07:29:09,812 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 46 flow. Second operand 3 states and 230 transitions. [2023-08-04 07:29:09,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 21 transitions, 94 flow [2023-08-04 07:29:09,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 21 transitions, 90 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 07:29:09,814 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 50 flow [2023-08-04 07:29:09,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2023-08-04 07:29:09,815 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 4 predicate places. [2023-08-04 07:29:09,815 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 50 flow [2023-08-04 07:29:09,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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 07:29:09,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:29:09,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:29:09,831 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 07:29:10,019 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 07:29:10,020 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:29:10,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:29:10,022 INFO L85 PathProgramCache]: Analyzing trace with hash -2096273071, now seen corresponding path program 1 times [2023-08-04 07:29:10,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:29:10,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2561970] [2023-08-04 07:29:10,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:29:10,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:29:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:29:10,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 07:29:10,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:29:10,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2561970] [2023-08-04 07:29:10,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2561970] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:29:10,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878295441] [2023-08-04 07:29:10,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:29:10,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:29:10,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:29:10,130 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 07:29:10,132 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 07:29:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:29:10,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 07:29:10,193 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:29:10,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 07:29:10,213 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:29:10,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 07:29:10,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878295441] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:29:10,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:29:10,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 07:29:10,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471401195] [2023-08-04 07:29:10,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:29:10,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 07:29:10,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:29:10,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 07:29:10,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:29:10,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 142 [2023-08-04 07:29:10,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 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 07:29:10,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:29:10,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 142 [2023-08-04 07:29:10,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:29:10,249 INFO L124 PetriNetUnfolderBase]: 4/16 cut-off events. [2023-08-04 07:29:10,249 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-04 07:29:10,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 16 events. 4/16 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 3/19 useless extension candidates. Maximal degree in co-relation 36. Up to 10 conditions per place. [2023-08-04 07:29:10,250 INFO L140 encePairwiseOnDemand]: 139/142 looper letters, 0 selfloop transitions, 0 changer transitions 10/10 dead transitions. [2023-08-04 07:29:10,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 10 transitions, 43 flow [2023-08-04 07:29:10,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:29:10,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:29:10,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 286 transitions. [2023-08-04 07:29:10,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035211267605634 [2023-08-04 07:29:10,251 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 286 transitions. [2023-08-04 07:29:10,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 286 transitions. [2023-08-04 07:29:10,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:29:10,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 286 transitions. [2023-08-04 07:29:10,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 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 07:29:10,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 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 07:29:10,254 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 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 07:29:10,254 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 50 flow. Second operand 4 states and 286 transitions. [2023-08-04 07:29:10,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 10 transitions, 43 flow [2023-08-04 07:29:10,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 10 transitions, 41 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:29:10,254 INFO L231 Difference]: Finished difference. Result has 16 places, 0 transitions, 0 flow [2023-08-04 07:29:10,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=17, PETRI_DIFFERENCE_MINUEND_PLACES=13, 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=16, PETRI_TRANSITIONS=0} [2023-08-04 07:29:10,255 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, -5 predicate places. [2023-08-04 07:29:10,255 INFO L495 AbstractCegarLoop]: Abstraction has has 16 places, 0 transitions, 0 flow [2023-08-04 07:29:10,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 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 07:29:10,258 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 07:29:10,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-04 07:29:10,463 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,SelfDestructingSolverStorable2 [2023-08-04 07:29:10,463 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-08-04 07:29:10,465 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2023-08-04 07:29:10,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 81 transitions, 172 flow [2023-08-04 07:29:10,484 INFO L124 PetriNetUnfolderBase]: 14/192 cut-off events. [2023-08-04 07:29:10,484 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:29:10,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 192 events. 14/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 560 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 109. Up to 8 conditions per place. [2023-08-04 07:29:10,486 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 81 transitions, 172 flow [2023-08-04 07:29:10,486 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 55 transitions, 120 flow [2023-08-04 07:29:10,486 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 07:29:10,487 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 55 transitions, 120 flow [2023-08-04 07:29:10,487 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 55 transitions, 120 flow [2023-08-04 07:29:10,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 55 transitions, 120 flow [2023-08-04 07:29:10,493 INFO L124 PetriNetUnfolderBase]: 2/88 cut-off events. [2023-08-04 07:29:10,493 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:29:10,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 133 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 57. Up to 4 conditions per place. [2023-08-04 07:29:10,493 INFO L119 LiptonReduction]: Number of co-enabled transitions 492 [2023-08-04 07:29:11,521 INFO L134 LiptonReduction]: Checked pairs total: 991 [2023-08-04 07:29:11,521 INFO L136 LiptonReduction]: Total number of compositions: 44 [2023-08-04 07:29:11,522 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 07:29:11,523 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;@2b8a8c67, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 07:29:11,523 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 07:29:11,525 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 07:29:11,525 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2023-08-04 07:29:11,525 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:29:11,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:29:11,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 07:29:11,525 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 07:29:11,525 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:29:11,525 INFO L85 PathProgramCache]: Analyzing trace with hash 322362752, now seen corresponding path program 1 times [2023-08-04 07:29:11,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:29:11,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595044915] [2023-08-04 07:29:11,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:29:11,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:29:11,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:29:11,569 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 07:29:11,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:29:11,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595044915] [2023-08-04 07:29:11,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595044915] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:29:11,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:29:11,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:29:11,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84231358] [2023-08-04 07:29:11,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:29:11,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:29:11,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:29:11,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:29:11,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:29:11,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 125 [2023-08-04 07:29:11,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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 07:29:11,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:29:11,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 125 [2023-08-04 07:29:11,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:29:11,604 INFO L124 PetriNetUnfolderBase]: 24/68 cut-off events. [2023-08-04 07:29:11,604 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-04 07:29:11,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 68 events. 24/68 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 205 event pairs, 14 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 125. Up to 52 conditions per place. [2023-08-04 07:29:11,606 INFO L140 encePairwiseOnDemand]: 122/125 looper letters, 12 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2023-08-04 07:29:11,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 18 transitions, 74 flow [2023-08-04 07:29:11,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:29:11,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:29:11,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2023-08-04 07:29:11,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2023-08-04 07:29:11,608 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 225 transitions. [2023-08-04 07:29:11,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 225 transitions. [2023-08-04 07:29:11,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:29:11,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 225 transitions. [2023-08-04 07:29:11,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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 07:29:11,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 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 07:29:11,609 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 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 07:29:11,609 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 40 flow. Second operand 3 states and 225 transitions. [2023-08-04 07:29:11,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 18 transitions, 74 flow [2023-08-04 07:29:11,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 18 transitions, 74 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 07:29:11,611 INFO L231 Difference]: Finished difference. Result has 23 places, 15 transitions, 48 flow [2023-08-04 07:29:11,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2023-08-04 07:29:11,612 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places. [2023-08-04 07:29:11,613 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 48 flow [2023-08-04 07:29:11,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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 07:29:11,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:29:11,613 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 07:29:11,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-04 07:29:11,613 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 07:29:11,614 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:29:11,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1398753116, now seen corresponding path program 1 times [2023-08-04 07:29:11,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:29:11,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527125563] [2023-08-04 07:29:11,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:29:11,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:29:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:29:11,625 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 07:29:11,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:29:11,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 07:29:11,653 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 07:29:11,653 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 07:29:11,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 07:29:11,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-04 07:29:11,653 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 07:29:11,654 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (2/2) [2023-08-04 07:29:11,654 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 07:29:11,654 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 07:29:11,681 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 07:29:11,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 95 transitions, 214 flow [2023-08-04 07:29:11,721 INFO L124 PetriNetUnfolderBase]: 30/411 cut-off events. [2023-08-04 07:29:11,721 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 07:29:11,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 411 events. 30/411 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1720 event pairs, 0 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 295. Up to 18 conditions per place. [2023-08-04 07:29:11,723 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 95 transitions, 214 flow [2023-08-04 07:29:11,724 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 83 transitions, 182 flow [2023-08-04 07:29:11,724 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 07:29:11,724 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 83 transitions, 182 flow [2023-08-04 07:29:11,724 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 83 transitions, 182 flow [2023-08-04 07:29:11,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 83 transitions, 182 flow [2023-08-04 07:29:11,756 INFO L124 PetriNetUnfolderBase]: 21/317 cut-off events. [2023-08-04 07:29:11,756 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-04 07:29:11,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 317 events. 21/317 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1160 event pairs, 0 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 232. Up to 18 conditions per place. [2023-08-04 07:29:11,760 INFO L119 LiptonReduction]: Number of co-enabled transitions 2016 [2023-08-04 07:29:12,988 INFO L134 LiptonReduction]: Checked pairs total: 4286 [2023-08-04 07:29:12,988 INFO L136 LiptonReduction]: Total number of compositions: 65 [2023-08-04 07:29:12,991 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 07:29:12,991 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;@2b8a8c67, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 07:29:12,992 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 07:29:12,993 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 07:29:12,993 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-08-04 07:29:12,993 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:29:12,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:29:12,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-04 07:29:12,993 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:29:12,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:29:12,994 INFO L85 PathProgramCache]: Analyzing trace with hash 15747549, now seen corresponding path program 1 times [2023-08-04 07:29:12,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:29:12,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39332790] [2023-08-04 07:29:12,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:29:12,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:29:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:29:13,049 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 07:29:13,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:29:13,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39332790] [2023-08-04 07:29:13,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39332790] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:29:13,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:29:13,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:29:13,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775515067] [2023-08-04 07:29:13,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:29:13,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:29:13,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:29:13,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:29:13,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:29:13,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 160 [2023-08-04 07:29:13,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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 07:29:13,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:29:13,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 160 [2023-08-04 07:29:13,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:29:13,277 INFO L124 PetriNetUnfolderBase]: 1674/2791 cut-off events. [2023-08-04 07:29:13,277 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2023-08-04 07:29:13,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5420 conditions, 2791 events. 1674/2791 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 16290 event pairs, 1140 based on Foata normal form. 0/2605 useless extension candidates. Maximal degree in co-relation 1551. Up to 2476 conditions per place. [2023-08-04 07:29:13,293 INFO L140 encePairwiseOnDemand]: 156/160 looper letters, 22 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2023-08-04 07:29:13,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 30 transitions, 124 flow [2023-08-04 07:29:13,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:29:13,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:29:13,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions. [2023-08-04 07:29:13,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2023-08-04 07:29:13,294 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 272 transitions. [2023-08-04 07:29:13,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 272 transitions. [2023-08-04 07:29:13,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:29:13,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 272 transitions. [2023-08-04 07:29:13,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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 07:29:13,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 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 07:29:13,297 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 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 07:29:13,297 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 70 flow. Second operand 3 states and 272 transitions. [2023-08-04 07:29:13,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 30 transitions, 124 flow [2023-08-04 07:29:13,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 30 transitions, 124 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 07:29:13,299 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 80 flow [2023-08-04 07:29:13,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2023-08-04 07:29:13,301 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2023-08-04 07:29:13,302 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 80 flow [2023-08-04 07:29:13,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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 07:29:13,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:29:13,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:29:13,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 07:29:13,303 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:29:13,304 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:29:13,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1491189576, now seen corresponding path program 1 times [2023-08-04 07:29:13,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:29:13,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764506112] [2023-08-04 07:29:13,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:29:13,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:29:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:29:13,358 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 07:29:13,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:29:13,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764506112] [2023-08-04 07:29:13,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764506112] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:29:13,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896545905] [2023-08-04 07:29:13,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:29:13,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:29:13,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:29:13,377 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 07:29:13,379 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 07:29:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:29:13,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 07:29:13,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:29:13,427 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 07:29:13,428 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 07:29:13,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896545905] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:29:13,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 07:29:13,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 07:29:13,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211886752] [2023-08-04 07:29:13,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:29:13,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:29:13,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:29:13,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:29:13,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:29:13,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 160 [2023-08-04 07:29:13,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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 07:29:13,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:29:13,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 160 [2023-08-04 07:29:13,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:29:13,585 INFO L124 PetriNetUnfolderBase]: 1646/2693 cut-off events. [2023-08-04 07:29:13,585 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2023-08-04 07:29:13,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5300 conditions, 2693 events. 1646/2693 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 15473 event pairs, 1120 based on Foata normal form. 0/2537 useless extension candidates. Maximal degree in co-relation 5265. Up to 2299 conditions per place. [2023-08-04 07:29:13,595 INFO L140 encePairwiseOnDemand]: 157/160 looper letters, 27 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-08-04 07:29:13,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 154 flow [2023-08-04 07:29:13,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:29:13,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:29:13,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2023-08-04 07:29:13,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5729166666666666 [2023-08-04 07:29:13,597 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 275 transitions. [2023-08-04 07:29:13,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 275 transitions. [2023-08-04 07:29:13,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:29:13,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 275 transitions. [2023-08-04 07:29:13,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 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 07:29:13,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 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 07:29:13,598 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 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 07:29:13,599 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 80 flow. Second operand 3 states and 275 transitions. [2023-08-04 07:29:13,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 154 flow [2023-08-04 07:29:13,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 152 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:29:13,600 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 90 flow [2023-08-04 07:29:13,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-08-04 07:29:13,600 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2023-08-04 07:29:13,600 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 90 flow [2023-08-04 07:29:13,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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 07:29:13,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:29:13,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:29:13,607 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 07:29:13,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:29:13,805 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:29:13,806 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:29:13,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1950261048, now seen corresponding path program 1 times [2023-08-04 07:29:13,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:29:13,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164617331] [2023-08-04 07:29:13,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:29:13,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:29:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:29:13,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 07:29:13,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:29:13,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164617331] [2023-08-04 07:29:13,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164617331] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:29:13,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035375251] [2023-08-04 07:29:13,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:29:13,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:29:13,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:29:13,834 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 07:29:13,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-04 07:29:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:29:13,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 07:29:13,885 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:29:13,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 07:29:13,902 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:29:13,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 07:29:13,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035375251] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:29:13,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:29:13,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 07:29:13,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16742660] [2023-08-04 07:29:13,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:29:13,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 07:29:13,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:29:13,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 07:29:13,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:29:13,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 160 [2023-08-04 07:29:13,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 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 07:29:13,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:29:13,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 160 [2023-08-04 07:29:13,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:29:14,081 INFO L124 PetriNetUnfolderBase]: 1336/2141 cut-off events. [2023-08-04 07:29:14,082 INFO L125 PetriNetUnfolderBase]: For 270/270 co-relation queries the response was YES. [2023-08-04 07:29:14,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4466 conditions, 2141 events. 1336/2141 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 11347 event pairs, 564 based on Foata normal form. 3/2135 useless extension candidates. Maximal degree in co-relation 1599. Up to 1882 conditions per place. [2023-08-04 07:29:14,089 INFO L140 encePairwiseOnDemand]: 156/160 looper letters, 26 selfloop transitions, 3 changer transitions 1/36 dead transitions. [2023-08-04 07:29:14,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 36 transitions, 166 flow [2023-08-04 07:29:14,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:29:14,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:29:14,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 354 transitions. [2023-08-04 07:29:14,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.553125 [2023-08-04 07:29:14,091 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 354 transitions. [2023-08-04 07:29:14,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 354 transitions. [2023-08-04 07:29:14,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:29:14,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 354 transitions. [2023-08-04 07:29:14,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 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 07:29:14,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 160.0) internal successors, (800), 5 states have internal predecessors, (800), 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 07:29:14,093 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 160.0) internal successors, (800), 5 states have internal predecessors, (800), 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 07:29:14,093 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 90 flow. Second operand 4 states and 354 transitions. [2023-08-04 07:29:14,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 36 transitions, 166 flow [2023-08-04 07:29:14,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 36 transitions, 164 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:29:14,094 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 102 flow [2023-08-04 07:29:14,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2023-08-04 07:29:14,095 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 9 predicate places. [2023-08-04 07:29:14,095 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 102 flow [2023-08-04 07:29:14,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 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 07:29:14,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:29:14,095 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:29:14,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-04 07:29:14,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:29:14,300 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:29:14,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:29:14,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1773032366, now seen corresponding path program 1 times [2023-08-04 07:29:14,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:29:14,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847807693] [2023-08-04 07:29:14,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:29:14,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:29:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:29:14,357 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 07:29:14,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:29:14,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847807693] [2023-08-04 07:29:14,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847807693] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:29:14,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447284379] [2023-08-04 07:29:14,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:29:14,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:29:14,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:29:14,380 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 07:29:14,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-04 07:29:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:29:14,444 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 07:29:14,445 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:29:14,462 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 07:29:14,462 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:29:14,488 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 07:29:14,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447284379] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:29:14,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:29:14,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 07:29:14,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903608671] [2023-08-04 07:29:14,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:29:14,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 07:29:14,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:29:14,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 07:29:14,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:29:14,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 160 [2023-08-04 07:29:14,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 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 07:29:14,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:29:14,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 160 [2023-08-04 07:29:14,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:29:14,629 INFO L124 PetriNetUnfolderBase]: 1216/1861 cut-off events. [2023-08-04 07:29:14,630 INFO L125 PetriNetUnfolderBase]: For 252/252 co-relation queries the response was YES. [2023-08-04 07:29:14,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3986 conditions, 1861 events. 1216/1861 cut-off events. For 252/252 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9145 event pairs, 400 based on Foata normal form. 27/1879 useless extension candidates. Maximal degree in co-relation 1421. Up to 943 conditions per place. [2023-08-04 07:29:14,638 INFO L140 encePairwiseOnDemand]: 156/160 looper letters, 34 selfloop transitions, 3 changer transitions 1/44 dead transitions. [2023-08-04 07:29:14,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 44 transitions, 210 flow [2023-08-04 07:29:14,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:29:14,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:29:14,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 362 transitions. [2023-08-04 07:29:14,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.565625 [2023-08-04 07:29:14,639 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 362 transitions. [2023-08-04 07:29:14,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 362 transitions. [2023-08-04 07:29:14,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:29:14,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 362 transitions. [2023-08-04 07:29:14,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 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 07:29:14,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 160.0) internal successors, (800), 5 states have internal predecessors, (800), 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 07:29:14,643 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 160.0) internal successors, (800), 5 states have internal predecessors, (800), 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 07:29:14,643 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 102 flow. Second operand 4 states and 362 transitions. [2023-08-04 07:29:14,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 44 transitions, 210 flow [2023-08-04 07:29:14,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 203 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 07:29:14,646 INFO L231 Difference]: Finished difference. Result has 46 places, 28 transitions, 109 flow [2023-08-04 07:29:14,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=46, PETRI_TRANSITIONS=28} [2023-08-04 07:29:14,648 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places. [2023-08-04 07:29:14,648 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 28 transitions, 109 flow [2023-08-04 07:29:14,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 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 07:29:14,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:29:14,648 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:29:14,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-04 07:29:14,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:29:14,853 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:29:14,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:29:14,854 INFO L85 PathProgramCache]: Analyzing trace with hash -2045915053, now seen corresponding path program 1 times [2023-08-04 07:29:14,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:29:14,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054604965] [2023-08-04 07:29:14,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:29:14,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:29:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:29:14,965 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 07:29:14,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:29:14,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054604965] [2023-08-04 07:29:14,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054604965] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:29:14,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:29:14,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 07:29:14,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304511709] [2023-08-04 07:29:14,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:29:14,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:29:14,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:29:14,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:29:14,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:29:14,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 160 [2023-08-04 07:29:14,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 28 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:29:14,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:29:14,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 160 [2023-08-04 07:29:14,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:29:15,431 INFO L124 PetriNetUnfolderBase]: 5131/7256 cut-off events. [2023-08-04 07:29:15,432 INFO L125 PetriNetUnfolderBase]: For 5008/5008 co-relation queries the response was YES. [2023-08-04 07:29:15,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17402 conditions, 7256 events. 5131/7256 cut-off events. For 5008/5008 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 37799 event pairs, 1846 based on Foata normal form. 196/7446 useless extension candidates. Maximal degree in co-relation 17314. Up to 4673 conditions per place. [2023-08-04 07:29:15,460 INFO L140 encePairwiseOnDemand]: 152/160 looper letters, 42 selfloop transitions, 7 changer transitions 0/51 dead transitions. [2023-08-04 07:29:15,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 51 transitions, 300 flow [2023-08-04 07:29:15,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:29:15,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:29:15,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2023-08-04 07:29:15,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2023-08-04 07:29:15,474 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 280 transitions. [2023-08-04 07:29:15,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 280 transitions. [2023-08-04 07:29:15,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:29:15,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 280 transitions. [2023-08-04 07:29:15,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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 07:29:15,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 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 07:29:15,476 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 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 07:29:15,476 INFO L175 Difference]: Start difference. First operand has 46 places, 28 transitions, 109 flow. Second operand 3 states and 280 transitions. [2023-08-04 07:29:15,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 51 transitions, 300 flow [2023-08-04 07:29:15,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 51 transitions, 286 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-04 07:29:15,488 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 156 flow [2023-08-04 07:29:15,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2023-08-04 07:29:15,489 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2023-08-04 07:29:15,489 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 156 flow [2023-08-04 07:29:15,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:29:15,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:29:15,490 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:29:15,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-04 07:29:15,490 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:29:15,490 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:29:15,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1001141974, now seen corresponding path program 1 times [2023-08-04 07:29:15,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:29:15,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155412784] [2023-08-04 07:29:15,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:29:15,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:29:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:29:15,595 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 07:29:15,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:29:15,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155412784] [2023-08-04 07:29:15,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155412784] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:29:15,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:29:15,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:29:15,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142658810] [2023-08-04 07:29:15,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:29:15,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:29:15,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:29:15,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:29:15,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:29:15,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 160 [2023-08-04 07:29:15,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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 07:29:15,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:29:15,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 160 [2023-08-04 07:29:15,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:29:15,903 INFO L124 PetriNetUnfolderBase]: 2711/4158 cut-off events. [2023-08-04 07:29:15,903 INFO L125 PetriNetUnfolderBase]: For 3530/3546 co-relation queries the response was YES. [2023-08-04 07:29:15,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11123 conditions, 4158 events. 2711/4158 cut-off events. For 3530/3546 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 23615 event pairs, 685 based on Foata normal form. 43/3834 useless extension candidates. Maximal degree in co-relation 6265. Up to 3208 conditions per place. [2023-08-04 07:29:15,940 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 39 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2023-08-04 07:29:15,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 54 transitions, 332 flow [2023-08-04 07:29:15,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:29:15,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:29:15,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2023-08-04 07:29:15,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2023-08-04 07:29:15,942 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 280 transitions. [2023-08-04 07:29:15,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 280 transitions. [2023-08-04 07:29:15,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:29:15,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 280 transitions. [2023-08-04 07:29:15,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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 07:29:15,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 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 07:29:15,945 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 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 07:29:15,945 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 156 flow. Second operand 3 states and 280 transitions. [2023-08-04 07:29:15,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 54 transitions, 332 flow [2023-08-04 07:29:15,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 54 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 07:29:15,953 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 175 flow [2023-08-04 07:29:15,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=175, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-08-04 07:29:15,954 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 13 predicate places. [2023-08-04 07:29:15,954 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 175 flow [2023-08-04 07:29:15,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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 07:29:15,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:29:15,954 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:29:15,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-04 07:29:15,955 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:29:15,955 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:29:15,955 INFO L85 PathProgramCache]: Analyzing trace with hash 192801068, now seen corresponding path program 1 times [2023-08-04 07:29:15,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:29:15,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701916231] [2023-08-04 07:29:15,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:29:15,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:29:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:29:16,081 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 07:29:16,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:29:16,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701916231] [2023-08-04 07:29:16,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701916231] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:29:16,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125857230] [2023-08-04 07:29:16,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:29:16,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:29:16,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:29:16,083 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 07:29:16,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-04 07:29:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:29:16,185 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 23 conjunts are in the unsatisfiable core [2023-08-04 07:29:16,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:29:16,319 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 07:29:16,320 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:29:16,475 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 07:29:16,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125857230] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:29:16,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:29:16,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 12 [2023-08-04 07:29:16,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070452546] [2023-08-04 07:29:16,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:29:16,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-04 07:29:16,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:29:16,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-04 07:29:16,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-08-04 07:29:16,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 160 [2023-08-04 07:29:16,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 175 flow. Second operand has 13 states, 13 states have (on average 73.53846153846153) internal successors, (956), 13 states have internal predecessors, (956), 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 07:29:16,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:29:16,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 160 [2023-08-04 07:29:16,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:29:17,354 INFO L124 PetriNetUnfolderBase]: 5665/8362 cut-off events. [2023-08-04 07:29:17,354 INFO L125 PetriNetUnfolderBase]: For 9500/9500 co-relation queries the response was YES. [2023-08-04 07:29:17,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26017 conditions, 8362 events. 5665/8362 cut-off events. For 9500/9500 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 48764 event pairs, 59 based on Foata normal form. 519/8879 useless extension candidates. Maximal degree in co-relation 25914. Up to 2988 conditions per place. [2023-08-04 07:29:17,394 INFO L140 encePairwiseOnDemand]: 145/160 looper letters, 188 selfloop transitions, 188 changer transitions 17/395 dead transitions. [2023-08-04 07:29:17,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 395 transitions, 2499 flow [2023-08-04 07:29:17,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-04 07:29:17,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-04 07:29:17,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2192 transitions. [2023-08-04 07:29:17,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5269230769230769 [2023-08-04 07:29:17,399 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2192 transitions. [2023-08-04 07:29:17,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2192 transitions. [2023-08-04 07:29:17,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:29:17,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2192 transitions. [2023-08-04 07:29:17,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 84.3076923076923) internal successors, (2192), 26 states have internal predecessors, (2192), 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 07:29:17,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 160.0) internal successors, (4320), 27 states have internal predecessors, (4320), 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 07:29:17,499 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 160.0) internal successors, (4320), 27 states have internal predecessors, (4320), 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 07:29:17,499 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 175 flow. Second operand 26 states and 2192 transitions. [2023-08-04 07:29:17,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 395 transitions, 2499 flow [2023-08-04 07:29:17,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 395 transitions, 2486 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:29:17,509 INFO L231 Difference]: Finished difference. Result has 88 places, 245 transitions, 1692 flow [2023-08-04 07:29:17,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1692, PETRI_PLACES=88, PETRI_TRANSITIONS=245} [2023-08-04 07:29:17,510 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 53 predicate places. [2023-08-04 07:29:17,510 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 245 transitions, 1692 flow [2023-08-04 07:29:17,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 73.53846153846153) internal successors, (956), 13 states have internal predecessors, (956), 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 07:29:17,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:29:17,511 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:29:17,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-04 07:29:17,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:29:17,716 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:29:17,716 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:29:17,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1356952841, now seen corresponding path program 1 times [2023-08-04 07:29:17,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:29:17,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427032994] [2023-08-04 07:29:17,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:29:17,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:29:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:29:17,733 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 07:29:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:29:17,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 07:29:17,749 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 07:29:17,749 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 07:29:17,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-04 07:29:17,749 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:29:17,749 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE (1/2) [2023-08-04 07:29:17,751 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 07:29:17,751 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 07:29:17,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 07:29:17 BasicIcfg [2023-08-04 07:29:17,804 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 07:29:17,804 INFO L158 Benchmark]: Toolchain (without parser) took 10582.25ms. Allocated memory was 400.6MB in the beginning and 744.5MB in the end (delta: 343.9MB). Free memory was 355.5MB in the beginning and 644.4MB in the end (delta: -289.0MB). Peak memory consumption was 57.4MB. Max. memory is 16.0GB. [2023-08-04 07:29:17,804 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 400.6MB. Free memory was 347.4MB in the beginning and 347.2MB in the end (delta: 226.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 07:29:17,804 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.64ms. Allocated memory is still 400.6MB. Free memory was 354.7MB in the beginning and 334.8MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-04 07:29:17,805 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.12ms. Allocated memory is still 400.6MB. Free memory was 334.8MB in the beginning and 332.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 07:29:17,805 INFO L158 Benchmark]: Boogie Preprocessor took 18.44ms. Allocated memory is still 400.6MB. Free memory was 332.7MB in the beginning and 330.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 07:29:17,805 INFO L158 Benchmark]: RCFGBuilder took 307.06ms. Allocated memory is still 400.6MB. Free memory was 330.6MB in the beginning and 315.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-08-04 07:29:17,805 INFO L158 Benchmark]: TraceAbstraction took 9948.05ms. Allocated memory was 400.6MB in the beginning and 744.5MB in the end (delta: 343.9MB). Free memory was 315.9MB in the beginning and 644.4MB in the end (delta: -328.5MB). Peak memory consumption was 17.5MB. Max. memory is 16.0GB. [2023-08-04 07:29:17,806 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.09ms. Allocated memory is still 400.6MB. Free memory was 347.4MB in the beginning and 347.2MB in the end (delta: 226.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 270.64ms. Allocated memory is still 400.6MB. Free memory was 354.7MB in the beginning and 334.8MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 34.12ms. Allocated memory is still 400.6MB. Free memory was 334.8MB in the beginning and 332.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 18.44ms. Allocated memory is still 400.6MB. Free memory was 332.7MB in the beginning and 330.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 307.06ms. Allocated memory is still 400.6MB. Free memory was 330.6MB in the beginning and 315.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * TraceAbstraction took 9948.05ms. Allocated memory was 400.6MB in the beginning and 744.5MB in the end (delta: 343.9MB). Free memory was 315.9MB in the beginning and 644.4MB in the end (delta: -328.5MB). Peak memory consumption was 17.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 71 PlacesBefore, 21 PlacesAfterwards, 69 TransitionsBefore, 17 TransitionsAfterwards, 840 CoEnabledTransitionPairs, 5 FixpointIterations, 16 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 61 TotalNumberOfCompositions, 1574 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 965, independent: 906, independent conditional: 0, independent unconditional: 906, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 468, independent: 450, independent conditional: 0, independent unconditional: 450, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 965, independent: 456, independent conditional: 0, independent unconditional: 456, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 468, unknown conditional: 0, unknown unconditional: 468] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 32, Positive conditional cache size: 0, Positive unconditional cache size: 32, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 59 PlacesBefore, 20 PlacesAfterwards, 55 TransitionsBefore, 15 TransitionsAfterwards, 492 CoEnabledTransitionPairs, 5 FixpointIterations, 16 TrivialSequentialCompositions, 21 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 44 TotalNumberOfCompositions, 991 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 662, independent: 612, independent conditional: 0, independent unconditional: 612, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 261, independent: 254, independent conditional: 0, independent unconditional: 254, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 662, independent: 358, independent conditional: 0, independent unconditional: 358, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 261, unknown conditional: 0, unknown unconditional: 261] , Statistics on independence cache: Total cache size (in pairs): 29, Positive cache size: 26, Positive conditional cache size: 0, Positive unconditional cache size: 26, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 89 PlacesBefore, 35 PlacesAfterwards, 83 TransitionsBefore, 27 TransitionsAfterwards, 2016 CoEnabledTransitionPairs, 5 FixpointIterations, 16 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 65 TotalNumberOfCompositions, 4286 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1849, independent: 1743, independent conditional: 0, independent unconditional: 1743, dependent: 106, dependent conditional: 0, dependent unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1011, independent: 984, independent conditional: 0, independent unconditional: 984, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1849, independent: 759, independent conditional: 0, independent unconditional: 759, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 1011, unknown conditional: 0, unknown unconditional: 1011] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 61, Positive conditional cache size: 0, Positive unconditional cache size: 61, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L760] 0 pthread_t t2573[2]; [L761] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t2573={5:0}, x=0, y=0] [L761] COND TRUE 0 asdf<2 [L761] FCALL, FORK 0 pthread_create(&t2573[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2573[asdf], ((void *)0), P0, ((void *)0))=-1, t2573={5:0}, x=0, y=0] [L761] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t2573={5:0}, x=0, y=0] [L761] COND TRUE 0 asdf<2 [L761] FCALL, FORK 0 pthread_create(&t2573[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2573[asdf], ((void *)0), P0, ((void *)0))=0, t2573={5:0}, x=0, y=0] [L761] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2573={5:0}, x=0, y=0] [L761] COND FALSE 0 !(asdf<2) [L762] 0 pthread_t t2574[2]; [L763] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2573={5:0}, t2574={3:0}, x=0, y=0] [L763] COND TRUE 0 asdf<2 [L763] FCALL, FORK 0 pthread_create(&t2574[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2574[asdf], ((void *)0), P1, ((void *)0))=1, t2573={5:0}, t2574={3:0}, x=0, y=0] [L763] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2573={5:0}, t2574={3:0}, x=0, y=0] [L763] COND TRUE 0 asdf<2 [L763] FCALL, FORK 0 pthread_create(&t2574[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2574[asdf], ((void *)0), P1, ((void *)0))=2, t2573={5:0}, t2574={3:0}, x=0, y=0] [L763] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2573={5:0}, t2574={3:0}, x=0, y=0] [L720] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=2] [L720] 2 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=2] [L725] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=2] [L730] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L732] 1 return 0; [L730] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L732] 2 return 0; [L763] COND FALSE 0 !(asdf<2) [L765] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L767] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, x=0, y=2] [L767] RET 0 assume_abort_if_not(main$tmp_guard0) [L771] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) [L773] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, x=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 92 locations, 3 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.5s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 109 IncrementalHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 21 mSDtfsCounter, 109 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=2, InterpolantAutomatonStates: 10, 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, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 78 SizeOfPredicates, 0 NumberOfNonLiveVariables, 205 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 4/8 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, 106 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.1s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 430 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 368 mSDsluCounter, 70 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 142 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 820 IncrementalHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 142 mSolverCounterUnsat, 24 mSDtfsCounter, 820 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 94 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1692occurred in iteration=7, InterpolantAutomatonStates: 46, 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.8s InterpolantComputationTime, 189 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 891 SizeOfPredicates, 1 NumberOfNonLiveVariables, 502 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 71/89 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, 92 locations, 3 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: 1.2s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32 IncrementalHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 7 mSDtfsCounter, 32 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=48occurred 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 07:29:17,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...