/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread_stateful01-2_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 07:56:46,843 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 07:56:46,880 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 07:56:46,883 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 07:56:46,884 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 07:56:46,884 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 07:56:46,884 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 07:56:46,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 07:56:46,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 07:56:46,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 07:56:46,900 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 07:56:46,901 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 07:56:46,901 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 07:56:46,901 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 07:56:46,902 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 07:56:46,902 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 07:56:46,902 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 07:56:46,902 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 07:56:46,903 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 07:56:46,903 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 07:56:46,903 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 07:56:46,906 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 07:56:46,906 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 07:56:46,907 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 07:56:46,907 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 07:56:46,907 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 07:56:46,907 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 07:56:46,908 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 07:56:46,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 07:56:46,908 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 07:56:46,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 07:56:46,909 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 07:56:46,909 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 07:56:46,909 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 07:56:46,909 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 07:56:46,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 07:56:46,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 07:56:46,910 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 07:56:46,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 07:56:46,911 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 07:56:46,911 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 07:56:46,916 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-04 07:56:47,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 07:56:47,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 07:56:47,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 07:56:47,075 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 07:56:47,076 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 07:56:47,077 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread_stateful01-2_bound2.i [2023-08-04 07:56:48,117 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 07:56:48,385 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 07:56:48,386 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread_stateful01-2_bound2.i [2023-08-04 07:56:48,396 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f434d5e98/9243aadcd33e4813b1fb38a941aa4a61/FLAG0c32b44d5 [2023-08-04 07:56:48,407 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f434d5e98/9243aadcd33e4813b1fb38a941aa4a61 [2023-08-04 07:56:48,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 07:56:48,411 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 07:56:48,413 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 07:56:48,413 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 07:56:48,416 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 07:56:48,416 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 07:56:48" (1/1) ... [2023-08-04 07:56:48,417 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f09ba5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:56:48, skipping insertion in model container [2023-08-04 07:56:48,417 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 07:56:48" (1/1) ... [2023-08-04 07:56:48,449 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 07:56:48,742 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread_stateful01-2_bound2.i[30988,31001] [2023-08-04 07:56:48,743 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 07:56:48,756 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 07:56:48,771 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [257] [2023-08-04 07:56:48,773 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [257] [2023-08-04 07:56:48,794 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread_stateful01-2_bound2.i[30988,31001] [2023-08-04 07:56:48,795 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 07:56:48,827 INFO L206 MainTranslator]: Completed translation [2023-08-04 07:56:48,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:56:48 WrapperNode [2023-08-04 07:56:48,828 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 07:56:48,828 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 07:56:48,829 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 07:56:48,829 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 07:56:48,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:56:48" (1/1) ... [2023-08-04 07:56:48,846 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:56:48" (1/1) ... [2023-08-04 07:56:48,865 INFO L138 Inliner]: procedures = 168, calls = 34, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 95 [2023-08-04 07:56:48,865 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 07:56:48,866 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 07:56:48,866 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 07:56:48,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 07:56:48,879 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:56:48" (1/1) ... [2023-08-04 07:56:48,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:56:48" (1/1) ... [2023-08-04 07:56:48,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:56:48" (1/1) ... [2023-08-04 07:56:48,882 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:56:48" (1/1) ... [2023-08-04 07:56:48,887 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:56:48" (1/1) ... [2023-08-04 07:56:48,890 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:56:48" (1/1) ... [2023-08-04 07:56:48,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:56:48" (1/1) ... [2023-08-04 07:56:48,892 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:56:48" (1/1) ... [2023-08-04 07:56:48,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 07:56:48,895 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 07:56:48,895 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 07:56:48,895 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 07:56:48,896 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:56:48" (1/1) ... [2023-08-04 07:56:48,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 07:56:48,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:56:48,920 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-04 07:56:48,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-04 07:56:48,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 07:56:48,947 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-04 07:56:48,947 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-04 07:56:48,947 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-04 07:56:48,947 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-04 07:56:48,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 07:56:48,948 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-04 07:56:48,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 07:56:48,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 07:56:48,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 07:56:48,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 07:56:48,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 07:56:48,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 07:56:48,949 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 07:56:49,049 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 07:56:49,050 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 07:56:49,185 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 07:56:49,194 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 07:56:49,194 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-04 07:56:49,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 07:56:49 BoogieIcfgContainer [2023-08-04 07:56:49,196 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 07:56:49,197 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 07:56:49,197 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 07:56:49,199 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 07:56:49,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 07:56:48" (1/3) ... [2023-08-04 07:56:49,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a6d96d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 07:56:49, skipping insertion in model container [2023-08-04 07:56:49,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:56:48" (2/3) ... [2023-08-04 07:56:49,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a6d96d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 07:56:49, skipping insertion in model container [2023-08-04 07:56:49,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 07:56:49" (3/3) ... [2023-08-04 07:56:49,202 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread_stateful01-2_bound2.i [2023-08-04 07:56:49,207 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 07:56:49,214 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 07:56:49,215 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 07:56:49,215 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 07:56:49,279 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-04 07:56:49,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 119 transitions, 260 flow [2023-08-04 07:56:49,364 INFO L124 PetriNetUnfolderBase]: 26/248 cut-off events. [2023-08-04 07:56:49,364 INFO L125 PetriNetUnfolderBase]: For 8/14 co-relation queries the response was YES. [2023-08-04 07:56:49,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 248 events. 26/248 cut-off events. For 8/14 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 848 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 131. Up to 8 conditions per place. [2023-08-04 07:56:49,369 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 119 transitions, 260 flow [2023-08-04 07:56:49,373 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 107 transitions, 232 flow [2023-08-04 07:56:49,376 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 07:56:49,383 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 107 transitions, 232 flow [2023-08-04 07:56:49,386 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 107 transitions, 232 flow [2023-08-04 07:56:49,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 107 transitions, 232 flow [2023-08-04 07:56:49,418 INFO L124 PetriNetUnfolderBase]: 22/205 cut-off events. [2023-08-04 07:56:49,418 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 07:56:49,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 205 events. 22/205 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 598 event pairs, 0 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 109. Up to 8 conditions per place. [2023-08-04 07:56:49,421 INFO L119 LiptonReduction]: Number of co-enabled transitions 2436 [2023-08-04 07:56:51,790 INFO L134 LiptonReduction]: Checked pairs total: 6628 [2023-08-04 07:56:51,791 INFO L136 LiptonReduction]: Total number of compositions: 76 [2023-08-04 07:56:51,803 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 07:56:51,807 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;@1b5ef128, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 07:56:51,808 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 07:56:51,810 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 07:56:51,810 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-08-04 07:56:51,811 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:56:51,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:56:51,811 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 07:56:51,811 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:56:51,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:56:51,814 INFO L85 PathProgramCache]: Analyzing trace with hash 392158832, now seen corresponding path program 1 times [2023-08-04 07:56:51,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:56:51,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144977562] [2023-08-04 07:56:51,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:56:51,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:56:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:56:51,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 07:56:51,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:56:51,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144977562] [2023-08-04 07:56:51,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144977562] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:56:51,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:56:51,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:56:51,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283153278] [2023-08-04 07:56:51,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:56:51,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:56:51,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:56:51,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:56:51,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:56:51,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 195 [2023-08-04 07:56:51,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:56:51,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:56:51,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 195 [2023-08-04 07:56:51,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:56:52,131 INFO L124 PetriNetUnfolderBase]: 381/725 cut-off events. [2023-08-04 07:56:52,131 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-08-04 07:56:52,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1449 conditions, 725 events. 381/725 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3854 event pairs, 147 based on Foata normal form. 0/587 useless extension candidates. Maximal degree in co-relation 1289. Up to 675 conditions per place. [2023-08-04 07:56:52,136 INFO L140 encePairwiseOnDemand]: 192/195 looper letters, 30 selfloop transitions, 2 changer transitions 1/41 dead transitions. [2023-08-04 07:56:52,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 166 flow [2023-08-04 07:56:52,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:56:52,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:56:52,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2023-08-04 07:56:52,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5863247863247864 [2023-08-04 07:56:52,146 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 343 transitions. [2023-08-04 07:56:52,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 343 transitions. [2023-08-04 07:56:52,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:56:52,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 343 transitions. [2023-08-04 07:56:52,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:56:52,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:56:52,154 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:56:52,156 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 88 flow. Second operand 3 states and 343 transitions. [2023-08-04 07:56:52,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 166 flow [2023-08-04 07:56:52,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 07:56:52,159 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 90 flow [2023-08-04 07:56:52,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2023-08-04 07:56:52,162 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2023-08-04 07:56:52,162 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 90 flow [2023-08-04 07:56:52,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:56:52,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:56:52,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:56:52,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 07:56:52,163 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:56:52,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:56:52,164 INFO L85 PathProgramCache]: Analyzing trace with hash -2119778158, now seen corresponding path program 1 times [2023-08-04 07:56:52,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:56:52,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40295075] [2023-08-04 07:56:52,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:56:52,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:56:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:56:52,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 07:56:52,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:56:52,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40295075] [2023-08-04 07:56:52,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40295075] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:56:52,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429555083] [2023-08-04 07:56:52,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:56:52,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:56:52,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:56:52,294 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 07:56:52,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-04 07:56:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:56:52,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 07:56:52,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:56:52,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 07:56:52,372 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 07:56:52,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429555083] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:56:52,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 07:56:52,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 07:56:52,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044981911] [2023-08-04 07:56:52,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:56:52,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:56:52,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:56:52,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:56:52,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:56:52,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 195 [2023-08-04 07:56:52,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:56:52,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:56:52,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 195 [2023-08-04 07:56:52,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:56:52,469 INFO L124 PetriNetUnfolderBase]: 375/725 cut-off events. [2023-08-04 07:56:52,469 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-08-04 07:56:52,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1457 conditions, 725 events. 375/725 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3590 event pairs, 272 based on Foata normal form. 0/610 useless extension candidates. Maximal degree in co-relation 1406. Up to 611 conditions per place. [2023-08-04 07:56:52,474 INFO L140 encePairwiseOnDemand]: 192/195 looper letters, 33 selfloop transitions, 2 changer transitions 1/44 dead transitions. [2023-08-04 07:56:52,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 44 transitions, 180 flow [2023-08-04 07:56:52,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:56:52,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:56:52,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-08-04 07:56:52,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5914529914529915 [2023-08-04 07:56:52,482 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-08-04 07:56:52,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-08-04 07:56:52,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:56:52,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-08-04 07:56:52,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:56:52,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:56:52,490 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:56:52,490 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 90 flow. Second operand 3 states and 346 transitions. [2023-08-04 07:56:52,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 44 transitions, 180 flow [2023-08-04 07:56:52,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 44 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 07:56:52,492 INFO L231 Difference]: Finished difference. Result has 38 places, 35 transitions, 94 flow [2023-08-04 07:56:52,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=38, PETRI_TRANSITIONS=35} [2023-08-04 07:56:52,493 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2023-08-04 07:56:52,493 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 35 transitions, 94 flow [2023-08-04 07:56:52,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:56:52,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:56:52,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:56:52,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-04 07:56:52,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:56:52,699 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:56:52,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:56:52,700 INFO L85 PathProgramCache]: Analyzing trace with hash -993730821, now seen corresponding path program 1 times [2023-08-04 07:56:52,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:56:52,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115408196] [2023-08-04 07:56:52,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:56:52,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:56:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:56:52,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 07:56:52,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:56:52,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115408196] [2023-08-04 07:56:52,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115408196] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:56:52,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224669468] [2023-08-04 07:56:52,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:56:52,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:56:52,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:56:52,772 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 07:56:52,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-04 07:56:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:56:52,865 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 07:56:52,866 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:56:52,873 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 07:56:52,873 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 07:56:52,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224669468] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:56:52,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 07:56:52,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 07:56:52,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215008358] [2023-08-04 07:56:52,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:56:52,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:56:52,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:56:52,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:56:52,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:56:52,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 195 [2023-08-04 07:56:52,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 35 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:56:52,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:56:52,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 195 [2023-08-04 07:56:52,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:56:52,946 INFO L124 PetriNetUnfolderBase]: 243/489 cut-off events. [2023-08-04 07:56:52,946 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2023-08-04 07:56:52,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1069 conditions, 489 events. 243/489 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2148 event pairs, 164 based on Foata normal form. 0/445 useless extension candidates. Maximal degree in co-relation 512. Up to 321 conditions per place. [2023-08-04 07:56:52,947 INFO L140 encePairwiseOnDemand]: 192/195 looper letters, 37 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-08-04 07:56:52,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 47 transitions, 200 flow [2023-08-04 07:56:52,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:56:52,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:56:52,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2023-08-04 07:56:52,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5965811965811966 [2023-08-04 07:56:52,949 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions. [2023-08-04 07:56:52,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions. [2023-08-04 07:56:52,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:56:52,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions. [2023-08-04 07:56:52,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:56:52,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:56:52,951 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:56:52,952 INFO L175 Difference]: Start difference. First operand has 38 places, 35 transitions, 94 flow. Second operand 3 states and 349 transitions. [2023-08-04 07:56:52,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 47 transitions, 200 flow [2023-08-04 07:56:52,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 47 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 07:56:52,954 INFO L231 Difference]: Finished difference. Result has 39 places, 36 transitions, 102 flow [2023-08-04 07:56:52,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=39, PETRI_TRANSITIONS=36} [2023-08-04 07:56:52,955 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2023-08-04 07:56:52,955 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 102 flow [2023-08-04 07:56:52,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:56:52,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:56:52,956 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] [2023-08-04 07:56:52,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-04 07:56:53,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-08-04 07:56:53,161 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:56:53,162 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:56:53,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1336108590, now seen corresponding path program 1 times [2023-08-04 07:56:53,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:56:53,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404978694] [2023-08-04 07:56:53,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:56:53,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:56:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:56:53,250 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 07:56:53,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:56:53,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404978694] [2023-08-04 07:56:53,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404978694] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:56:53,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322972342] [2023-08-04 07:56:53,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:56:53,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:56:53,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:56:53,252 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 07:56:53,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-04 07:56:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:56:53,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 07:56:53,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:56:53,367 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 07:56:53,367 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 07:56:53,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322972342] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:56:53,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 07:56:53,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-04 07:56:53,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403061918] [2023-08-04 07:56:53,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:56:53,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:56:53,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:56:53,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:56:53,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:56:53,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 195 [2023-08-04 07:56:53,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 102 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 07:56:53,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:56:53,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 195 [2023-08-04 07:56:53,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:56:53,459 INFO L124 PetriNetUnfolderBase]: 234/472 cut-off events. [2023-08-04 07:56:53,460 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2023-08-04 07:56:53,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1062 conditions, 472 events. 234/472 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2025 event pairs, 217 based on Foata normal form. 0/445 useless extension candidates. Maximal degree in co-relation 513. Up to 406 conditions per place. [2023-08-04 07:56:53,463 INFO L140 encePairwiseOnDemand]: 192/195 looper letters, 33 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2023-08-04 07:56:53,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 45 transitions, 194 flow [2023-08-04 07:56:53,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:56:53,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:56:53,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-08-04 07:56:53,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5914529914529915 [2023-08-04 07:56:53,469 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-08-04 07:56:53,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-08-04 07:56:53,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:56:53,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-08-04 07:56:53,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:56:53,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:56:53,471 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:56:53,471 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 102 flow. Second operand 3 states and 346 transitions. [2023-08-04 07:56:53,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 45 transitions, 194 flow [2023-08-04 07:56:53,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 192 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:56:53,476 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 104 flow [2023-08-04 07:56:53,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2023-08-04 07:56:53,477 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2023-08-04 07:56:53,477 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 104 flow [2023-08-04 07:56:53,478 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 07:56:53,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:56:53,478 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] [2023-08-04 07:56:53,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-04 07:56:53,684 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 07:56:53,685 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:56:53,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:56:53,685 INFO L85 PathProgramCache]: Analyzing trace with hash 2006019501, now seen corresponding path program 1 times [2023-08-04 07:56:53,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:56:53,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233921219] [2023-08-04 07:56:53,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:56:53,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:56:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:56:53,805 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 07:56:53,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:56:53,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233921219] [2023-08-04 07:56:53,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233921219] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:56:53,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940783296] [2023-08-04 07:56:53,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:56:53,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:56:53,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:56:53,809 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 07:56:53,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-04 07:56:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:56:53,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 07:56:53,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:56:53,949 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 07:56:53,949 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:56:53,978 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 07:56:53,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940783296] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:56:53,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:56:53,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 07:56:53,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820777702] [2023-08-04 07:56:53,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:56:53,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 07:56:53,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:56:53,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 07:56:53,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:56:53,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 195 [2023-08-04 07:56:53,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 104 flow. Second operand has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:56:53,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:56:53,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 195 [2023-08-04 07:56:53,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:56:54,010 INFO L124 PetriNetUnfolderBase]: 10/33 cut-off events. [2023-08-04 07:56:54,010 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:56:54,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 33 events. 10/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 6/38 useless extension candidates. Maximal degree in co-relation 70. Up to 22 conditions per place. [2023-08-04 07:56:54,011 INFO L140 encePairwiseOnDemand]: 192/195 looper letters, 0 selfloop transitions, 0 changer transitions 18/18 dead transitions. [2023-08-04 07:56:54,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 70 flow [2023-08-04 07:56:54,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:56:54,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:56:54,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 424 transitions. [2023-08-04 07:56:54,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5435897435897435 [2023-08-04 07:56:54,012 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 424 transitions. [2023-08-04 07:56:54,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 424 transitions. [2023-08-04 07:56:54,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:56:54,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 424 transitions. [2023-08-04 07:56:54,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:56:54,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:56:54,016 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:56:54,016 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 104 flow. Second operand 4 states and 424 transitions. [2023-08-04 07:56:54,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 70 flow [2023-08-04 07:56:54,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 18 transitions, 68 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:56:54,016 INFO L231 Difference]: Finished difference. Result has 22 places, 0 transitions, 0 flow [2023-08-04 07:56:54,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=26, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=22, PETRI_TRANSITIONS=0} [2023-08-04 07:56:54,018 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -14 predicate places. [2023-08-04 07:56:54,019 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 0 transitions, 0 flow [2023-08-04 07:56:54,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:56:54,021 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 07:56:54,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-04 07:56:54,236 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 07:56:54,237 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-04 07:56:54,240 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2023-08-04 07:56:54,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 119 transitions, 260 flow [2023-08-04 07:56:54,261 INFO L124 PetriNetUnfolderBase]: 26/248 cut-off events. [2023-08-04 07:56:54,261 INFO L125 PetriNetUnfolderBase]: For 8/14 co-relation queries the response was YES. [2023-08-04 07:56:54,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 248 events. 26/248 cut-off events. For 8/14 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 848 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 131. Up to 8 conditions per place. [2023-08-04 07:56:54,261 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 119 transitions, 260 flow [2023-08-04 07:56:54,262 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 83 transitions, 176 flow [2023-08-04 07:56:54,262 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 07:56:54,262 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 83 transitions, 176 flow [2023-08-04 07:56:54,262 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 83 transitions, 176 flow [2023-08-04 07:56:54,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 83 transitions, 176 flow [2023-08-04 07:56:54,270 INFO L124 PetriNetUnfolderBase]: 2/120 cut-off events. [2023-08-04 07:56:54,270 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:56:54,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 120 events. 2/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 209 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 79. Up to 4 conditions per place. [2023-08-04 07:56:54,271 INFO L119 LiptonReduction]: Number of co-enabled transitions 1270 [2023-08-04 07:56:56,523 INFO L134 LiptonReduction]: Checked pairs total: 3087 [2023-08-04 07:56:56,523 INFO L136 LiptonReduction]: Total number of compositions: 63 [2023-08-04 07:56:56,525 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 07:56:56,525 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;@1b5ef128, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 07:56:56,525 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 07:56:56,527 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 07:56:56,527 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2023-08-04 07:56:56,527 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:56:56,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:56:56,527 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 07:56:56,527 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 07:56:56,528 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:56:56,528 INFO L85 PathProgramCache]: Analyzing trace with hash 452978408, now seen corresponding path program 1 times [2023-08-04 07:56:56,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:56:56,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505616995] [2023-08-04 07:56:56,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:56:56,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:56:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:56:56,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 07:56:56,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:56:56,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505616995] [2023-08-04 07:56:56,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505616995] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:56:56,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:56:56,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:56:56,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511025579] [2023-08-04 07:56:56,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:56:56,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:56:56,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:56:56,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:56:56,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:56:56,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 182 [2023-08-04 07:56:56,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 23 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:56:56,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:56:56,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 182 [2023-08-04 07:56:56,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:56:56,592 INFO L124 PetriNetUnfolderBase]: 73/192 cut-off events. [2023-08-04 07:56:56,592 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:56:56,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 192 events. 73/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 800 event pairs, 18 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 357. Up to 140 conditions per place. [2023-08-04 07:56:56,593 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 19 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2023-08-04 07:56:56,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 29 transitions, 110 flow [2023-08-04 07:56:56,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:56:56,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:56:56,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2023-08-04 07:56:56,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6062271062271062 [2023-08-04 07:56:56,594 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 331 transitions. [2023-08-04 07:56:56,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 331 transitions. [2023-08-04 07:56:56,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:56:56,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 331 transitions. [2023-08-04 07:56:56,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:56:56,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:56:56,596 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:56:56,596 INFO L175 Difference]: Start difference. First operand has 28 places, 23 transitions, 56 flow. Second operand 3 states and 331 transitions. [2023-08-04 07:56:56,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 29 transitions, 110 flow [2023-08-04 07:56:56,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 110 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 07:56:56,596 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 64 flow [2023-08-04 07:56:56,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2023-08-04 07:56:56,597 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 3 predicate places. [2023-08-04 07:56:56,597 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 64 flow [2023-08-04 07:56:56,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:56:56,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:56:56,597 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 07:56:56,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 07:56:56,597 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 07:56:56,598 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:56:56,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1146289209, now seen corresponding path program 1 times [2023-08-04 07:56:56,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:56:56,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729995584] [2023-08-04 07:56:56,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:56:56,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:56:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:56:56,608 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 07:56:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:56:56,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 07:56:56,623 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 07:56:56,623 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 07:56:56,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 07:56:56,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 07:56:56,624 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 07:56:56,624 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (2/2) [2023-08-04 07:56:56,624 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 07:56:56,624 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 07:56:56,638 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-08-04 07:56:56,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 151 transitions, 350 flow [2023-08-04 07:56:56,684 INFO L124 PetriNetUnfolderBase]: 117/784 cut-off events. [2023-08-04 07:56:56,684 INFO L125 PetriNetUnfolderBase]: For 72/88 co-relation queries the response was YES. [2023-08-04 07:56:56,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 881 conditions, 784 events. 117/784 cut-off events. For 72/88 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4199 event pairs, 2 based on Foata normal form. 0/664 useless extension candidates. Maximal degree in co-relation 467. Up to 32 conditions per place. [2023-08-04 07:56:56,686 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 151 transitions, 350 flow [2023-08-04 07:56:56,688 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 139 transitions, 318 flow [2023-08-04 07:56:56,688 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 07:56:56,688 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 139 transitions, 318 flow [2023-08-04 07:56:56,688 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 139 transitions, 318 flow [2023-08-04 07:56:56,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 139 transitions, 318 flow [2023-08-04 07:56:56,722 INFO L124 PetriNetUnfolderBase]: 101/620 cut-off events. [2023-08-04 07:56:56,723 INFO L125 PetriNetUnfolderBase]: For 68/76 co-relation queries the response was YES. [2023-08-04 07:56:56,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 620 events. 101/620 cut-off events. For 68/76 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3046 event pairs, 2 based on Foata normal form. 0/532 useless extension candidates. Maximal degree in co-relation 381. Up to 32 conditions per place. [2023-08-04 07:56:56,731 INFO L119 LiptonReduction]: Number of co-enabled transitions 6752 [2023-08-04 07:56:59,445 INFO L134 LiptonReduction]: Checked pairs total: 28160 [2023-08-04 07:56:59,445 INFO L136 LiptonReduction]: Total number of compositions: 86 [2023-08-04 07:56:59,446 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 07:56:59,447 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;@1b5ef128, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 07:56:59,447 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 07:56:59,448 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 07:56:59,448 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-08-04 07:56:59,448 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:56:59,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:56:59,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 07:56:59,449 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:56:59,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:56:59,449 INFO L85 PathProgramCache]: Analyzing trace with hash 707169786, now seen corresponding path program 1 times [2023-08-04 07:56:59,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:56:59,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226163593] [2023-08-04 07:56:59,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:56:59,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:56:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:56:59,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 07:56:59,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:56:59,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226163593] [2023-08-04 07:56:59,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226163593] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:56:59,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:56:59,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:56:59,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851187062] [2023-08-04 07:56:59,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:56:59,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:56:59,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:56:59,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:56:59,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:56:59,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 237 [2023-08-04 07:56:59,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:56:59,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:56:59,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 237 [2023-08-04 07:56:59,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:57:04,179 INFO L124 PetriNetUnfolderBase]: 54246/79775 cut-off events. [2023-08-04 07:57:04,180 INFO L125 PetriNetUnfolderBase]: For 4899/4899 co-relation queries the response was YES. [2023-08-04 07:57:04,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156690 conditions, 79775 events. 54246/79775 cut-off events. For 4899/4899 co-relation queries the response was YES. Maximal size of possible extension queue 2335. Compared 596650 event pairs, 37616 based on Foata normal form. 0/71912 useless extension candidates. Maximal degree in co-relation 27322. Up to 73238 conditions per place. [2023-08-04 07:57:04,607 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 51 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-08-04 07:57:04,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 65 transitions, 276 flow [2023-08-04 07:57:04,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:57:04,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:57:04,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2023-08-04 07:57:04,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.620253164556962 [2023-08-04 07:57:04,610 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 441 transitions. [2023-08-04 07:57:04,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions. [2023-08-04 07:57:04,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:57:04,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions. [2023-08-04 07:57:04,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:04,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:04,612 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:04,612 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 154 flow. Second operand 3 states and 441 transitions. [2023-08-04 07:57:04,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 65 transitions, 276 flow [2023-08-04 07:57:04,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 65 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 07:57:04,647 INFO L231 Difference]: Finished difference. Result has 59 places, 58 transitions, 160 flow [2023-08-04 07:57:04,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=59, PETRI_TRANSITIONS=58} [2023-08-04 07:57:04,648 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 1 predicate places. [2023-08-04 07:57:04,648 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 58 transitions, 160 flow [2023-08-04 07:57:04,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:04,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:57:04,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:57:04,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 07:57:04,649 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:57:04,649 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:57:04,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1642763238, now seen corresponding path program 1 times [2023-08-04 07:57:04,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:57:04,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030877087] [2023-08-04 07:57:04,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:57:04,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:57:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:57:04,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 07:57:04,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:57:04,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030877087] [2023-08-04 07:57:04,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030877087] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:57:04,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093255872] [2023-08-04 07:57:04,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:57:04,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:57:04,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:57:04,733 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 07:57:04,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-04 07:57:04,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:57:04,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 07:57:04,801 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:57:04,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 07:57:04,806 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 07:57:04,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093255872] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:57:04,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 07:57:04,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 07:57:04,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949003166] [2023-08-04 07:57:04,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:57:04,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:57:04,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:57:04,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:57:04,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:57:04,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 237 [2023-08-04 07:57:04,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 58 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:04,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:57:04,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 237 [2023-08-04 07:57:04,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:57:08,962 INFO L124 PetriNetUnfolderBase]: 54190/79738 cut-off events. [2023-08-04 07:57:08,962 INFO L125 PetriNetUnfolderBase]: For 3543/3543 co-relation queries the response was YES. [2023-08-04 07:57:09,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156432 conditions, 79738 events. 54190/79738 cut-off events. For 3543/3543 co-relation queries the response was YES. Maximal size of possible extension queue 2389. Compared 600087 event pairs, 38944 based on Foata normal form. 0/72806 useless extension candidates. Maximal degree in co-relation 156372. Up to 72169 conditions per place. [2023-08-04 07:57:09,457 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 62 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2023-08-04 07:57:09,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 76 transitions, 324 flow [2023-08-04 07:57:09,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:57:09,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:57:09,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 451 transitions. [2023-08-04 07:57:09,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6343178621659634 [2023-08-04 07:57:09,459 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 451 transitions. [2023-08-04 07:57:09,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 451 transitions. [2023-08-04 07:57:09,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:57:09,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 451 transitions. [2023-08-04 07:57:09,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:09,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:09,461 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:09,461 INFO L175 Difference]: Start difference. First operand has 59 places, 58 transitions, 160 flow. Second operand 3 states and 451 transitions. [2023-08-04 07:57:09,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 76 transitions, 324 flow [2023-08-04 07:57:09,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 76 transitions, 322 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:57:09,466 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 170 flow [2023-08-04 07:57:09,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=61, PETRI_TRANSITIONS=59} [2023-08-04 07:57:09,467 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places. [2023-08-04 07:57:09,467 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 170 flow [2023-08-04 07:57:09,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:09,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:57:09,468 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:57:09,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-04 07:57:09,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:57:09,673 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:57:09,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:57:09,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1519489327, now seen corresponding path program 1 times [2023-08-04 07:57:09,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:57:09,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771590535] [2023-08-04 07:57:09,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:57:09,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:57:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:57:09,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 07:57:09,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:57:09,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771590535] [2023-08-04 07:57:09,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771590535] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:57:09,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693732109] [2023-08-04 07:57:09,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:57:09,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:57:09,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:57:09,736 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 07:57:09,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-04 07:57:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:57:09,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 07:57:09,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:57:09,814 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 07:57:09,814 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 07:57:09,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693732109] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:57:09,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 07:57:09,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 07:57:09,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504952575] [2023-08-04 07:57:09,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:57:09,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:57:09,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:57:09,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:57:09,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:57:09,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 237 [2023-08-04 07:57:09,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:09,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:57:09,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 237 [2023-08-04 07:57:09,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:57:13,057 INFO L124 PetriNetUnfolderBase]: 41365/60213 cut-off events. [2023-08-04 07:57:13,057 INFO L125 PetriNetUnfolderBase]: For 5494/5494 co-relation queries the response was YES. [2023-08-04 07:57:13,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123744 conditions, 60213 events. 41365/60213 cut-off events. For 5494/5494 co-relation queries the response was YES. Maximal size of possible extension queue 1524. Compared 428941 event pairs, 27642 based on Foata normal form. 0/57370 useless extension candidates. Maximal degree in co-relation 52750. Up to 39798 conditions per place. [2023-08-04 07:57:13,574 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 71 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2023-08-04 07:57:13,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 85 transitions, 378 flow [2023-08-04 07:57:13,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:57:13,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:57:13,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2023-08-04 07:57:13,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6455696202531646 [2023-08-04 07:57:13,575 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 459 transitions. [2023-08-04 07:57:13,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 459 transitions. [2023-08-04 07:57:13,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:57:13,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 459 transitions. [2023-08-04 07:57:13,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:13,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:13,579 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:13,579 INFO L175 Difference]: Start difference. First operand has 61 places, 59 transitions, 170 flow. Second operand 3 states and 459 transitions. [2023-08-04 07:57:13,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 85 transitions, 378 flow [2023-08-04 07:57:13,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 85 transitions, 376 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:57:13,583 INFO L231 Difference]: Finished difference. Result has 63 places, 60 transitions, 180 flow [2023-08-04 07:57:13,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=63, PETRI_TRANSITIONS=60} [2023-08-04 07:57:13,584 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 5 predicate places. [2023-08-04 07:57:13,584 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 60 transitions, 180 flow [2023-08-04 07:57:13,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:13,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:57:13,585 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] [2023-08-04 07:57:13,595 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 07:57:13,795 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 07:57:13,796 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:57:13,796 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:57:13,796 INFO L85 PathProgramCache]: Analyzing trace with hash 128132885, now seen corresponding path program 1 times [2023-08-04 07:57:13,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:57:13,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037729864] [2023-08-04 07:57:13,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:57:13,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:57:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:57:13,833 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 07:57:13,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:57:13,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037729864] [2023-08-04 07:57:13,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037729864] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:57:13,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661563133] [2023-08-04 07:57:13,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:57:13,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:57:13,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:57:13,836 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 07:57:13,838 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 07:57:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:57:13,906 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 07:57:13,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:57:13,915 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 07:57:13,915 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 07:57:13,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661563133] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:57:13,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 07:57:13,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-04 07:57:13,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189983230] [2023-08-04 07:57:13,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:57:13,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:57:13,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:57:13,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:57:13,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:57:13,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 237 [2023-08-04 07:57:13,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:13,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:57:13,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 237 [2023-08-04 07:57:13,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:57:17,273 INFO L124 PetriNetUnfolderBase]: 39882/59146 cut-off events. [2023-08-04 07:57:17,274 INFO L125 PetriNetUnfolderBase]: For 14866/14866 co-relation queries the response was YES. [2023-08-04 07:57:17,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125714 conditions, 59146 events. 39882/59146 cut-off events. For 14866/14866 co-relation queries the response was YES. Maximal size of possible extension queue 1522. Compared 426746 event pairs, 33977 based on Foata normal form. 0/57890 useless extension candidates. Maximal degree in co-relation 53973. Up to 47158 conditions per place. [2023-08-04 07:57:17,499 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 72 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2023-08-04 07:57:17,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 86 transitions, 390 flow [2023-08-04 07:57:17,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:57:17,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:57:17,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2023-08-04 07:57:17,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6455696202531646 [2023-08-04 07:57:17,501 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 459 transitions. [2023-08-04 07:57:17,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 459 transitions. [2023-08-04 07:57:17,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:57:17,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 459 transitions. [2023-08-04 07:57:17,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:17,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:17,503 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:17,503 INFO L175 Difference]: Start difference. First operand has 63 places, 60 transitions, 180 flow. Second operand 3 states and 459 transitions. [2023-08-04 07:57:17,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 86 transitions, 390 flow [2023-08-04 07:57:17,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 86 transitions, 388 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:57:17,626 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 190 flow [2023-08-04 07:57:17,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2023-08-04 07:57:17,627 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 7 predicate places. [2023-08-04 07:57:17,627 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 190 flow [2023-08-04 07:57:17,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:17,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:57:17,627 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] [2023-08-04 07:57:17,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-04 07:57:17,831 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 07:57:17,832 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:57:17,832 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:57:17,832 INFO L85 PathProgramCache]: Analyzing trace with hash -43420565, now seen corresponding path program 1 times [2023-08-04 07:57:17,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:57:17,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063886929] [2023-08-04 07:57:17,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:57:17,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:57:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:57:17,882 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 07:57:17,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:57:17,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063886929] [2023-08-04 07:57:17,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063886929] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:57:17,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722144529] [2023-08-04 07:57:17,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:57:17,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:57:17,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:57:17,884 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 07:57:17,886 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 07:57:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:57:17,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 07:57:17,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:57:17,975 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 07:57:17,975 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:57:17,989 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 07:57:17,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722144529] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:57:17,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:57:17,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 07:57:17,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631965689] [2023-08-04 07:57:17,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:57:17,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 07:57:17,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:57:17,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 07:57:17,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:57:18,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 237 [2023-08-04 07:57:18,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 190 flow. Second operand has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:18,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:57:18,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 237 [2023-08-04 07:57:18,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:57:21,443 INFO L124 PetriNetUnfolderBase]: 37383/55369 cut-off events. [2023-08-04 07:57:21,444 INFO L125 PetriNetUnfolderBase]: For 10190/10190 co-relation queries the response was YES. [2023-08-04 07:57:21,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118186 conditions, 55369 events. 37383/55369 cut-off events. For 10190/10190 co-relation queries the response was YES. Maximal size of possible extension queue 1456. Compared 395498 event pairs, 21301 based on Foata normal form. 7/54752 useless extension candidates. Maximal degree in co-relation 94551. Up to 51238 conditions per place. [2023-08-04 07:57:21,697 INFO L140 encePairwiseOnDemand]: 233/237 looper letters, 65 selfloop transitions, 3 changer transitions 1/81 dead transitions. [2023-08-04 07:57:21,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 81 transitions, 368 flow [2023-08-04 07:57:21,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:57:21,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:57:21,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 579 transitions. [2023-08-04 07:57:21,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6107594936708861 [2023-08-04 07:57:21,699 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 579 transitions. [2023-08-04 07:57:21,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 579 transitions. [2023-08-04 07:57:21,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:57:21,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 579 transitions. [2023-08-04 07:57:21,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:21,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:21,701 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:21,701 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 190 flow. Second operand 4 states and 579 transitions. [2023-08-04 07:57:21,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 81 transitions, 368 flow [2023-08-04 07:57:22,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 81 transitions, 366 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:57:22,326 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 202 flow [2023-08-04 07:57:22,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2023-08-04 07:57:22,327 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 11 predicate places. [2023-08-04 07:57:22,327 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 202 flow [2023-08-04 07:57:22,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:22,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:57:22,327 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] [2023-08-04 07:57:22,332 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 07:57:22,532 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 07:57:22,532 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:57:22,532 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:57:22,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1345344786, now seen corresponding path program 1 times [2023-08-04 07:57:22,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:57:22,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195799099] [2023-08-04 07:57:22,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:57:22,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:57:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:57:22,578 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 07:57:22,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:57:22,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195799099] [2023-08-04 07:57:22,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195799099] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:57:22,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306917904] [2023-08-04 07:57:22,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:57:22,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:57:22,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:57:22,580 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 07:57:22,582 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 07:57:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:57:22,665 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 07:57:22,666 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:57:22,683 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 07:57:22,683 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:57:22,702 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 07:57:22,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306917904] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:57:22,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:57:22,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 07:57:22,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499429119] [2023-08-04 07:57:22,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:57:22,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 07:57:22,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:57:22,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 07:57:22,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:57:22,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 237 [2023-08-04 07:57:22,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 202 flow. Second operand has 5 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:22,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:57:22,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 237 [2023-08-04 07:57:22,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:57:26,228 INFO L124 PetriNetUnfolderBase]: 35748/52200 cut-off events. [2023-08-04 07:57:26,228 INFO L125 PetriNetUnfolderBase]: For 7195/7195 co-relation queries the response was YES. [2023-08-04 07:57:26,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111922 conditions, 52200 events. 35748/52200 cut-off events. For 7195/7195 co-relation queries the response was YES. Maximal size of possible extension queue 1259. Compared 361050 event pairs, 15364 based on Foata normal form. 245/52228 useless extension candidates. Maximal degree in co-relation 88525. Up to 36961 conditions per place. [2023-08-04 07:57:26,512 INFO L140 encePairwiseOnDemand]: 233/237 looper letters, 83 selfloop transitions, 3 changer transitions 1/99 dead transitions. [2023-08-04 07:57:26,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 99 transitions, 452 flow [2023-08-04 07:57:26,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:57:26,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:57:26,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 597 transitions. [2023-08-04 07:57:26,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.629746835443038 [2023-08-04 07:57:26,526 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 597 transitions. [2023-08-04 07:57:26,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 597 transitions. [2023-08-04 07:57:26,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:57:26,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 597 transitions. [2023-08-04 07:57:26,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.25) internal successors, (597), 4 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:26,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:26,532 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:26,532 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 202 flow. Second operand 4 states and 597 transitions. [2023-08-04 07:57:26,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 99 transitions, 452 flow [2023-08-04 07:57:27,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 99 transitions, 443 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 07:57:27,080 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 207 flow [2023-08-04 07:57:27,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=207, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2023-08-04 07:57:27,081 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 13 predicate places. [2023-08-04 07:57:27,081 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 207 flow [2023-08-04 07:57:27,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:27,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:57:27,081 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] [2023-08-04 07:57:27,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-08-04 07:57:27,285 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 07:57:27,286 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:57:27,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:57:27,286 INFO L85 PathProgramCache]: Analyzing trace with hash -240666798, now seen corresponding path program 1 times [2023-08-04 07:57:27,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:57:27,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515521517] [2023-08-04 07:57:27,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:57:27,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:57:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:57:27,337 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 07:57:27,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:57:27,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515521517] [2023-08-04 07:57:27,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515521517] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:57:27,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903059666] [2023-08-04 07:57:27,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:57:27,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:57:27,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:57:27,338 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 07:57:27,341 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 07:57:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:57:27,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 07:57:27,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:57:27,444 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 07:57:27,445 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:57:27,460 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 07:57:27,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903059666] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:57:27,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:57:27,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 07:57:27,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806477429] [2023-08-04 07:57:27,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:57:27,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 07:57:27,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:57:27,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 07:57:27,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:57:27,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 237 [2023-08-04 07:57:27,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 207 flow. Second operand has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:27,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:57:27,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 237 [2023-08-04 07:57:27,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:57:30,506 INFO L124 PetriNetUnfolderBase]: 25774/37816 cut-off events. [2023-08-04 07:57:30,506 INFO L125 PetriNetUnfolderBase]: For 18374/18374 co-relation queries the response was YES. [2023-08-04 07:57:30,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85053 conditions, 37816 events. 25774/37816 cut-off events. For 18374/18374 co-relation queries the response was YES. Maximal size of possible extension queue 1024. Compared 251561 event pairs, 10333 based on Foata normal form. 840/38357 useless extension candidates. Maximal degree in co-relation 81493. Up to 14584 conditions per place. [2023-08-04 07:57:30,735 INFO L140 encePairwiseOnDemand]: 233/237 looper letters, 91 selfloop transitions, 4 changer transitions 0/107 dead transitions. [2023-08-04 07:57:30,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 107 transitions, 498 flow [2023-08-04 07:57:30,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:57:30,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:57:30,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 605 transitions. [2023-08-04 07:57:30,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6381856540084389 [2023-08-04 07:57:30,737 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 605 transitions. [2023-08-04 07:57:30,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 605 transitions. [2023-08-04 07:57:30,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:57:30,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 605 transitions. [2023-08-04 07:57:30,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 151.25) internal successors, (605), 4 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:30,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:30,740 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:30,740 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 207 flow. Second operand 4 states and 605 transitions. [2023-08-04 07:57:30,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 107 transitions, 498 flow [2023-08-04 07:57:30,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 107 transitions, 488 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 07:57:30,872 INFO L231 Difference]: Finished difference. Result has 73 places, 62 transitions, 218 flow [2023-08-04 07:57:30,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=73, PETRI_TRANSITIONS=62} [2023-08-04 07:57:30,873 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 15 predicate places. [2023-08-04 07:57:30,873 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 62 transitions, 218 flow [2023-08-04 07:57:30,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:30,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:57:30,873 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] [2023-08-04 07:57:30,880 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 07:57:31,078 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 07:57:31,081 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:57:31,081 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:57:31,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1057213429, now seen corresponding path program 1 times [2023-08-04 07:57:31,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:57:31,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287347367] [2023-08-04 07:57:31,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:57:31,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:57:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:57:31,219 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 07:57:31,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:57:31,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287347367] [2023-08-04 07:57:31,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287347367] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:57:31,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:57:31,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 07:57:31,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89645529] [2023-08-04 07:57:31,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:57:31,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:57:31,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:57:31,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:57:31,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:57:31,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 237 [2023-08-04 07:57:31,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:31,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:57:31,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 237 [2023-08-04 07:57:31,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:57:32,135 INFO L124 PetriNetUnfolderBase]: 6866/13700 cut-off events. [2023-08-04 07:57:32,135 INFO L125 PetriNetUnfolderBase]: For 18267/18267 co-relation queries the response was YES. [2023-08-04 07:57:32,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36258 conditions, 13700 events. 6866/13700 cut-off events. For 18267/18267 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 115340 event pairs, 2162 based on Foata normal form. 7000/20552 useless extension candidates. Maximal degree in co-relation 32711. Up to 9600 conditions per place. [2023-08-04 07:57:32,205 INFO L140 encePairwiseOnDemand]: 221/237 looper letters, 67 selfloop transitions, 16 changer transitions 0/89 dead transitions. [2023-08-04 07:57:32,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 89 transitions, 524 flow [2023-08-04 07:57:32,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:57:32,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:57:32,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2023-08-04 07:57:32,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5963431786216596 [2023-08-04 07:57:32,206 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2023-08-04 07:57:32,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2023-08-04 07:57:32,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:57:32,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2023-08-04 07:57:32,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:32,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:32,208 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:32,209 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 218 flow. Second operand 3 states and 424 transitions. [2023-08-04 07:57:32,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 89 transitions, 524 flow [2023-08-04 07:57:32,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 89 transitions, 516 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-04 07:57:32,239 INFO L231 Difference]: Finished difference. Result has 74 places, 62 transitions, 246 flow [2023-08-04 07:57:32,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=74, PETRI_TRANSITIONS=62} [2023-08-04 07:57:32,240 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 16 predicate places. [2023-08-04 07:57:32,240 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 62 transitions, 246 flow [2023-08-04 07:57:32,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:32,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:57:32,240 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] [2023-08-04 07:57:32,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-04 07:57:32,241 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:57:32,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:57:32,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1169140511, now seen corresponding path program 2 times [2023-08-04 07:57:32,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:57:32,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965576409] [2023-08-04 07:57:32,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:57:32,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:57:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:57:32,344 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 07:57:32,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:57:32,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965576409] [2023-08-04 07:57:32,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965576409] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:57:32,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885559199] [2023-08-04 07:57:32,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 07:57:32,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:57:32,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:57:32,361 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 07:57:32,362 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 07:57:32,482 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 07:57:32,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 07:57:32,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 07:57:32,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:57:32,505 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 07:57:32,505 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:57:32,515 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 07:57:32,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885559199] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:57:32,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:57:32,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 07:57:32,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310275048] [2023-08-04 07:57:32,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:57:32,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 07:57:32,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:57:32,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 07:57:32,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:57:32,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 237 [2023-08-04 07:57:32,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 62 transitions, 246 flow. Second operand has 5 states, 5 states have (on average 135.6) internal successors, (678), 5 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:32,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:57:32,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 237 [2023-08-04 07:57:32,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:57:33,476 INFO L124 PetriNetUnfolderBase]: 5808/12278 cut-off events. [2023-08-04 07:57:33,476 INFO L125 PetriNetUnfolderBase]: For 11764/11764 co-relation queries the response was YES. [2023-08-04 07:57:33,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33825 conditions, 12278 events. 5808/12278 cut-off events. For 11764/11764 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 103918 event pairs, 5277 based on Foata normal form. 28/12180 useless extension candidates. Maximal degree in co-relation 30701. Up to 9761 conditions per place. [2023-08-04 07:57:33,543 INFO L140 encePairwiseOnDemand]: 233/237 looper letters, 92 selfloop transitions, 3 changer transitions 1/108 dead transitions. [2023-08-04 07:57:33,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 108 transitions, 578 flow [2023-08-04 07:57:33,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:57:33,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:57:33,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 605 transitions. [2023-08-04 07:57:33,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6381856540084389 [2023-08-04 07:57:33,545 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 605 transitions. [2023-08-04 07:57:33,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 605 transitions. [2023-08-04 07:57:33,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:57:33,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 605 transitions. [2023-08-04 07:57:33,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 151.25) internal successors, (605), 4 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:33,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:33,548 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:33,548 INFO L175 Difference]: Start difference. First operand has 74 places, 62 transitions, 246 flow. Second operand 4 states and 605 transitions. [2023-08-04 07:57:33,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 108 transitions, 578 flow [2023-08-04 07:57:33,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 108 transitions, 542 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:57:33,661 INFO L231 Difference]: Finished difference. Result has 78 places, 62 transitions, 244 flow [2023-08-04 07:57:33,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=244, PETRI_PLACES=78, PETRI_TRANSITIONS=62} [2023-08-04 07:57:33,662 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 20 predicate places. [2023-08-04 07:57:33,662 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 62 transitions, 244 flow [2023-08-04 07:57:33,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.6) internal successors, (678), 5 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:33,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:57:33,662 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] [2023-08-04 07:57:33,668 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 07:57:33,865 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,SelfDestructingSolverStorable15 [2023-08-04 07:57:33,865 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:57:33,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:57:33,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1484649312, now seen corresponding path program 1 times [2023-08-04 07:57:33,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:57:33,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536699275] [2023-08-04 07:57:33,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:57:33,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:57:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:57:34,836 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 07:57:34,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:57:34,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536699275] [2023-08-04 07:57:34,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536699275] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:57:34,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890959782] [2023-08-04 07:57:34,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:57:34,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:57:34,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:57:34,837 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 07:57:34,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-04 07:57:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:57:34,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 57 conjunts are in the unsatisfiable core [2023-08-04 07:57:34,962 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:57:34,989 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-08-04 07:57:35,021 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-04 07:57:35,105 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-04 07:57:35,290 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-04 07:57:35,443 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-08-04 07:57:35,868 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 07:57:35,869 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:57:37,130 INFO L322 Elim1Store]: treesize reduction 14, result has 65.9 percent of original size [2023-08-04 07:57:37,130 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 209 treesize of output 179 [2023-08-04 07:57:37,535 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse14 (+ 4294967296 |c_#pthreadsForks|)) (.cse10 (+ |c_ULTIMATE.start_main_~#t2~0#1.offset| 4)) (.cse8 (+ |c_#pthreadsForks| 1))) (let ((.cse1 (= |c_ULTIMATE.start_main_~asdf~1#1| 0)) (.cse15 (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse26 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296))) (or (< 2147483647 .cse26) (not (= .cse26 |c_#pthreadsForks|)) (not (= (select v_arrayElimArr_1 .cse10) .cse8)))))) (.cse2 (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse25 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296))) (or (not (= .cse25 .cse14)) (<= .cse25 2147483647) (not (= (select v_arrayElimArr_1 .cse10) .cse8))))))) (let ((.cse11 (and .cse15 .cse2)) (.cse4 (not .cse1)) (.cse9 (+ (* 4 |c_ULTIMATE.start_main_~asdf~1#1|) |c_ULTIMATE.start_main_~#t2~0#1.offset| 4)) (.cse0 (mod .cse8 4294967296))) (and (or (and (<= .cse0 2147483647) .cse1) (let ((.cse5 (+ 4294967296 c_thread1Thread2of2ForFork0_thidvar0))) (let ((.cse3 (not (= .cse0 .cse5)))) (and (or .cse2 .cse3 .cse4) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse6 (mod (select v_arrayElimArr_1 .cse10) 4294967296)) (.cse7 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296))) (or (not (= .cse5 .cse6)) (< 2147483647 .cse7) (not (= .cse8 (select v_arrayElimArr_1 .cse9))) (<= .cse6 2147483647) (not (= .cse7 |c_#pthreadsForks|))))) .cse1) (or .cse3 .cse4 .cse11) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse12 (mod (select v_arrayElimArr_1 .cse10) 4294967296)) (.cse13 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296))) (or (not (= .cse5 .cse12)) (not (= .cse13 .cse14)) (not (= .cse8 (select v_arrayElimArr_1 .cse9))) (<= .cse12 2147483647) (<= .cse13 2147483647)))) .cse1) (or .cse15 .cse3 .cse4))))) (or (and (< 2147483647 .cse0) .cse1) (let ((.cse16 (not (= .cse0 c_thread1Thread2of2ForFork0_thidvar0)))) (and (or .cse16 .cse4 .cse11) (or (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_y_1 Int)) (let ((.cse17 (* v_y_1 4294967296)) (.cse19 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296)) (.cse18 (select v_arrayElimArr_1 .cse10))) (or (< (+ 2147483647 .cse17) .cse18) (< .cse18 .cse17) (< 2147483647 .cse19) (not (= .cse19 |c_#pthreadsForks|)) (not (= .cse18 .cse8))))) .cse15 .cse2 (forall ((v_arrayElimArr_1 (Array Int Int)) (v_y_1 Int)) (let ((.cse20 (* v_y_1 4294967296)) (.cse22 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296)) (.cse21 (select v_arrayElimArr_1 .cse10))) (or (< (+ 2147483647 .cse20) .cse21) (not (= .cse22 .cse14)) (< .cse21 .cse20) (<= .cse22 2147483647) (not (= .cse21 .cse8)))))) .cse16 .cse4) (or (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_y_1 Int)) (let ((.cse23 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296))) (or (not (= (+ (* v_y_1 4294967296) c_thread1Thread2of2ForFork0_thidvar0) (select v_arrayElimArr_1 .cse10))) (not (= .cse23 .cse14)) (not (= .cse8 (select v_arrayElimArr_1 .cse9))) (<= .cse23 2147483647)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_y_1 Int)) (let ((.cse24 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296))) (or (not (= (+ (* v_y_1 4294967296) c_thread1Thread2of2ForFork0_thidvar0) (select v_arrayElimArr_1 .cse10))) (< 2147483647 .cse24) (not (= .cse8 (select v_arrayElimArr_1 .cse9))) (not (= .cse24 |c_#pthreadsForks|)))))) (< 2147483647 c_thread1Thread2of2ForFork0_thidvar0) (< c_thread1Thread2of2ForFork0_thidvar0 0) .cse1)))))))) is different from false [2023-08-04 07:57:39,423 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse13 (+ 4294967296 |c_#pthreadsForks|)) (.cse9 (+ |c_ULTIMATE.start_main_~#t2~0#1.offset| 4)) (.cse8 (+ |c_#pthreadsForks| 1))) (let ((.cse2 (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse16 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296))) (or (< 2147483647 .cse16) (not (= .cse16 |c_#pthreadsForks|)) (not (= (select v_arrayElimArr_1 .cse9) .cse8)))))) (.cse0 (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse15 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296))) (or (not (= .cse15 .cse13)) (<= .cse15 2147483647) (not (= (select v_arrayElimArr_1 .cse9) .cse8))))))) (let ((.cse3 (and .cse2 .cse0)) (.cse4 (mod .cse8 4294967296))) (and (or (let ((.cse1 (not (= .cse4 (+ 4294967296 c_thread1Thread2of2ForFork0_thidvar0))))) (and (or .cse0 .cse1) (or .cse2 .cse1) (or .cse1 .cse3))) (<= .cse4 2147483647)) (or (< 2147483647 .cse4) (let ((.cse14 (not (= .cse4 c_thread1Thread2of2ForFork0_thidvar0)))) (and (or (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_y_1 Int)) (let ((.cse5 (* v_y_1 4294967296)) (.cse7 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296)) (.cse6 (select v_arrayElimArr_1 .cse9))) (or (< (+ 2147483647 .cse5) .cse6) (< .cse6 .cse5) (< 2147483647 .cse7) (not (= .cse7 |c_#pthreadsForks|)) (not (= .cse6 .cse8))))) .cse2 .cse0 (forall ((v_arrayElimArr_1 (Array Int Int)) (v_y_1 Int)) (let ((.cse10 (* v_y_1 4294967296)) (.cse12 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296)) (.cse11 (select v_arrayElimArr_1 .cse9))) (or (< (+ 2147483647 .cse10) .cse11) (not (= .cse12 .cse13)) (< .cse11 .cse10) (<= .cse12 2147483647) (not (= .cse11 .cse8)))))) .cse14) (or .cse14 .cse3)))))))) is different from false [2023-08-04 07:57:41,161 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2023-08-04 07:57:41,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890959782] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:57:41,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:57:41,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 15] total 38 [2023-08-04 07:57:41,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466186868] [2023-08-04 07:57:41,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:57:41,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-08-04 07:57:41,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:57:41,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-08-04 07:57:41,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1123, Unknown=2, NotChecked=138, Total=1406 [2023-08-04 07:57:41,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 237 [2023-08-04 07:57:41,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 62 transitions, 244 flow. Second operand has 38 states, 38 states have (on average 85.97368421052632) internal successors, (3267), 38 states have internal predecessors, (3267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:41,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:57:41,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 237 [2023-08-04 07:57:41,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:57:49,822 INFO L124 PetriNetUnfolderBase]: 6012/11733 cut-off events. [2023-08-04 07:57:49,823 INFO L125 PetriNetUnfolderBase]: For 5913/5913 co-relation queries the response was YES. [2023-08-04 07:57:49,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31459 conditions, 11733 events. 6012/11733 cut-off events. For 5913/5913 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 90986 event pairs, 1260 based on Foata normal form. 268/11998 useless extension candidates. Maximal degree in co-relation 31135. Up to 4707 conditions per place. [2023-08-04 07:57:49,945 INFO L140 encePairwiseOnDemand]: 213/237 looper letters, 306 selfloop transitions, 28 changer transitions 9/351 dead transitions. [2023-08-04 07:57:49,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 351 transitions, 1655 flow [2023-08-04 07:57:49,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-04 07:57:49,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-04 07:57:49,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2314 transitions. [2023-08-04 07:57:49,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4068213783403657 [2023-08-04 07:57:49,951 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2314 transitions. [2023-08-04 07:57:49,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2314 transitions. [2023-08-04 07:57:49,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:57:49,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2314 transitions. [2023-08-04 07:57:49,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 96.41666666666667) internal successors, (2314), 24 states have internal predecessors, (2314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:49,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 237.0) internal successors, (5925), 25 states have internal predecessors, (5925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:49,965 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 237.0) internal successors, (5925), 25 states have internal predecessors, (5925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:49,965 INFO L175 Difference]: Start difference. First operand has 78 places, 62 transitions, 244 flow. Second operand 24 states and 2314 transitions. [2023-08-04 07:57:49,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 351 transitions, 1655 flow [2023-08-04 07:57:50,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 351 transitions, 1649 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-04 07:57:50,243 INFO L231 Difference]: Finished difference. Result has 104 places, 72 transitions, 354 flow [2023-08-04 07:57:50,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=354, PETRI_PLACES=104, PETRI_TRANSITIONS=72} [2023-08-04 07:57:50,244 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 46 predicate places. [2023-08-04 07:57:50,244 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 72 transitions, 354 flow [2023-08-04 07:57:50,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 85.97368421052632) internal successors, (3267), 38 states have internal predecessors, (3267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:50,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:57:50,246 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] [2023-08-04 07:57:50,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-04 07:57:50,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-04 07:57:50,452 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:57:50,452 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:57:50,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1259282684, now seen corresponding path program 2 times [2023-08-04 07:57:50,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:57:50,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934527932] [2023-08-04 07:57:50,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:57:50,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:57:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:57:51,593 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 07:57:51,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:57:51,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934527932] [2023-08-04 07:57:51,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934527932] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:57:51,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622650464] [2023-08-04 07:57:51,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 07:57:51,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:57:51,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:57:51,595 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 07:57:51,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-04 07:57:51,754 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 07:57:51,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 07:57:51,756 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-04 07:57:51,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:57:51,769 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-08-04 07:57:51,781 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-04 07:57:51,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 07:57:51,904 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-08-04 07:57:51,989 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-04 07:57:52,062 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-04 07:57:52,153 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-08-04 07:57:52,182 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 07:57:52,182 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:57:52,425 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_864 (Array Int Int))) (let ((.cse0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296))) (or (not (= .cse0 (+ 4294967296 |c_#pthreadsForks|))) (<= .cse0 2147483647)))) (forall ((v_ArrVal_864 (Array Int Int))) (let ((.cse1 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296))) (or (not (= .cse1 |c_#pthreadsForks|)) (< 2147483647 .cse1))))) is different from false [2023-08-04 07:57:52,790 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| (* |c_ULTIMATE.start_main_~asdf~0#1| 4)))) (and (forall ((v_ArrVal_864 (Array Int Int)) (v_ArrVal_861 Int)) (let ((.cse0 (mod (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| (store .cse1 .cse2 v_ArrVal_861)) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296))) (or (not (= .cse0 (+ |c_#pthreadsForks| 4294967298))) (<= .cse0 2147483647)))) (forall ((v_ArrVal_864 (Array Int Int)) (v_ArrVal_861 Int)) (let ((.cse3 (mod (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| (store .cse1 .cse2 v_ArrVal_861)) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296))) (or (not (= (+ 2 |c_#pthreadsForks|) .cse3)) (< 2147483647 .cse3)))))) is different from false [2023-08-04 07:57:53,270 INFO L322 Elim1Store]: treesize reduction 21, result has 54.3 percent of original size [2023-08-04 07:57:53,271 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 52 [2023-08-04 07:57:53,280 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 07:57:53,281 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 58 [2023-08-04 07:57:53,284 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2023-08-04 07:57:53,318 INFO L322 Elim1Store]: treesize reduction 37, result has 2.6 percent of original size [2023-08-04 07:57:53,319 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 1 [2023-08-04 07:57:53,344 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 7 not checked. [2023-08-04 07:57:53,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622650464] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:57:53,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:57:53,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 28 [2023-08-04 07:57:53,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491944925] [2023-08-04 07:57:53,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:57:53,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-04 07:57:53,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:57:53,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-04 07:57:53,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=628, Unknown=7, NotChecked=102, Total=812 [2023-08-04 07:57:53,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 237 [2023-08-04 07:57:53,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 72 transitions, 354 flow. Second operand has 29 states, 29 states have (on average 98.48275862068965) internal successors, (2856), 29 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:57:53,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:57:53,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 237 [2023-08-04 07:57:53,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:58:00,673 INFO L124 PetriNetUnfolderBase]: 4771/9340 cut-off events. [2023-08-04 07:58:00,674 INFO L125 PetriNetUnfolderBase]: For 8165/8165 co-relation queries the response was YES. [2023-08-04 07:58:00,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28987 conditions, 9340 events. 4771/9340 cut-off events. For 8165/8165 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 71495 event pairs, 62 based on Foata normal form. 168/9496 useless extension candidates. Maximal degree in co-relation 28738. Up to 2597 conditions per place. [2023-08-04 07:58:00,739 INFO L140 encePairwiseOnDemand]: 211/237 looper letters, 231 selfloop transitions, 32 changer transitions 0/276 dead transitions. [2023-08-04 07:58:00,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 276 transitions, 1389 flow [2023-08-04 07:58:00,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-04 07:58:00,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-04 07:58:00,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1954 transitions. [2023-08-04 07:58:00,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4580403187998125 [2023-08-04 07:58:00,760 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1954 transitions. [2023-08-04 07:58:00,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1954 transitions. [2023-08-04 07:58:00,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:58:00,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1954 transitions. [2023-08-04 07:58:00,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 108.55555555555556) internal successors, (1954), 18 states have internal predecessors, (1954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:58:00,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 237.0) internal successors, (4503), 19 states have internal predecessors, (4503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:58:00,792 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 237.0) internal successors, (4503), 19 states have internal predecessors, (4503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:58:00,792 INFO L175 Difference]: Start difference. First operand has 104 places, 72 transitions, 354 flow. Second operand 18 states and 1954 transitions. [2023-08-04 07:58:00,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 276 transitions, 1389 flow [2023-08-04 07:58:01,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 276 transitions, 1320 flow, removed 12 selfloop flow, removed 18 redundant places. [2023-08-04 07:58:01,009 INFO L231 Difference]: Finished difference. Result has 107 places, 86 transitions, 441 flow [2023-08-04 07:58:01,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=441, PETRI_PLACES=107, PETRI_TRANSITIONS=86} [2023-08-04 07:58:01,010 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 49 predicate places. [2023-08-04 07:58:01,010 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 86 transitions, 441 flow [2023-08-04 07:58:01,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 98.48275862068965) internal successors, (2856), 29 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:58:01,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:58:01,010 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] [2023-08-04 07:58:01,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-04 07:58:01,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-04 07:58:01,217 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:58:01,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:58:01,217 INFO L85 PathProgramCache]: Analyzing trace with hash 50385924, now seen corresponding path program 1 times [2023-08-04 07:58:01,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:58:01,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819398018] [2023-08-04 07:58:01,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:58:01,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:58:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:58:01,887 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-04 07:58:01,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:58:01,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819398018] [2023-08-04 07:58:01,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819398018] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:58:01,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191424124] [2023-08-04 07:58:01,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:58:01,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:58:01,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:58:01,889 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 07:58:01,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-04 07:58:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:58:02,053 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 34 conjunts are in the unsatisfiable core [2023-08-04 07:58:02,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:58:02,060 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-04 07:58:02,166 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-04 07:58:02,263 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-04 07:58:02,347 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-04 07:58:02,487 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-08-04 07:58:02,507 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 07:58:02,507 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:58:03,118 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 07:58:03,119 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 44 [2023-08-04 07:58:03,125 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 07:58:03,125 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 62 [2023-08-04 07:58:03,128 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2023-08-04 07:58:03,153 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-08-04 07:58:03,153 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 1 [2023-08-04 07:58:03,246 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 12 refuted. 1 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 07:58:03,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191424124] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:58:03,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:58:03,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2023-08-04 07:58:03,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311144499] [2023-08-04 07:58:03,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:58:03,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-04 07:58:03,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:58:03,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-04 07:58:03,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=782, Unknown=2, NotChecked=0, Total=870 [2023-08-04 07:58:04,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 237 [2023-08-04 07:58:04,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 86 transitions, 441 flow. Second operand has 30 states, 30 states have (on average 90.86666666666666) internal successors, (2726), 30 states have internal predecessors, (2726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:58:04,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:58:04,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 237 [2023-08-04 07:58:04,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:58:08,692 INFO L124 PetriNetUnfolderBase]: 4580/8912 cut-off events. [2023-08-04 07:58:08,692 INFO L125 PetriNetUnfolderBase]: For 9296/9296 co-relation queries the response was YES. [2023-08-04 07:58:08,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29568 conditions, 8912 events. 4580/8912 cut-off events. For 9296/9296 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 68067 event pairs, 27 based on Foata normal form. 33/8945 useless extension candidates. Maximal degree in co-relation 29474. Up to 2958 conditions per place. [2023-08-04 07:58:08,745 INFO L140 encePairwiseOnDemand]: 218/237 looper letters, 290 selfloop transitions, 27 changer transitions 1/326 dead transitions. [2023-08-04 07:58:08,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 326 transitions, 2005 flow [2023-08-04 07:58:08,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-04 07:58:08,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-04 07:58:08,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2197 transitions. [2023-08-04 07:58:08,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42136555427694666 [2023-08-04 07:58:08,767 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 2197 transitions. [2023-08-04 07:58:08,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 2197 transitions. [2023-08-04 07:58:08,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:58:08,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 2197 transitions. [2023-08-04 07:58:08,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 99.86363636363636) internal successors, (2197), 22 states have internal predecessors, (2197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:58:08,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 237.0) internal successors, (5451), 23 states have internal predecessors, (5451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:58:08,784 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 237.0) internal successors, (5451), 23 states have internal predecessors, (5451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:58:08,784 INFO L175 Difference]: Start difference. First operand has 107 places, 86 transitions, 441 flow. Second operand 22 states and 2197 transitions. [2023-08-04 07:58:08,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 326 transitions, 2005 flow [2023-08-04 07:58:09,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 326 transitions, 1954 flow, removed 4 selfloop flow, removed 17 redundant places. [2023-08-04 07:58:09,004 INFO L231 Difference]: Finished difference. Result has 112 places, 84 transitions, 435 flow [2023-08-04 07:58:09,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=435, PETRI_PLACES=112, PETRI_TRANSITIONS=84} [2023-08-04 07:58:09,005 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 54 predicate places. [2023-08-04 07:58:09,005 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 84 transitions, 435 flow [2023-08-04 07:58:09,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 90.86666666666666) internal successors, (2726), 30 states have internal predecessors, (2726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:58:09,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:58:09,006 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] [2023-08-04 07:58:09,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-04 07:58:09,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:58:09,211 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:58:09,212 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:58:09,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2090635408, now seen corresponding path program 1 times [2023-08-04 07:58:09,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:58:09,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093350980] [2023-08-04 07:58:09,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:58:09,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:58:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:58:09,254 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 07:58:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:58:09,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 07:58:09,306 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 07:58:09,306 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 07:58:09,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-04 07:58:09,306 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:58:09,306 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE (1/2) [2023-08-04 07:58:09,308 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 07:58:09,308 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 07:58:09,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 07:58:09 BasicIcfg [2023-08-04 07:58:09,386 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 07:58:09,386 INFO L158 Benchmark]: Toolchain (without parser) took 80975.71ms. Allocated memory was 329.3MB in the beginning and 13.9GB in the end (delta: 13.6GB). Free memory was 294.7MB in the beginning and 5.0GB in the end (delta: -4.7GB). Peak memory consumption was 8.9GB. Max. memory is 16.0GB. [2023-08-04 07:58:09,386 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 255.9MB. Free memory is still 214.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 07:58:09,387 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.17ms. Allocated memory is still 329.3MB. Free memory was 294.7MB in the beginning and 274.7MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-04 07:58:09,387 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.67ms. Allocated memory is still 329.3MB. Free memory was 274.7MB in the beginning and 272.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 07:58:09,387 INFO L158 Benchmark]: Boogie Preprocessor took 28.57ms. Allocated memory is still 329.3MB. Free memory was 272.7MB in the beginning and 271.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 07:58:09,387 INFO L158 Benchmark]: RCFGBuilder took 301.09ms. Allocated memory is still 329.3MB. Free memory was 271.0MB in the beginning and 254.8MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2023-08-04 07:58:09,387 INFO L158 Benchmark]: TraceAbstraction took 80188.68ms. Allocated memory was 329.3MB in the beginning and 13.9GB in the end (delta: 13.6GB). Free memory was 254.2MB in the beginning and 5.0GB in the end (delta: -4.7GB). Peak memory consumption was 8.9GB. Max. memory is 16.0GB. [2023-08-04 07:58:09,388 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 255.9MB. Free memory is still 214.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 415.17ms. Allocated memory is still 329.3MB. Free memory was 294.7MB in the beginning and 274.7MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 36.67ms. Allocated memory is still 329.3MB. Free memory was 274.7MB in the beginning and 272.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 28.57ms. Allocated memory is still 329.3MB. Free memory was 272.7MB in the beginning and 271.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 301.09ms. Allocated memory is still 329.3MB. Free memory was 271.0MB in the beginning and 254.8MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 80188.68ms. Allocated memory was 329.3MB in the beginning and 13.9GB in the end (delta: 13.6GB). Free memory was 254.2MB in the beginning and 5.0GB in the end (delta: -4.7GB). Peak memory consumption was 8.9GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 257]: Unsoundness Warning unspecified type, defaulting to int C: short [257] - GenericResultAtLocation [Line: 257]: Unsoundness Warning unspecified type, defaulting to int C: short [257] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 104 PlacesBefore, 36 PlacesAfterwards, 107 TransitionsBefore, 35 TransitionsAfterwards, 2436 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 4 ChoiceCompositions, 76 TotalNumberOfCompositions, 6628 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3245, independent: 3073, independent conditional: 0, independent unconditional: 3073, dependent: 172, dependent conditional: 0, dependent unconditional: 172, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1192, independent: 1169, independent conditional: 0, independent unconditional: 1169, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3245, independent: 1904, independent conditional: 0, independent unconditional: 1904, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 1192, unknown conditional: 0, unknown unconditional: 1192] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 139, Positive conditional cache size: 0, Positive unconditional cache size: 139, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 87 PlacesBefore, 28 PlacesAfterwards, 83 TransitionsBefore, 23 TransitionsAfterwards, 1270 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 63 TotalNumberOfCompositions, 3087 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1499, independent: 1346, independent conditional: 0, independent unconditional: 1346, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 672, independent: 648, independent conditional: 0, independent unconditional: 648, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1499, independent: 698, independent conditional: 0, independent unconditional: 698, dependent: 129, dependent conditional: 0, dependent unconditional: 129, unknown: 672, unknown conditional: 0, unknown unconditional: 672] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 53, Positive conditional cache size: 0, Positive unconditional cache size: 53, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 136 PlacesBefore, 58 PlacesAfterwards, 139 TransitionsBefore, 57 TransitionsAfterwards, 6752 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 4 ChoiceCompositions, 86 TotalNumberOfCompositions, 28160 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12244, independent: 11838, independent conditional: 0, independent unconditional: 11838, dependent: 406, dependent conditional: 0, dependent unconditional: 406, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3251, independent: 3206, independent conditional: 0, independent unconditional: 3206, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 12244, independent: 8632, independent conditional: 0, independent unconditional: 8632, dependent: 361, dependent conditional: 0, dependent unconditional: 361, unknown: 3251, unknown conditional: 0, unknown unconditional: 3251] , Statistics on independence cache: Total cache size (in pairs): 470, Positive cache size: 445, Positive conditional cache size: 0, Positive unconditional cache size: 445, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 727]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L692] 0 pthread_mutex_t ma, mb; [L693] 0 int data1, data2; [L716] 0 pthread_t t1[2], t2[2]; [L719] 0 data1 = 10 [L720] 0 data2 = 10 [L721] 0 int asdf=0; VAL [asdf=0, data1=10, data2=10, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L721] COND TRUE 0 asdf<2 [L721] FCALL, FORK 0 pthread_create(&t1[asdf], 0, thread1, 0) VAL [arg={0:0}, asdf=0, data1=10, data2=10, ma={3:0}, mb={4:0}, pthread_create(&t1[asdf], 0, thread1, 0)=-2, t1={5:0}, t2={6:0}] [L697] 1 data1++ VAL [arg={0:0}, arg={0:0}, data1++=10, data1=10, data2=10, ma={3:0}, mb={4:0}] [L697] 1 data1++ [L721] 0 asdf++ VAL [arg={0:0}, arg={0:0}, asdf=1, data1=11, data2=10, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L700] 1 data2++ VAL [arg={0:0}, arg={0:0}, data1=11, data2=11, ma={3:0}, mb={4:0}] [L702] 1 return 0; [L721] COND TRUE 0 asdf<2 [L721] FCALL, FORK 0 pthread_create(&t1[asdf], 0, thread1, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, asdf=1, data1=11, data2=11, ma={3:0}, mb={4:0}, pthread_create(&t1[asdf], 0, thread1, 0)=-1, t1={5:0}, t2={6:0}] [L697] 2 data1++ VAL [\result={0:0}, arg={0:0}, arg={0:0}, data1=12, data2=11, ma={3:0}, mb={4:0}] [L700] 2 data2++ VAL [\result={0:0}, arg={0:0}, arg={0:0}, data1=12, data2=12, ma={3:0}, mb={4:0}] [L702] 2 return 0; [L721] 0 asdf++ VAL [\result={0:0}, arg={0:0}, arg={0:0}, asdf=2, data1=12, data2=12, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L721] COND FALSE 0 !(asdf<2) [L722] 0 int asdf=0; VAL [\result={0:0}, arg={0:0}, arg={0:0}, asdf=0, asdf=2, data1=12, data2=12, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L722] COND TRUE 0 asdf<2 [L722] FCALL, FORK 0 pthread_create(&t2[asdf], 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=0, asdf=2, data1=12, data2=12, ma={3:0}, mb={4:0}, pthread_create(&t2[asdf], 0, thread2, 0)=0, t1={5:0}, t2={6:0}] [L707] 3 data1+=5 VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=17, data2=12, ma={3:0}, mb={4:0}] [L710] 3 data2-=6 VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=17, data2=6, ma={3:0}, mb={4:0}] [L712] 3 return 0; [L722] 0 asdf++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=1, asdf=2, data1=17, data2=6, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L722] COND TRUE 0 asdf<2 [L722] FCALL, FORK 0 pthread_create(&t2[asdf], 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=1, asdf=2, data1=17, data2=6, ma={3:0}, mb={4:0}, pthread_create(&t2[asdf], 0, thread2, 0)=1, t1={5:0}, t2={6:0}] [L707] 4 data1+=5 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=22, data2=6, ma={3:0}, mb={4:0}] [L722] 0 asdf++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=2, asdf=2, data1=22, data2=6, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L722] COND FALSE 0 !(asdf<2) [L723] 0 int asdf=0; VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, data1=22, data2=6, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L723] COND TRUE 0 asdf<2 [L723] 0 t1[asdf] VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, data1=22, data2=6, ma={3:0}, mb={4:0}, t1={5:0}, t1[asdf]=-2, t2={6:0}] [L723] FCALL, JOIN 1 pthread_join(t1[asdf], 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, data1=22, data2=6, ma={3:0}, mb={4:0}, t1={5:0}, t1[asdf]=-2, t2={6:0}] [L723] 0 asdf++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, data1=22, data2=6, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L723] COND TRUE 0 asdf<2 [L723] 0 t1[asdf] VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, data1=22, data2=6, ma={3:0}, mb={4:0}, t1={5:0}, t1[asdf]=-1, t2={6:0}] [L723] FCALL, JOIN 2 pthread_join(t1[asdf], 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, data1=22, data2=6, ma={3:0}, mb={4:0}, t1={5:0}, t1[asdf]=-1, t2={6:0}] [L723] 0 asdf++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=2, asdf=2, asdf=2, data1=22, data2=6, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L710] 4 data2-=6 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=22, data2=0, ma={3:0}, mb={4:0}] [L712] 4 return 0; [L723] COND FALSE 0 !(asdf<2) [L724] 0 int asdf=0; VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, asdf=2, data1=22, data2=0, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L724] COND TRUE 0 asdf<2 [L724] 0 t2[asdf] VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, asdf=2, data1=22, data2=0, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}, t2[asdf]=0] [L724] FCALL, JOIN 3 pthread_join(t2[asdf], 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, asdf=2, data1=22, data2=0, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}, t2[asdf]=0] [L724] 0 asdf++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, asdf=2, data1=22, data2=0, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L724] COND TRUE 0 asdf<2 [L724] 0 t2[asdf] VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, asdf=2, data1=22, data2=0, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}, t2[asdf]=1] [L724] FCALL, JOIN 4 pthread_join(t2[asdf], 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, asdf=2, data1=22, data2=0, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}, t2[asdf]=1] [L724] 0 asdf++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=2, asdf=2, asdf=2, asdf=2, data1=22, data2=0, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L724] COND FALSE 0 !(asdf<2) [L725] COND TRUE 0 data1!=16 && data2!=5 [L727] 0 reach_error() VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=2, asdf=2, asdf=2, asdf=2, data1=22, data2=0, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 139 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.9s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 117 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 73 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 294 IncrementalHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 10 mSDtfsCounter, 294 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred 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, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 266 SizeOfPredicates, 0 NumberOfNonLiveVariables, 677 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, 167 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: 72.7s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 54.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 20 mSolverCounterUnknown, 3485 SdHoareTripleChecker+Valid, 12.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3347 mSDsluCounter, 3744 SdHoareTripleChecker+Invalid, 11.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1252 IncrementalHoareTripleChecker+Unchecked, 3677 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15198 IncrementalHoareTripleChecker+Invalid, 16545 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 67 mSDtfsCounter, 15198 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 887 GetRequests, 706 SyntacticMatches, 13 SemanticMatches, 168 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1390 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=441occurred in iteration=11, InterpolantAutomatonStates: 95, 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.5s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 939 NumberOfCodeBlocks, 939 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1208 ConstructedInterpolants, 78 QuantifiedInterpolants, 24857 SizeOfPredicates, 35 NumberOfNonLiveVariables, 2604 ConjunctsInSsa, 142 ConjunctsInUnsatCore, 29 InterpolantComputations, 5 PerfectInterpolantSequences, 250/363 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, 139 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.4s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=1, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-04 07:58:09,427 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...