/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/weaver_test-easy6.wvr_bound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 09:52:42,105 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 09:52:42,149 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 09:52:42,153 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 09:52:42,153 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 09:52:42,153 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 09:52:42,154 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 09:52:42,172 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 09:52:42,172 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 09:52:42,173 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 09:52:42,173 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 09:52:42,174 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 09:52:42,174 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 09:52:42,174 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 09:52:42,175 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 09:52:42,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 09:52:42,175 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 09:52:42,176 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 09:52:42,176 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 09:52:42,177 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 09:52:42,177 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 09:52:42,177 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 09:52:42,178 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 09:52:42,178 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 09:52:42,178 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 09:52:42,179 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 09:52:42,179 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 09:52:42,180 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 09:52:42,180 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 09:52:42,180 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 09:52:42,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 09:52:42,181 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 09:52:42,181 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 09:52:42,182 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 09:52:42,182 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 09:52:42,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 09:52:42,183 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 09:52:42,183 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 09:52:42,183 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 09:52:42,184 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 09:52:42,184 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 09:52:42,184 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 09:52:42,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 09:52:42,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 09:52:42,450 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 09:52:42,451 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 09:52:42,452 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 09:52:42,453 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/weaver_test-easy6.wvr_bound2.c [2023-08-04 09:52:43,672 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 09:52:43,895 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 09:52:43,895 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/weaver_test-easy6.wvr_bound2.c [2023-08-04 09:52:43,902 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4b7c9847/240990f5b199444fa930eefd819d6fee/FLAG4dcb9b7d6 [2023-08-04 09:52:43,916 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4b7c9847/240990f5b199444fa930eefd819d6fee [2023-08-04 09:52:43,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 09:52:43,919 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 09:52:43,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 09:52:43,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 09:52:43,927 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 09:52:43,928 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 09:52:43" (1/1) ... [2023-08-04 09:52:43,929 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@757df129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:52:43, skipping insertion in model container [2023-08-04 09:52:43,929 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 09:52:43" (1/1) ... [2023-08-04 09:52:43,949 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 09:52:44,121 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_test-easy6.wvr_bound2.c[3208,3221] [2023-08-04 09:52:44,122 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 09:52:44,130 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 09:52:44,152 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_test-easy6.wvr_bound2.c[3208,3221] [2023-08-04 09:52:44,153 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 09:52:44,159 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 09:52:44,160 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 09:52:44,164 INFO L206 MainTranslator]: Completed translation [2023-08-04 09:52:44,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:52:44 WrapperNode [2023-08-04 09:52:44,165 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 09:52:44,166 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 09:52:44,166 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 09:52:44,166 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 09:52:44,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:52:44" (1/1) ... [2023-08-04 09:52:44,178 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:52:44" (1/1) ... [2023-08-04 09:52:44,202 INFO L138 Inliner]: procedures = 21, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 155 [2023-08-04 09:52:44,203 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 09:52:44,204 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 09:52:44,204 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 09:52:44,204 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 09:52:44,211 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:52:44" (1/1) ... [2023-08-04 09:52:44,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:52:44" (1/1) ... [2023-08-04 09:52:44,215 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:52:44" (1/1) ... [2023-08-04 09:52:44,215 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:52:44" (1/1) ... [2023-08-04 09:52:44,220 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:52:44" (1/1) ... [2023-08-04 09:52:44,223 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:52:44" (1/1) ... [2023-08-04 09:52:44,224 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:52:44" (1/1) ... [2023-08-04 09:52:44,225 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:52:44" (1/1) ... [2023-08-04 09:52:44,227 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 09:52:44,228 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 09:52:44,228 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 09:52:44,228 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 09:52:44,229 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:52:44" (1/1) ... [2023-08-04 09:52:44,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 09:52:44,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:52:44,258 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 09:52:44,260 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 09:52:44,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 09:52:44,285 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-04 09:52:44,285 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-04 09:52:44,285 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-04 09:52:44,285 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-04 09:52:44,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 09:52:44,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 09:52:44,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 09:52:44,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 09:52:44,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 09:52:44,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 09:52:44,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 09:52:44,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 09:52:44,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 09:52:44,288 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 09:52:44,371 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 09:52:44,372 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 09:52:44,543 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 09:52:44,605 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 09:52:44,605 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-04 09:52:44,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:52:44 BoogieIcfgContainer [2023-08-04 09:52:44,607 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 09:52:44,612 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 09:52:44,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 09:52:44,615 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 09:52:44,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 09:52:43" (1/3) ... [2023-08-04 09:52:44,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e5b19a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:52:44, skipping insertion in model container [2023-08-04 09:52:44,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:52:44" (2/3) ... [2023-08-04 09:52:44,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e5b19a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:52:44, skipping insertion in model container [2023-08-04 09:52:44,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:52:44" (3/3) ... [2023-08-04 09:52:44,620 INFO L112 eAbstractionObserver]: Analyzing ICFG weaver_test-easy6.wvr_bound2.c [2023-08-04 09:52:44,626 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 09:52:44,632 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 09:52:44,632 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 09:52:44,633 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 09:52:44,681 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-04 09:52:44,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 108 transitions, 238 flow [2023-08-04 09:52:44,825 INFO L124 PetriNetUnfolderBase]: 26/249 cut-off events. [2023-08-04 09:52:44,825 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2023-08-04 09:52:44,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 249 events. 26/249 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 965 event pairs, 0 based on Foata normal form. 0/213 useless extension candidates. Maximal degree in co-relation 125. Up to 8 conditions per place. [2023-08-04 09:52:44,832 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 108 transitions, 238 flow [2023-08-04 09:52:44,836 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 98 transitions, 214 flow [2023-08-04 09:52:44,839 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 09:52:44,848 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 98 transitions, 214 flow [2023-08-04 09:52:44,851 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 98 transitions, 214 flow [2023-08-04 09:52:44,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 98 transitions, 214 flow [2023-08-04 09:52:44,888 INFO L124 PetriNetUnfolderBase]: 26/214 cut-off events. [2023-08-04 09:52:44,889 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 09:52:44,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 214 events. 26/214 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 716 event pairs, 0 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 107. Up to 8 conditions per place. [2023-08-04 09:52:44,892 INFO L119 LiptonReduction]: Number of co-enabled transitions 2244 [2023-08-04 09:52:46,626 INFO L134 LiptonReduction]: Checked pairs total: 8729 [2023-08-04 09:52:46,626 INFO L136 LiptonReduction]: Total number of compositions: 68 [2023-08-04 09:52:46,649 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 09:52:46,656 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;@7fc5ec14, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 09:52:46,657 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 09:52:46,662 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 09:52:46,662 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-08-04 09:52:46,662 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 09:52:46,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:52:46,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 09:52:46,664 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:52:46,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:52:46,670 INFO L85 PathProgramCache]: Analyzing trace with hash 419861496, now seen corresponding path program 1 times [2023-08-04 09:52:46,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:52:46,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885710052] [2023-08-04 09:52:46,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:52:46,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:52:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:52:46,858 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 09:52:46,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:52:46,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885710052] [2023-08-04 09:52:46,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885710052] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:52:46,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:52:46,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 09:52:46,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86039259] [2023-08-04 09:52:46,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:52:46,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:52:46,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:52:46,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:52:46,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 09:52:46,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 176 [2023-08-04 09:52:46,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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 09:52:46,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:52:46,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 176 [2023-08-04 09:52:46,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:52:47,075 INFO L124 PetriNetUnfolderBase]: 249/608 cut-off events. [2023-08-04 09:52:47,075 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-08-04 09:52:47,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1104 conditions, 608 events. 249/608 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3605 event pairs, 231 based on Foata normal form. 0/500 useless extension candidates. Maximal degree in co-relation 944. Up to 457 conditions per place. [2023-08-04 09:52:47,085 INFO L140 encePairwiseOnDemand]: 173/176 looper letters, 26 selfloop transitions, 2 changer transitions 1/43 dead transitions. [2023-08-04 09:52:47,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 43 transitions, 162 flow [2023-08-04 09:52:47,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:52:47,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:52:47,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 294 transitions. [2023-08-04 09:52:47,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5568181818181818 [2023-08-04 09:52:47,106 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 294 transitions. [2023-08-04 09:52:47,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 294 transitions. [2023-08-04 09:52:47,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:52:47,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 294 transitions. [2023-08-04 09:52:47,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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 09:52:47,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 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 09:52:47,119 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 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 09:52:47,121 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 96 flow. Second operand 3 states and 294 transitions. [2023-08-04 09:52:47,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 43 transitions, 162 flow [2023-08-04 09:52:47,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 43 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 09:52:47,130 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 98 flow [2023-08-04 09:52:47,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=41, PETRI_TRANSITIONS=39} [2023-08-04 09:52:47,136 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-08-04 09:52:47,136 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 98 flow [2023-08-04 09:52:47,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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 09:52:47,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:52:47,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:52:47,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 09:52:47,137 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:52:47,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:52:47,138 INFO L85 PathProgramCache]: Analyzing trace with hash -89208519, now seen corresponding path program 1 times [2023-08-04 09:52:47,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:52:47,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348045270] [2023-08-04 09:52:47,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:52:47,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:52:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:52:47,241 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 09:52:47,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:52:47,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348045270] [2023-08-04 09:52:47,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348045270] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:52:47,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50676782] [2023-08-04 09:52:47,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:52:47,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:52:47,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:52:47,249 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 09:52:47,258 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 09:52:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:52:47,320 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:52:47,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:52:47,337 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 09:52:47,337 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:52:47,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50676782] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:52:47,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:52:47,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 09:52:47,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291674370] [2023-08-04 09:52:47,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:52:47,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:52:47,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:52:47,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:52:47,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:52:47,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 176 [2023-08-04 09:52:47,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:52:47,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:52:47,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 176 [2023-08-04 09:52:47,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:52:47,434 INFO L124 PetriNetUnfolderBase]: 245/578 cut-off events. [2023-08-04 09:52:47,434 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-04 09:52:47,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1080 conditions, 578 events. 245/578 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3352 event pairs, 205 based on Foata normal form. 0/481 useless extension candidates. Maximal degree in co-relation 798. Up to 417 conditions per place. [2023-08-04 09:52:47,438 INFO L140 encePairwiseOnDemand]: 173/176 looper letters, 29 selfloop transitions, 2 changer transitions 1/46 dead transitions. [2023-08-04 09:52:47,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 176 flow [2023-08-04 09:52:47,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:52:47,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:52:47,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2023-08-04 09:52:47,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5625 [2023-08-04 09:52:47,440 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 297 transitions. [2023-08-04 09:52:47,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 297 transitions. [2023-08-04 09:52:47,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:52:47,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 297 transitions. [2023-08-04 09:52:47,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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 09:52:47,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 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 09:52:47,443 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 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 09:52:47,443 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 98 flow. Second operand 3 states and 297 transitions. [2023-08-04 09:52:47,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 176 flow [2023-08-04 09:52:47,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 46 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 09:52:47,445 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 102 flow [2023-08-04 09:52:47,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2023-08-04 09:52:47,446 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2023-08-04 09:52:47,446 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 102 flow [2023-08-04 09:52:47,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:52:47,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:52:47,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:52:47,455 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 09:52:47,652 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 09:52:47,653 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:52:47,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:52:47,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1479873136, now seen corresponding path program 1 times [2023-08-04 09:52:47,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:52:47,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672825130] [2023-08-04 09:52:47,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:52:47,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:52:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:52:47,736 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 09:52:47,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:52:47,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672825130] [2023-08-04 09:52:47,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672825130] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:52:47,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949981227] [2023-08-04 09:52:47,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:52:47,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:52:47,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:52:47,742 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 09:52:47,744 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 09:52:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:52:47,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:52:47,801 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:52:47,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 09:52:47,810 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:52:47,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949981227] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:52:47,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:52:47,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 09:52:47,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792382639] [2023-08-04 09:52:47,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:52:47,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:52:47,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:52:47,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:52:47,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:52:47,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 176 [2023-08-04 09:52:47,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 102 flow. Second operand has 3 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 09:52:47,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:52:47,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 176 [2023-08-04 09:52:47,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:52:47,914 INFO L124 PetriNetUnfolderBase]: 159/402 cut-off events. [2023-08-04 09:52:47,914 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-08-04 09:52:47,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 802 conditions, 402 events. 159/402 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2042 event pairs, 110 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 561. Up to 223 conditions per place. [2023-08-04 09:52:47,917 INFO L140 encePairwiseOnDemand]: 173/176 looper letters, 33 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2023-08-04 09:52:47,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 196 flow [2023-08-04 09:52:47,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:52:47,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:52:47,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2023-08-04 09:52:47,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2023-08-04 09:52:47,920 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 300 transitions. [2023-08-04 09:52:47,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 300 transitions. [2023-08-04 09:52:47,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:52:47,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 300 transitions. [2023-08-04 09:52:47,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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 09:52:47,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 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 09:52:47,923 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 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 09:52:47,923 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 102 flow. Second operand 3 states and 300 transitions. [2023-08-04 09:52:47,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 196 flow [2023-08-04 09:52:47,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 09:52:47,926 INFO L231 Difference]: Finished difference. Result has 43 places, 40 transitions, 110 flow [2023-08-04 09:52:47,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=43, PETRI_TRANSITIONS=40} [2023-08-04 09:52:47,927 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2023-08-04 09:52:47,927 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 40 transitions, 110 flow [2023-08-04 09:52:47,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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 09:52:47,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:52:47,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:52:47,942 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 09:52:48,139 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 09:52:48,140 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:52:48,140 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:52:48,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1717075890, now seen corresponding path program 1 times [2023-08-04 09:52:48,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:52:48,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401485035] [2023-08-04 09:52:48,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:52:48,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:52:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:52:48,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 09:52:48,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:52:48,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401485035] [2023-08-04 09:52:48,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401485035] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:52:48,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998228855] [2023-08-04 09:52:48,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:52:48,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:52:48,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:52:48,265 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 09:52:48,297 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 09:52:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:52:48,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:52:48,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:52:48,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:52:48,353 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:52:48,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998228855] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:52:48,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:52:48,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-04 09:52:48,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309469471] [2023-08-04 09:52:48,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:52:48,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:52:48,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:52:48,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:52:48,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:52:48,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 176 [2023-08-04 09:52:48,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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 09:52:48,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:52:48,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 176 [2023-08-04 09:52:48,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:52:48,453 INFO L124 PetriNetUnfolderBase]: 152/387 cut-off events. [2023-08-04 09:52:48,453 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-08-04 09:52:48,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 797 conditions, 387 events. 152/387 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1957 event pairs, 139 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 560. Up to 272 conditions per place. [2023-08-04 09:52:48,457 INFO L140 encePairwiseOnDemand]: 173/176 looper letters, 29 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2023-08-04 09:52:48,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 47 transitions, 190 flow [2023-08-04 09:52:48,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:52:48,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:52:48,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2023-08-04 09:52:48,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5625 [2023-08-04 09:52:48,465 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 297 transitions. [2023-08-04 09:52:48,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 297 transitions. [2023-08-04 09:52:48,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:52:48,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 297 transitions. [2023-08-04 09:52:48,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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 09:52:48,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 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 09:52:48,468 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 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 09:52:48,468 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 110 flow. Second operand 3 states and 297 transitions. [2023-08-04 09:52:48,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 47 transitions, 190 flow [2023-08-04 09:52:48,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 47 transitions, 188 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:52:48,472 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 112 flow [2023-08-04 09:52:48,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2023-08-04 09:52:48,474 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2023-08-04 09:52:48,474 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 112 flow [2023-08-04 09:52:48,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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 09:52:48,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:52:48,474 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:52:48,483 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 09:52:48,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:52:48,680 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:52:48,681 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:52:48,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1083711252, now seen corresponding path program 1 times [2023-08-04 09:52:48,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:52:48,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840993134] [2023-08-04 09:52:48,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:52:48,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:52:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:52:48,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:52:48,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:52:48,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840993134] [2023-08-04 09:52:48,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840993134] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:52:48,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655448454] [2023-08-04 09:52:48,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:52:48,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:52:48,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:52:48,770 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 09:52:48,772 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 09:52:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:52:48,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:52:48,845 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:52:48,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:52:48,889 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:52:48,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:52:48,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655448454] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:52:48,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:52:48,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 09:52:48,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112885817] [2023-08-04 09:52:48,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:52:48,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:52:48,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:52:48,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:52:48,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:52:48,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 176 [2023-08-04 09:52:48,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 92.6) internal successors, (463), 5 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:52:48,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:52:48,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 176 [2023-08-04 09:52:48,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:52:48,948 INFO L124 PetriNetUnfolderBase]: 6/26 cut-off events. [2023-08-04 09:52:48,948 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 09:52:48,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 26 events. 6/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 31 event pairs, 0 based on Foata normal form. 4/28 useless extension candidates. Maximal degree in co-relation 51. Up to 14 conditions per place. [2023-08-04 09:52:48,948 INFO L140 encePairwiseOnDemand]: 173/176 looper letters, 0 selfloop transitions, 0 changer transitions 17/17 dead transitions. [2023-08-04 09:52:48,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 17 transitions, 60 flow [2023-08-04 09:52:48,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:52:48,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:52:48,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 360 transitions. [2023-08-04 09:52:48,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2023-08-04 09:52:48,950 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 360 transitions. [2023-08-04 09:52:48,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 360 transitions. [2023-08-04 09:52:48,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:52:48,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 360 transitions. [2023-08-04 09:52:48,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 90.0) internal successors, (360), 4 states have internal predecessors, (360), 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 09:52:48,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 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 09:52:48,953 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 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 09:52:48,953 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 112 flow. Second operand 4 states and 360 transitions. [2023-08-04 09:52:48,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 17 transitions, 60 flow [2023-08-04 09:52:48,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 17 transitions, 58 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:52:48,954 INFO L231 Difference]: Finished difference. Result has 23 places, 0 transitions, 0 flow [2023-08-04 09:52:48,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=28, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=23, PETRI_TRANSITIONS=0} [2023-08-04 09:52:48,955 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -17 predicate places. [2023-08-04 09:52:48,955 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 0 transitions, 0 flow [2023-08-04 09:52:48,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.6) internal successors, (463), 5 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:52:48,957 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 09:52:48,967 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 09:52:49,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:52:49,164 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-04 09:52:49,165 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2023-08-04 09:52:49,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 108 transitions, 238 flow [2023-08-04 09:52:49,186 INFO L124 PetriNetUnfolderBase]: 26/249 cut-off events. [2023-08-04 09:52:49,186 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2023-08-04 09:52:49,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 249 events. 26/249 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 965 event pairs, 0 based on Foata normal form. 0/213 useless extension candidates. Maximal degree in co-relation 125. Up to 8 conditions per place. [2023-08-04 09:52:49,187 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 108 transitions, 238 flow [2023-08-04 09:52:49,188 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 68 transitions, 146 flow [2023-08-04 09:52:49,188 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 09:52:49,188 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 68 transitions, 146 flow [2023-08-04 09:52:49,188 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 68 transitions, 146 flow [2023-08-04 09:52:49,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 68 transitions, 146 flow [2023-08-04 09:52:49,217 INFO L124 PetriNetUnfolderBase]: 2/105 cut-off events. [2023-08-04 09:52:49,218 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 09:52:49,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 191 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 64. Up to 4 conditions per place. [2023-08-04 09:52:49,219 INFO L119 LiptonReduction]: Number of co-enabled transitions 990 [2023-08-04 09:52:50,495 INFO L134 LiptonReduction]: Checked pairs total: 4002 [2023-08-04 09:52:50,495 INFO L136 LiptonReduction]: Total number of compositions: 44 [2023-08-04 09:52:50,497 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 09:52:50,497 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;@7fc5ec14, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 09:52:50,497 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 09:52:50,499 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 09:52:50,499 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2023-08-04 09:52:50,499 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 09:52:50,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:52:50,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 09:52:50,499 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 09:52:50,500 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:52:50,500 INFO L85 PathProgramCache]: Analyzing trace with hash 462515779, now seen corresponding path program 1 times [2023-08-04 09:52:50,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:52:50,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172205411] [2023-08-04 09:52:50,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:52:50,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:52:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:52:50,517 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 09:52:50,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:52:50,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172205411] [2023-08-04 09:52:50,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172205411] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:52:50,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:52:50,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 09:52:50,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764591747] [2023-08-04 09:52:50,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:52:50,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:52:50,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:52:50,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:52:50,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 09:52:50,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 152 [2023-08-04 09:52:50,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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 09:52:50,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:52:50,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 152 [2023-08-04 09:52:50,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:52:50,555 INFO L124 PetriNetUnfolderBase]: 45/145 cut-off events. [2023-08-04 09:52:50,555 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-04 09:52:50,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 145 events. 45/145 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 566 event pairs, 42 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 244. Up to 90 conditions per place. [2023-08-04 09:52:50,556 INFO L140 encePairwiseOnDemand]: 149/152 looper letters, 15 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2023-08-04 09:52:50,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 31 transitions, 106 flow [2023-08-04 09:52:50,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:52:50,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:52:50,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions. [2023-08-04 09:52:50,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.618421052631579 [2023-08-04 09:52:50,558 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 282 transitions. [2023-08-04 09:52:50,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 282 transitions. [2023-08-04 09:52:50,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:52:50,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 282 transitions. [2023-08-04 09:52:50,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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 09:52:50,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 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 09:52:50,560 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 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 09:52:50,560 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 64 flow. Second operand 3 states and 282 transitions. [2023-08-04 09:52:50,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 31 transitions, 106 flow [2023-08-04 09:52:50,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 31 transitions, 106 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 09:52:50,561 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 72 flow [2023-08-04 09:52:50,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2023-08-04 09:52:50,562 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2023-08-04 09:52:50,562 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 72 flow [2023-08-04 09:52:50,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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 09:52:50,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:52:50,563 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 09:52:50,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 09:52:50,563 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 09:52:50,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:52:50,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1454073244, now seen corresponding path program 1 times [2023-08-04 09:52:50,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:52:50,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703901612] [2023-08-04 09:52:50,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:52:50,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:52:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 09:52:50,575 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 09:52:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 09:52:50,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 09:52:50,594 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 09:52:50,595 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 09:52:50,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 09:52:50,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 09:52:50,595 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 09:52:50,596 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (2/2) [2023-08-04 09:52:50,596 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 09:52:50,596 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 09:52:50,614 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-08-04 09:52:50,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 136 transitions, 320 flow [2023-08-04 09:52:50,681 INFO L124 PetriNetUnfolderBase]: 117/829 cut-off events. [2023-08-04 09:52:50,681 INFO L125 PetriNetUnfolderBase]: For 72/79 co-relation queries the response was YES. [2023-08-04 09:52:50,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 829 events. 117/829 cut-off events. For 72/79 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4563 event pairs, 2 based on Foata normal form. 0/709 useless extension candidates. Maximal degree in co-relation 484. Up to 32 conditions per place. [2023-08-04 09:52:50,685 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 136 transitions, 320 flow [2023-08-04 09:52:50,688 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 126 transitions, 292 flow [2023-08-04 09:52:50,688 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 09:52:50,688 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 126 transitions, 292 flow [2023-08-04 09:52:50,688 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 126 transitions, 292 flow [2023-08-04 09:52:50,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 126 transitions, 292 flow [2023-08-04 09:52:50,741 INFO L124 PetriNetUnfolderBase]: 117/697 cut-off events. [2023-08-04 09:52:50,741 INFO L125 PetriNetUnfolderBase]: For 68/72 co-relation queries the response was YES. [2023-08-04 09:52:50,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 697 events. 117/697 cut-off events. For 68/72 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3598 event pairs, 2 based on Foata normal form. 0/593 useless extension candidates. Maximal degree in co-relation 414. Up to 32 conditions per place. [2023-08-04 09:52:50,755 INFO L119 LiptonReduction]: Number of co-enabled transitions 5896 [2023-08-04 09:52:52,231 INFO L134 LiptonReduction]: Checked pairs total: 31419 [2023-08-04 09:52:52,231 INFO L136 LiptonReduction]: Total number of compositions: 70 [2023-08-04 09:52:52,232 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 09:52:52,233 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;@7fc5ec14, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 09:52:52,233 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 09:52:52,235 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 09:52:52,235 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-08-04 09:52:52,235 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 09:52:52,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:52:52,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 09:52:52,235 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:52:52,236 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:52:52,236 INFO L85 PathProgramCache]: Analyzing trace with hash 683190993, now seen corresponding path program 1 times [2023-08-04 09:52:52,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:52:52,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087220266] [2023-08-04 09:52:52,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:52:52,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:52:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:52:52,252 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 09:52:52,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:52:52,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087220266] [2023-08-04 09:52:52,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087220266] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:52:52,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:52:52,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 09:52:52,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288367967] [2023-08-04 09:52:52,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:52:52,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:52:52,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:52:52,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:52:52,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 09:52:52,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 206 [2023-08-04 09:52:52,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 65 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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 09:52:52,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:52:52,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 206 [2023-08-04 09:52:52,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:52:54,352 INFO L124 PetriNetUnfolderBase]: 12819/21833 cut-off events. [2023-08-04 09:52:54,352 INFO L125 PetriNetUnfolderBase]: For 1996/1996 co-relation queries the response was YES. [2023-08-04 09:52:54,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41117 conditions, 21833 events. 12819/21833 cut-off events. For 1996/1996 co-relation queries the response was YES. Maximal size of possible extension queue 1046. Compared 189371 event pairs, 8831 based on Foata normal form. 0/19274 useless extension candidates. Maximal degree in co-relation 10793. Up to 17979 conditions per place. [2023-08-04 09:52:54,493 INFO L140 encePairwiseOnDemand]: 203/206 looper letters, 40 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-08-04 09:52:54,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 70 transitions, 264 flow [2023-08-04 09:52:54,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:52:54,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:52:54,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-08-04 09:52:54,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5841423948220065 [2023-08-04 09:52:54,495 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-08-04 09:52:54,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-08-04 09:52:54,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:52:54,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-08-04 09:52:54,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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 09:52:54,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 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 09:52:54,499 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 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 09:52:54,499 INFO L175 Difference]: Start difference. First operand has 66 places, 65 transitions, 170 flow. Second operand 3 states and 361 transitions. [2023-08-04 09:52:54,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 70 transitions, 264 flow [2023-08-04 09:52:54,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 70 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 09:52:54,516 INFO L231 Difference]: Finished difference. Result has 67 places, 66 transitions, 176 flow [2023-08-04 09:52:54,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=67, PETRI_TRANSITIONS=66} [2023-08-04 09:52:54,521 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 1 predicate places. [2023-08-04 09:52:54,522 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 66 transitions, 176 flow [2023-08-04 09:52:54,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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 09:52:54,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:52:54,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:52:54,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 09:52:54,524 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:52:54,524 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:52:54,524 INFO L85 PathProgramCache]: Analyzing trace with hash 277251545, now seen corresponding path program 1 times [2023-08-04 09:52:54,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:52:54,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048655679] [2023-08-04 09:52:54,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:52:54,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:52:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:52:54,558 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 09:52:54,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:52:54,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048655679] [2023-08-04 09:52:54,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048655679] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:52:54,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756833983] [2023-08-04 09:52:54,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:52:54,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:52:54,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:52:54,560 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 09:52:54,562 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 09:52:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:52:54,607 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:52:54,608 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:52:54,616 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 09:52:54,616 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:52:54,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756833983] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:52:54,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:52:54,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 09:52:54,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248473086] [2023-08-04 09:52:54,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:52:54,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:52:54,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:52:54,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:52:54,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:52:54,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 206 [2023-08-04 09:52:54,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 66 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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 09:52:54,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:52:54,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 206 [2023-08-04 09:52:54,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:52:56,279 INFO L124 PetriNetUnfolderBase]: 12799/21423 cut-off events. [2023-08-04 09:52:56,279 INFO L125 PetriNetUnfolderBase]: For 1302/1302 co-relation queries the response was YES. [2023-08-04 09:52:56,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40650 conditions, 21423 events. 12799/21423 cut-off events. For 1302/1302 co-relation queries the response was YES. Maximal size of possible extension queue 1041. Compared 183132 event pairs, 11827 based on Foata normal form. 0/19052 useless extension candidates. Maximal degree in co-relation 31447. Up to 17683 conditions per place. [2023-08-04 09:52:56,490 INFO L140 encePairwiseOnDemand]: 203/206 looper letters, 47 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2023-08-04 09:52:56,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 77 transitions, 296 flow [2023-08-04 09:52:56,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:52:56,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:52:56,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-08-04 09:52:56,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5938511326860841 [2023-08-04 09:52:56,492 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-08-04 09:52:56,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-08-04 09:52:56,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:52:56,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-08-04 09:52:56,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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 09:52:56,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 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 09:52:56,495 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 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 09:52:56,495 INFO L175 Difference]: Start difference. First operand has 67 places, 66 transitions, 176 flow. Second operand 3 states and 367 transitions. [2023-08-04 09:52:56,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 77 transitions, 296 flow [2023-08-04 09:52:56,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 77 transitions, 294 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:52:56,498 INFO L231 Difference]: Finished difference. Result has 69 places, 67 transitions, 186 flow [2023-08-04 09:52:56,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=69, PETRI_TRANSITIONS=67} [2023-08-04 09:52:56,501 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 3 predicate places. [2023-08-04 09:52:56,501 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 67 transitions, 186 flow [2023-08-04 09:52:56,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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 09:52:56,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:52:56,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:52:56,510 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 09:52:56,707 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 09:52:56,708 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:52:56,708 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:52:56,708 INFO L85 PathProgramCache]: Analyzing trace with hash 477646740, now seen corresponding path program 1 times [2023-08-04 09:52:56,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:52:56,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818278389] [2023-08-04 09:52:56,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:52:56,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:52:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:52:56,769 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 09:52:56,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:52:56,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818278389] [2023-08-04 09:52:56,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818278389] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:52:56,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880592248] [2023-08-04 09:52:56,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:52:56,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:52:56,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:52:56,771 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 09:52:56,773 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 09:52:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:52:56,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:52:56,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:52:56,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 09:52:56,842 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:52:56,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880592248] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:52:56,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:52:56,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 09:52:56,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165703379] [2023-08-04 09:52:56,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:52:56,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:52:56,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:52:56,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:52:56,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:52:56,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 206 [2023-08-04 09:52:56,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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 09:52:56,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:52:56,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 206 [2023-08-04 09:52:56,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:52:58,012 INFO L124 PetriNetUnfolderBase]: 10373/17217 cut-off events. [2023-08-04 09:52:58,012 INFO L125 PetriNetUnfolderBase]: For 1774/1774 co-relation queries the response was YES. [2023-08-04 09:52:58,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34115 conditions, 17217 events. 10373/17217 cut-off events. For 1774/1774 co-relation queries the response was YES. Maximal size of possible extension queue 801. Compared 142308 event pairs, 6997 based on Foata normal form. 0/15774 useless extension candidates. Maximal degree in co-relation 18071. Up to 10869 conditions per place. [2023-08-04 09:52:58,102 INFO L140 encePairwiseOnDemand]: 203/206 looper letters, 55 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2023-08-04 09:52:58,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 85 transitions, 346 flow [2023-08-04 09:52:58,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:52:58,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:52:58,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2023-08-04 09:52:58,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6051779935275081 [2023-08-04 09:52:58,104 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 374 transitions. [2023-08-04 09:52:58,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions. [2023-08-04 09:52:58,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:52:58,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions. [2023-08-04 09:52:58,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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 09:52:58,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 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 09:52:58,107 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 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 09:52:58,107 INFO L175 Difference]: Start difference. First operand has 69 places, 67 transitions, 186 flow. Second operand 3 states and 374 transitions. [2023-08-04 09:52:58,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 85 transitions, 346 flow [2023-08-04 09:52:58,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 85 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:52:58,110 INFO L231 Difference]: Finished difference. Result has 71 places, 68 transitions, 196 flow [2023-08-04 09:52:58,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=71, PETRI_TRANSITIONS=68} [2023-08-04 09:52:58,111 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 5 predicate places. [2023-08-04 09:52:58,111 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 196 flow [2023-08-04 09:52:58,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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 09:52:58,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:52:58,112 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:52:58,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-04 09:52:58,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:52:58,317 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:52:58,317 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:52:58,317 INFO L85 PathProgramCache]: Analyzing trace with hash -10752144, now seen corresponding path program 1 times [2023-08-04 09:52:58,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:52:58,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752798710] [2023-08-04 09:52:58,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:52:58,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:52:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:52:58,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 09:52:58,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:52:58,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752798710] [2023-08-04 09:52:58,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752798710] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:52:58,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933748389] [2023-08-04 09:52:58,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:52:58,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:52:58,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:52:58,379 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:52:58,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-04 09:52:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:52:58,444 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:52:58,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:52:58,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:52:58,461 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:52:58,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933748389] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:52:58,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:52:58,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-04 09:52:58,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597497583] [2023-08-04 09:52:58,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:52:58,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:52:58,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:52:58,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:52:58,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:52:58,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 206 [2023-08-04 09:52:58,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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 09:52:58,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:52:58,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 206 [2023-08-04 09:52:58,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:52:59,776 INFO L124 PetriNetUnfolderBase]: 10060/16986 cut-off events. [2023-08-04 09:52:59,777 INFO L125 PetriNetUnfolderBase]: For 3897/3897 co-relation queries the response was YES. [2023-08-04 09:52:59,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35101 conditions, 16986 events. 10060/16986 cut-off events. For 3897/3897 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 141603 event pairs, 8135 based on Foata normal form. 0/16356 useless extension candidates. Maximal degree in co-relation 18456. Up to 11963 conditions per place. [2023-08-04 09:52:59,850 INFO L140 encePairwiseOnDemand]: 203/206 looper letters, 56 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2023-08-04 09:52:59,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 86 transitions, 358 flow [2023-08-04 09:52:59,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:52:59,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:52:59,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2023-08-04 09:52:59,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6051779935275081 [2023-08-04 09:52:59,852 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 374 transitions. [2023-08-04 09:52:59,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions. [2023-08-04 09:52:59,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:52:59,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions. [2023-08-04 09:52:59,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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 09:52:59,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 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 09:52:59,854 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 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 09:52:59,854 INFO L175 Difference]: Start difference. First operand has 71 places, 68 transitions, 196 flow. Second operand 3 states and 374 transitions. [2023-08-04 09:52:59,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 86 transitions, 358 flow [2023-08-04 09:52:59,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 86 transitions, 356 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:52:59,872 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 206 flow [2023-08-04 09:52:59,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2023-08-04 09:52:59,874 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 7 predicate places. [2023-08-04 09:52:59,874 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 206 flow [2023-08-04 09:52:59,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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 09:52:59,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:52:59,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:52:59,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-04 09:53:00,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:53:00,080 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:53:00,081 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:53:00,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1067816530, now seen corresponding path program 1 times [2023-08-04 09:53:00,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:53:00,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499800579] [2023-08-04 09:53:00,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:53:00,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:53:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:53:00,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:53:00,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:53:00,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499800579] [2023-08-04 09:53:00,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499800579] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:53:00,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312486065] [2023-08-04 09:53:00,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:53:00,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:53:00,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:53:00,147 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:53:00,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-04 09:53:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:53:00,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:53:00,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:53:00,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:53:00,233 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:53:00,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:53:00,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312486065] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:53:00,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:53:00,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 09:53:00,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752744205] [2023-08-04 09:53:00,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:53:00,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:53:00,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:53:00,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:53:00,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:53:00,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 206 [2023-08-04 09:53:00,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 206 flow. Second operand has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 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 09:53:00,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:53:00,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 206 [2023-08-04 09:53:00,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:53:01,236 INFO L124 PetriNetUnfolderBase]: 9164/15172 cut-off events. [2023-08-04 09:53:01,236 INFO L125 PetriNetUnfolderBase]: For 2735/2735 co-relation queries the response was YES. [2023-08-04 09:53:01,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31941 conditions, 15172 events. 9164/15172 cut-off events. For 2735/2735 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 121464 event pairs, 4266 based on Foata normal form. 4/14754 useless extension candidates. Maximal degree in co-relation 23430. Up to 13133 conditions per place. [2023-08-04 09:53:01,317 INFO L140 encePairwiseOnDemand]: 202/206 looper letters, 48 selfloop transitions, 3 changer transitions 1/80 dead transitions. [2023-08-04 09:53:01,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 80 transitions, 332 flow [2023-08-04 09:53:01,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:53:01,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:53:01,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 470 transitions. [2023-08-04 09:53:01,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5703883495145631 [2023-08-04 09:53:01,319 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 470 transitions. [2023-08-04 09:53:01,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 470 transitions. [2023-08-04 09:53:01,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:53:01,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 470 transitions. [2023-08-04 09:53:01,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 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 09:53:01,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 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 09:53:01,323 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 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 09:53:01,323 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 206 flow. Second operand 4 states and 470 transitions. [2023-08-04 09:53:01,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 80 transitions, 332 flow [2023-08-04 09:53:01,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 80 transitions, 330 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:53:01,561 INFO L231 Difference]: Finished difference. Result has 77 places, 69 transitions, 218 flow [2023-08-04 09:53:01,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=77, PETRI_TRANSITIONS=69} [2023-08-04 09:53:01,561 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 11 predicate places. [2023-08-04 09:53:01,561 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 69 transitions, 218 flow [2023-08-04 09:53:01,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 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 09:53:01,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:53:01,562 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:53:01,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-04 09:53:01,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-04 09:53:01,768 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:53:01,768 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:53:01,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1775879066, now seen corresponding path program 1 times [2023-08-04 09:53:01,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:53:01,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464393277] [2023-08-04 09:53:01,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:53:01,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:53:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:53:01,825 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 09:53:01,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:53:01,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464393277] [2023-08-04 09:53:01,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464393277] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:53:01,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630693014] [2023-08-04 09:53:01,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:53:01,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:53:01,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:53:01,827 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:53:01,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-04 09:53:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:53:01,905 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:53:01,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:53:01,917 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 09:53:01,917 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:53:01,929 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 09:53:01,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630693014] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:53:01,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:53:01,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 09:53:01,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380477319] [2023-08-04 09:53:01,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:53:01,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:53:01,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:53:01,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:53:01,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:53:01,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 206 [2023-08-04 09:53:01,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 69 transitions, 218 flow. Second operand has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 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 09:53:01,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:53:01,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 206 [2023-08-04 09:53:01,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:53:02,998 INFO L124 PetriNetUnfolderBase]: 8732/13938 cut-off events. [2023-08-04 09:53:02,998 INFO L125 PetriNetUnfolderBase]: For 1877/1877 co-relation queries the response was YES. [2023-08-04 09:53:03,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29806 conditions, 13938 events. 8732/13938 cut-off events. For 1877/1877 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 106497 event pairs, 3064 based on Foata normal form. 64/13767 useless extension candidates. Maximal degree in co-relation 23262. Up to 10085 conditions per place. [2023-08-04 09:53:03,062 INFO L140 encePairwiseOnDemand]: 202/206 looper letters, 60 selfloop transitions, 3 changer transitions 1/92 dead transitions. [2023-08-04 09:53:03,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 92 transitions, 392 flow [2023-08-04 09:53:03,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:53:03,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:53:03,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2023-08-04 09:53:03,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5849514563106796 [2023-08-04 09:53:03,064 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 482 transitions. [2023-08-04 09:53:03,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 482 transitions. [2023-08-04 09:53:03,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:53:03,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 482 transitions. [2023-08-04 09:53:03,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 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 09:53:03,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 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 09:53:03,068 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 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 09:53:03,068 INFO L175 Difference]: Start difference. First operand has 77 places, 69 transitions, 218 flow. Second operand 4 states and 482 transitions. [2023-08-04 09:53:03,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 92 transitions, 392 flow [2023-08-04 09:53:03,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 92 transitions, 383 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 09:53:03,130 INFO L231 Difference]: Finished difference. Result has 79 places, 69 transitions, 223 flow [2023-08-04 09:53:03,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=223, PETRI_PLACES=79, PETRI_TRANSITIONS=69} [2023-08-04 09:53:03,130 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 13 predicate places. [2023-08-04 09:53:03,131 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 69 transitions, 223 flow [2023-08-04 09:53:03,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 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 09:53:03,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:53:03,131 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:53:03,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-04 09:53:03,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-04 09:53:03,337 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:53:03,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:53:03,337 INFO L85 PathProgramCache]: Analyzing trace with hash -512060752, now seen corresponding path program 1 times [2023-08-04 09:53:03,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:53:03,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615543289] [2023-08-04 09:53:03,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:53:03,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:53:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:53:03,423 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 09:53:03,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:53:03,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615543289] [2023-08-04 09:53:03,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615543289] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:53:03,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811648490] [2023-08-04 09:53:03,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:53:03,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:53:03,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:53:03,425 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:53:03,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-04 09:53:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:53:03,510 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:53:03,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:53:03,535 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 09:53:03,535 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:53:03,551 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 09:53:03,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811648490] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:53:03,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:53:03,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 09:53:03,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115132340] [2023-08-04 09:53:03,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:53:03,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:53:03,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:53:03,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:53:03,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:53:03,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 206 [2023-08-04 09:53:03,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 69 transitions, 223 flow. Second operand has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 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 09:53:03,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:53:03,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 206 [2023-08-04 09:53:03,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:53:04,231 INFO L124 PetriNetUnfolderBase]: 6080/9960 cut-off events. [2023-08-04 09:53:04,231 INFO L125 PetriNetUnfolderBase]: For 4205/4205 co-relation queries the response was YES. [2023-08-04 09:53:04,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21820 conditions, 9960 events. 6080/9960 cut-off events. For 4205/4205 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 73866 event pairs, 2353 based on Foata normal form. 256/9881 useless extension candidates. Maximal degree in co-relation 20099. Up to 3564 conditions per place. [2023-08-04 09:53:04,274 INFO L140 encePairwiseOnDemand]: 202/206 looper letters, 67 selfloop transitions, 4 changer transitions 0/99 dead transitions. [2023-08-04 09:53:04,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 99 transitions, 434 flow [2023-08-04 09:53:04,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:53:04,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:53:04,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2023-08-04 09:53:04,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5934466019417476 [2023-08-04 09:53:04,277 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 489 transitions. [2023-08-04 09:53:04,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 489 transitions. [2023-08-04 09:53:04,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:53:04,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 489 transitions. [2023-08-04 09:53:04,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 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 09:53:04,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 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 09:53:04,279 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 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 09:53:04,280 INFO L175 Difference]: Start difference. First operand has 79 places, 69 transitions, 223 flow. Second operand 4 states and 489 transitions. [2023-08-04 09:53:04,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 99 transitions, 434 flow [2023-08-04 09:53:04,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 99 transitions, 424 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 09:53:04,305 INFO L231 Difference]: Finished difference. Result has 81 places, 70 transitions, 234 flow [2023-08-04 09:53:04,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=81, PETRI_TRANSITIONS=70} [2023-08-04 09:53:04,306 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 15 predicate places. [2023-08-04 09:53:04,306 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 70 transitions, 234 flow [2023-08-04 09:53:04,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 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 09:53:04,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:53:04,307 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:53:04,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-04 09:53:04,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-04 09:53:04,512 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:53:04,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:53:04,513 INFO L85 PathProgramCache]: Analyzing trace with hash -829650321, now seen corresponding path program 1 times [2023-08-04 09:53:04,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:53:04,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669384075] [2023-08-04 09:53:04,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:53:04,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:53:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:53:04,621 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 09:53:04,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:53:04,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669384075] [2023-08-04 09:53:04,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669384075] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:53:04,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234357924] [2023-08-04 09:53:04,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:53:04,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:53:04,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:53:04,625 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:53:04,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-04 09:53:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:53:04,712 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:53:04,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:53:04,726 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 09:53:04,726 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:53:04,738 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 09:53:04,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234357924] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:53:04,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:53:04,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 09:53:04,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800933209] [2023-08-04 09:53:04,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:53:04,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:53:04,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:53:04,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:53:04,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:53:04,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 206 [2023-08-04 09:53:04,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 70 transitions, 234 flow. Second operand has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 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 09:53:04,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:53:04,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 206 [2023-08-04 09:53:04,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:53:05,552 INFO L124 PetriNetUnfolderBase]: 6068/10165 cut-off events. [2023-08-04 09:53:05,552 INFO L125 PetriNetUnfolderBase]: For 6106/6106 co-relation queries the response was YES. [2023-08-04 09:53:05,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23160 conditions, 10165 events. 6068/10165 cut-off events. For 6106/6106 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 77178 event pairs, 5681 based on Foata normal form. 17/9811 useless extension candidates. Maximal degree in co-relation 21410. Up to 8085 conditions per place. [2023-08-04 09:53:05,625 INFO L140 encePairwiseOnDemand]: 202/206 looper letters, 67 selfloop transitions, 3 changer transitions 2/100 dead transitions. [2023-08-04 09:53:05,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 100 transitions, 446 flow [2023-08-04 09:53:05,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:53:05,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:53:05,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2023-08-04 09:53:05,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5934466019417476 [2023-08-04 09:53:05,628 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 489 transitions. [2023-08-04 09:53:05,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 489 transitions. [2023-08-04 09:53:05,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:53:05,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 489 transitions. [2023-08-04 09:53:05,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 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 09:53:05,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 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 09:53:05,631 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 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 09:53:05,631 INFO L175 Difference]: Start difference. First operand has 81 places, 70 transitions, 234 flow. Second operand 4 states and 489 transitions. [2023-08-04 09:53:05,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 100 transitions, 446 flow [2023-08-04 09:53:05,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 100 transitions, 442 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 09:53:05,679 INFO L231 Difference]: Finished difference. Result has 85 places, 69 transitions, 238 flow [2023-08-04 09:53:05,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=238, PETRI_PLACES=85, PETRI_TRANSITIONS=69} [2023-08-04 09:53:05,681 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 19 predicate places. [2023-08-04 09:53:05,681 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 69 transitions, 238 flow [2023-08-04 09:53:05,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 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 09:53:05,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:53:05,682 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:53:05,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-04 09:53:05,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-04 09:53:05,888 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:53:05,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:53:05,889 INFO L85 PathProgramCache]: Analyzing trace with hash -239119082, now seen corresponding path program 1 times [2023-08-04 09:53:05,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:53:05,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063140842] [2023-08-04 09:53:05,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:53:05,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:53:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 09:53:05,939 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 09:53:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 09:53:05,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 09:53:05,998 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 09:53:05,998 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 09:53:05,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-04 09:53:05,998 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:53:05,999 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE (1/2) [2023-08-04 09:53:06,001 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 09:53:06,001 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 09:53:06,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:53:06 BasicIcfg [2023-08-04 09:53:06,110 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 09:53:06,111 INFO L158 Benchmark]: Toolchain (without parser) took 22191.23ms. Allocated memory was 375.4MB in the beginning and 7.4GB in the end (delta: 7.0GB). Free memory was 328.2MB in the beginning and 5.9GB in the end (delta: -5.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB. [2023-08-04 09:53:06,111 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 375.4MB. Free memory is still 326.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 09:53:06,111 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.83ms. Allocated memory is still 375.4MB. Free memory was 328.0MB in the beginning and 316.6MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-04 09:53:06,111 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.10ms. Allocated memory is still 375.4MB. Free memory was 316.6MB in the beginning and 314.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 09:53:06,111 INFO L158 Benchmark]: Boogie Preprocessor took 23.61ms. Allocated memory is still 375.4MB. Free memory was 314.7MB in the beginning and 313.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 09:53:06,112 INFO L158 Benchmark]: RCFGBuilder took 379.48ms. Allocated memory is still 375.4MB. Free memory was 313.1MB in the beginning and 296.0MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2023-08-04 09:53:06,112 INFO L158 Benchmark]: TraceAbstraction took 21498.09ms. Allocated memory was 375.4MB in the beginning and 7.4GB in the end (delta: 7.0GB). Free memory was 295.2MB in the beginning and 5.9GB in the end (delta: -5.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB. [2023-08-04 09:53:06,114 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.11ms. Allocated memory is still 375.4MB. Free memory is still 326.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 243.83ms. Allocated memory is still 375.4MB. Free memory was 328.0MB in the beginning and 316.6MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 37.10ms. Allocated memory is still 375.4MB. Free memory was 316.6MB in the beginning and 314.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 23.61ms. Allocated memory is still 375.4MB. Free memory was 314.7MB in the beginning and 313.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 379.48ms. Allocated memory is still 375.4MB. Free memory was 313.1MB in the beginning and 296.0MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 21498.09ms. Allocated memory was 375.4MB in the beginning and 7.4GB in the end (delta: 7.0GB). Free memory was 295.2MB in the beginning and 5.9GB in the end (delta: -5.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 94 PlacesBefore, 40 PlacesAfterwards, 98 TransitionsBefore, 39 TransitionsAfterwards, 2244 CoEnabledTransitionPairs, 5 FixpointIterations, 20 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 5 ChoiceCompositions, 68 TotalNumberOfCompositions, 8729 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4156, independent: 3944, independent conditional: 0, independent unconditional: 3944, dependent: 212, dependent conditional: 0, dependent unconditional: 212, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1144, independent: 1120, independent conditional: 0, independent unconditional: 1120, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4156, independent: 2824, independent conditional: 0, independent unconditional: 2824, dependent: 188, dependent conditional: 0, dependent unconditional: 188, unknown: 1144, unknown conditional: 0, unknown unconditional: 1144] , Statistics on independence cache: Total cache size (in pairs): 252, Positive cache size: 236, Positive conditional cache size: 0, Positive unconditional cache size: 236, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 72 PlacesBefore, 32 PlacesAfterwards, 68 TransitionsBefore, 27 TransitionsAfterwards, 990 CoEnabledTransitionPairs, 5 FixpointIterations, 20 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 44 TotalNumberOfCompositions, 4002 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1831, independent: 1639, independent conditional: 0, independent unconditional: 1639, dependent: 192, dependent conditional: 0, dependent unconditional: 192, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 456, independent: 441, independent conditional: 0, independent unconditional: 441, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1831, independent: 1198, independent conditional: 0, independent unconditional: 1198, dependent: 177, dependent conditional: 0, dependent unconditional: 177, unknown: 456, unknown conditional: 0, unknown unconditional: 456] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 88, Positive conditional cache size: 0, Positive unconditional cache size: 88, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 122 PlacesBefore, 66 PlacesAfterwards, 126 TransitionsBefore, 65 TransitionsAfterwards, 5896 CoEnabledTransitionPairs, 5 FixpointIterations, 20 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 5 ChoiceCompositions, 70 TotalNumberOfCompositions, 31419 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11585, independent: 11165, independent conditional: 0, independent unconditional: 11165, dependent: 420, dependent conditional: 0, dependent unconditional: 420, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2656, independent: 2606, independent conditional: 0, independent unconditional: 2606, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11585, independent: 8559, independent conditional: 0, independent unconditional: 8559, dependent: 370, dependent conditional: 0, dependent unconditional: 370, unknown: 2656, unknown conditional: 0, unknown unconditional: 2656] , Statistics on independence cache: Total cache size (in pairs): 677, Positive cache size: 644, Positive conditional cache size: 0, Positive unconditional cache size: 644, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 116]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] 0 _Bool e1, e2; [L39] 0 int n1, n2, tmp1, tmp2, i, i1, i2; [L107] 0 pthread_t t1[2], t2[2]; [L110] 0 int asdf=0; VAL [asdf=0, e1=0, e2=0, i=0, i=0, i=0, n1=0, n2=0, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L110] COND TRUE 0 asdf<2 [L110] FCALL, FORK 0 pthread_create(&t1[asdf], 0, thread1, 0) VAL [asdf=0, e1=0, e2=0, i=0, i=0, i=0, n1=0, n2=0, pthread_create(&t1[asdf], 0, thread1, 0)=2147483644, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L44] 1 e1 = 1 VAL [e1=1, e2=0, i=0, i=0, i=0, n1=0, n2=0, tmp1=0, tmp2=0] [L47] 1 tmp1 = n2 VAL [e1=1, e2=0, i=0, i=0, i=0, n1=0, n2=0, tmp1=0, tmp2=0] [L50] 1 n1 = tmp1 + 1 VAL [e1=1, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] [L53] 1 e1 = 0 VAL [e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] [L56] CALL 1 assume_abort_if_not(!e2) [L35] COND FALSE 1 !(!cond) [L56] RET 1 assume_abort_if_not(!e2) [L110] 0 asdf++ VAL [asdf=1, e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L110] COND TRUE 0 asdf<2 [L110] FCALL, FORK 0 pthread_create(&t1[asdf], 0, thread1, 0) VAL [asdf=1, e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0, pthread_create(&t1[asdf], 0, thread1, 0)=2147483645, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L44] 2 e1 = 1 VAL [e1=1, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] [L47] 2 tmp1 = n2 VAL [e1=1, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] [L50] 2 n1 = tmp1 + 1 VAL [e1=1, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] [L53] 2 e1 = 0 VAL [e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] [L56] CALL 2 assume_abort_if_not(!e2) [L35] COND FALSE 2 !(!cond) [L56] RET 2 assume_abort_if_not(!e2) [L110] 0 asdf++ VAL [asdf=2, e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L59] CALL 1 assume_abort_if_not(n2 == 0 || n2 >= n1) [L35] COND FALSE 1 !(!cond) [L59] RET 1 assume_abort_if_not(n2 == 0 || n2 >= n1) [L62] 1 i1 = i VAL [e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] [L65] 1 i = i1 + 1 VAL [e1=0, e2=0, i=0, i=0, i=1, n1=1, n2=0, tmp1=0, tmp2=0] [L68] 1 n1 = 0 [L71] 1 return 0; [L110] COND FALSE 0 !(asdf<2) [L111] 0 int asdf=0; VAL [asdf=0, asdf=2, e1=0, e2=0, i=0, i=0, i=1, n1=0, n2=0, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L111] COND TRUE 0 asdf<2 [L111] FCALL, FORK 0 pthread_create(&t2[asdf], 0, thread2, 0) VAL [asdf=0, asdf=2, e1=0, e2=0, i=0, i=0, i=1, n1=0, n2=0, pthread_create(&t2[asdf], 0, thread2, 0)=2147483646, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L76] 3 e2 = 1 VAL [e1=0, e2=1, i=0, i=0, i=1, n1=0, n2=0, tmp1=0, tmp2=0] [L79] 3 tmp2 = n1 VAL [e1=0, e2=1, i=0, i=0, i=1, n1=0, n2=0, tmp1=0, tmp2=0] [L82] 3 n2 = tmp2 + 1 VAL [e1=0, e2=1, i=0, i=0, i=1, n1=0, n2=1, tmp1=0, tmp2=0] [L85] 3 e2 = 0 VAL [e1=0, e2=0, i=0, i=0, i=1, n1=0, n2=1, tmp1=0, tmp2=0] [L88] CALL 3 assume_abort_if_not(!e1) [L35] COND FALSE 3 !(!cond) [L88] RET 3 assume_abort_if_not(!e1) [L59] CALL 2 assume_abort_if_not(n2 == 0 || n2 >= n1) [L35] COND FALSE 2 !(!cond) [L59] RET 2 assume_abort_if_not(n2 == 0 || n2 >= n1) [L62] 2 i1 = i VAL [\result={0:0}, e1=0, e2=0, i=0, i=1, i=1, n1=0, n2=1, tmp1=0, tmp2=0] [L65] 2 i = i1 + 1 VAL [\result={0:0}, e1=0, e2=0, i=0, i=1, i=2, n1=0, n2=1, tmp1=0, tmp2=0] [L68] 2 n1 = 0 [L71] 2 return 0; [L111] 0 asdf++ VAL [asdf=1, asdf=2, e1=0, e2=0, i=0, i=1, i=2, n1=0, n2=1, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L111] COND TRUE 0 asdf<2 [L111] FCALL, FORK 0 pthread_create(&t2[asdf], 0, thread2, 0) VAL [asdf=1, asdf=2, e1=0, e2=0, i=0, i=1, i=2, n1=0, n2=1, pthread_create(&t2[asdf], 0, thread2, 0)=2147483647, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L76] 4 e2 = 1 VAL [e1=0, e2=1, i=0, i=1, i=2, n1=0, n2=1, tmp1=0, tmp2=0] [L79] 4 tmp2 = n1 VAL [e1=0, e2=1, i=0, i=1, i=2, n1=0, n2=1, tmp1=0, tmp2=0] [L82] 4 n2 = tmp2 + 1 VAL [e1=0, e2=1, i=0, i=1, i=2, n1=0, n2=1, tmp1=0, tmp2=0] [L85] 4 e2 = 0 VAL [e1=0, e2=0, i=0, i=1, i=2, n1=0, n2=1, tmp1=0, tmp2=0] [L88] CALL 4 assume_abort_if_not(!e1) [L35] COND FALSE 4 !(!cond) [L88] RET 4 assume_abort_if_not(!e1) [L111] 0 asdf++ VAL [asdf=2, asdf=2, e1=0, e2=0, i=0, i=1, i=2, n1=0, n2=1, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L91] CALL 3 assume_abort_if_not(n1 == 0 || n1 > n2) [L35] COND FALSE 3 !(!cond) [L91] RET 3 assume_abort_if_not(n1 == 0 || n1 > n2) [L94] 3 i2 = i VAL [e1=0, e2=0, i=1, i=2, i=2, n1=0, n2=1, tmp1=0, tmp2=0] [L97] 3 i = i2 + 1 VAL [e1=0, e2=0, i=1, i=2, i=3, n1=0, n2=1, tmp1=0, tmp2=0] [L100] 3 n2 = 0 [L103] 3 return 0; [L111] COND FALSE 0 !(asdf<2) [L112] 0 int asdf=0; VAL [asdf=0, asdf=2, asdf=2, e1=0, e2=0, i=1, i=2, i=3, n1=0, n2=0, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L112] COND TRUE 0 asdf<2 [L112] 0 t1[asdf] VAL [asdf=0, asdf=2, asdf=2, e1=0, e2=0, i=1, i=2, i=3, n1=0, n2=0, t1={3:0}, t1[asdf]=2147483644, t2={5:0}, tmp1=0, tmp2=0] [L91] CALL 4 assume_abort_if_not(n1 == 0 || n1 > n2) [L35] COND FALSE 4 !(!cond) [L91] RET 4 assume_abort_if_not(n1 == 0 || n1 > n2) [L94] 4 i2 = i VAL [\result={0:0}, e1=0, e2=0, i=1, i=3, i=3, n1=0, n2=0, tmp1=0, tmp2=0] [L97] 4 i = i2 + 1 VAL [\result={0:0}, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, tmp1=0, tmp2=0] [L100] 4 n2 = 0 [L103] 4 return 0; [L112] FCALL, JOIN 1 pthread_join(t1[asdf], 0) VAL [asdf=0, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t1[asdf]=2147483644, t2={5:0}, tmp1=0, tmp2=0] [L112] 0 asdf++ VAL [asdf=1, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L112] COND TRUE 0 asdf<2 [L112] 0 t1[asdf] VAL [asdf=1, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t1[asdf]=2147483645, t2={5:0}, tmp1=0, tmp2=0] [L112] FCALL, JOIN 2 pthread_join(t1[asdf], 0) VAL [asdf=1, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t1[asdf]=2147483645, t2={5:0}, tmp1=0, tmp2=0] [L112] 0 asdf++ VAL [asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L112] COND FALSE 0 !(asdf<2) [L113] 0 int asdf=0; VAL [asdf=0, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L113] COND TRUE 0 asdf<2 [L113] 0 t2[asdf] VAL [asdf=0, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t2={5:0}, t2[asdf]=2147483646, tmp1=0, tmp2=0] [L113] FCALL, JOIN 3 pthread_join(t2[asdf], 0) VAL [asdf=0, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t2={5:0}, t2[asdf]=2147483646, tmp1=0, tmp2=0] [L113] 0 asdf++ VAL [asdf=1, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L113] COND TRUE 0 asdf<2 [L113] 0 t2[asdf] VAL [asdf=1, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t2={5:0}, t2[asdf]=2147483647, tmp1=0, tmp2=0] [L113] FCALL, JOIN 4 pthread_join(t2[asdf], 0) VAL [asdf=1, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t2={5:0}, t2[asdf]=2147483647, tmp1=0, tmp2=0] [L113] 0 asdf++ VAL [asdf=2, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L113] COND FALSE 0 !(asdf<2) [L115] CALL 0 assume_abort_if_not(i != 2) [L35] COND FALSE 0 !(!cond) [L115] RET 0 assume_abort_if_not(i != 2) [L116] 0 reach_error() VAL [asdf=2, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 124 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: 4.4s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 112 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 280 IncrementalHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 8 mSDtfsCounter, 280 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=4, InterpolantAutomatonStates: 16, 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.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 165 NumberOfCodeBlocks, 165 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 288 SizeOfPredicates, 0 NumberOfNonLiveVariables, 511 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 18/24 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, 148 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: 15.4s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 299 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 221 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 919 IncrementalHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 9 mSDtfsCounter, 919 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 440 GetRequests, 410 SyntacticMatches, 8 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=238occurred in iteration=8, InterpolantAutomatonStates: 28, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 552 NumberOfCodeBlocks, 552 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 649 ConstructedInterpolants, 0 QuantifiedInterpolants, 847 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1158 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 19 InterpolantComputations, 4 PerfectInterpolantSequences, 132/147 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, 124 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.4s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred 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 09:53:06,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...