/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 INSUFFICIENT_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/pthread-ext_25_stack_longer-1_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 21:54:55,741 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 21:54:55,820 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 21:54:55,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 21:54:55,826 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 21:54:55,827 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 21:54:55,827 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 21:54:55,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 21:54:55,855 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 21:54:55,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 21:54:55,859 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 21:54:55,859 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 21:54:55,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 21:54:55,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 21:54:55,863 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 21:54:55,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 21:54:55,863 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 21:54:55,863 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 21:54:55,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 21:54:55,864 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 21:54:55,864 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 21:54:55,864 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 21:54:55,865 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 21:54:55,865 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 21:54:55,865 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 21:54:55,865 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 21:54:55,865 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 21:54:55,866 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 21:54:55,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 21:54:55,866 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 21:54:55,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 21:54:55,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 21:54:55,868 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 21:54:55,868 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 21:54:55,868 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 21:54:55,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 21:54:55,868 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 21:54:55,868 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 21:54:55,868 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 21:54:55,868 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 21:54:55,869 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 21:54:55,869 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 -> INSUFFICIENT_FIRST [2023-08-03 21:54:56,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 21:54:56,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 21:54:56,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 21:54:56,143 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 21:54:56,143 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 21:54:56,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/pthread-ext_25_stack_longer-1_bound2.i [2023-08-03 21:54:57,547 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 21:54:57,796 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 21:54:57,796 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/pthread-ext_25_stack_longer-1_bound2.i [2023-08-03 21:54:57,823 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df8421331/3e8744ca103c454fa44010887af717f9/FLAG01aacae1e [2023-08-03 21:54:57,838 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df8421331/3e8744ca103c454fa44010887af717f9 [2023-08-03 21:54:57,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 21:54:57,844 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 21:54:57,846 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 21:54:57,846 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 21:54:57,849 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 21:54:57,850 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 09:54:57" (1/1) ... [2023-08-03 21:54:57,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ee773a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:54:57, skipping insertion in model container [2023-08-03 21:54:57,851 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 09:54:57" (1/1) ... [2023-08-03 21:54:57,896 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 21:54:58,136 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/pthread-ext_25_stack_longer-1_bound2.i[31182,31195] [2023-08-03 21:54:58,151 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 21:54:58,162 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 21:54:58,195 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [256] [2023-08-03 21:54:58,197 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [256] [2023-08-03 21:54:58,222 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/pthread-ext_25_stack_longer-1_bound2.i[31182,31195] [2023-08-03 21:54:58,230 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 21:54:58,263 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 21:54:58,263 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 21:54:58,269 INFO L206 MainTranslator]: Completed translation [2023-08-03 21:54:58,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:54:58 WrapperNode [2023-08-03 21:54:58,270 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 21:54:58,271 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 21:54:58,271 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 21:54:58,271 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 21:54:58,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:54:58" (1/1) ... [2023-08-03 21:54:58,306 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:54:58" (1/1) ... [2023-08-03 21:54:58,329 INFO L138 Inliner]: procedures = 179, calls = 36, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 179 [2023-08-03 21:54:58,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 21:54:58,333 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 21:54:58,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 21:54:58,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 21:54:58,341 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:54:58" (1/1) ... [2023-08-03 21:54:58,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:54:58" (1/1) ... [2023-08-03 21:54:58,353 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:54:58" (1/1) ... [2023-08-03 21:54:58,354 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:54:58" (1/1) ... [2023-08-03 21:54:58,359 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:54:58" (1/1) ... [2023-08-03 21:54:58,362 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:54:58" (1/1) ... [2023-08-03 21:54:58,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:54:58" (1/1) ... [2023-08-03 21:54:58,382 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:54:58" (1/1) ... [2023-08-03 21:54:58,385 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 21:54:58,386 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 21:54:58,386 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 21:54:58,386 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 21:54:58,386 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:54:58" (1/1) ... [2023-08-03 21:54:58,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 21:54:58,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:54:58,430 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-03 21:54:58,461 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-03 21:54:58,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-03 21:54:58,471 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-03 21:54:58,471 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-03 21:54:58,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 21:54:58,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 21:54:58,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 21:54:58,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 21:54:58,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 21:54:58,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 21:54:58,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 21:54:58,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 21:54:58,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 21:54:58,475 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-03 21:54:58,624 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 21:54:58,625 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 21:54:58,873 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 21:54:59,028 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 21:54:59,028 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-03 21:54:59,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 09:54:59 BoogieIcfgContainer [2023-08-03 21:54:59,030 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 21:54:59,032 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 21:54:59,032 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 21:54:59,035 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 21:54:59,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 09:54:57" (1/3) ... [2023-08-03 21:54:59,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e00f02a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 09:54:59, skipping insertion in model container [2023-08-03 21:54:59,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:54:58" (2/3) ... [2023-08-03 21:54:59,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e00f02a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 09:54:59, skipping insertion in model container [2023-08-03 21:54:59,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 09:54:59" (3/3) ... [2023-08-03 21:54:59,037 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-ext_25_stack_longer-1_bound2.i [2023-08-03 21:54:59,044 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 21:54:59,052 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 21:54:59,053 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-03 21:54:59,053 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 21:54:59,119 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 21:54:59,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 100 transitions, 205 flow [2023-08-03 21:54:59,206 INFO L124 PetriNetUnfolderBase]: 8/110 cut-off events. [2023-08-03 21:54:59,206 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 21:54:59,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 110 events. 8/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 113 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2023-08-03 21:54:59,212 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 100 transitions, 205 flow [2023-08-03 21:54:59,217 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 100 transitions, 205 flow [2023-08-03 21:54:59,220 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 21:54:59,231 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 100 transitions, 205 flow [2023-08-03 21:54:59,235 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 100 transitions, 205 flow [2023-08-03 21:54:59,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 100 transitions, 205 flow [2023-08-03 21:54:59,264 INFO L124 PetriNetUnfolderBase]: 8/110 cut-off events. [2023-08-03 21:54:59,264 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 21:54:59,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 110 events. 8/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 113 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2023-08-03 21:54:59,269 INFO L119 LiptonReduction]: Number of co-enabled transitions 1984 [2023-08-03 21:55:04,411 INFO L134 LiptonReduction]: Checked pairs total: 1726 [2023-08-03 21:55:04,412 INFO L136 LiptonReduction]: Total number of compositions: 99 [2023-08-03 21:55:04,424 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-03 21:55:04,429 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;@70ebf50e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 21:55:04,429 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-03 21:55:04,433 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 21:55:04,433 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2023-08-03 21:55:04,433 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 21:55:04,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:55:04,434 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 21:55:04,434 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:55:04,438 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:55:04,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1092898197, now seen corresponding path program 1 times [2023-08-03 21:55:04,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:55:04,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461936069] [2023-08-03 21:55:04,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:55:04,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:55:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 21:55:04,542 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 21:55:04,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 21:55:04,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 21:55:04,578 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 21:55:04,579 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-03 21:55:04,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 21:55:04,581 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-03 21:55:04,583 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (1/2) [2023-08-03 21:55:04,584 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 21:55:04,584 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 21:55:04,634 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 21:55:04,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 163 transitions, 338 flow [2023-08-03 21:55:04,667 INFO L124 PetriNetUnfolderBase]: 15/188 cut-off events. [2023-08-03 21:55:04,668 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-03 21:55:04,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 188 events. 15/188 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 342 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 139. Up to 6 conditions per place. [2023-08-03 21:55:04,670 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 163 transitions, 338 flow [2023-08-03 21:55:04,671 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 163 transitions, 338 flow [2023-08-03 21:55:04,671 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 21:55:04,671 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 163 transitions, 338 flow [2023-08-03 21:55:04,672 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 163 transitions, 338 flow [2023-08-03 21:55:04,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 163 transitions, 338 flow [2023-08-03 21:55:04,697 INFO L124 PetriNetUnfolderBase]: 15/188 cut-off events. [2023-08-03 21:55:04,697 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-03 21:55:04,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 188 events. 15/188 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 342 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 139. Up to 6 conditions per place. [2023-08-03 21:55:04,706 INFO L119 LiptonReduction]: Number of co-enabled transitions 11780 [2023-08-03 21:55:09,280 INFO L134 LiptonReduction]: Checked pairs total: 23811 [2023-08-03 21:55:09,281 INFO L136 LiptonReduction]: Total number of compositions: 125 [2023-08-03 21:55:09,283 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-03 21:55:09,284 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;@70ebf50e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 21:55:09,284 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-03 21:55:09,288 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 21:55:09,289 INFO L124 PetriNetUnfolderBase]: 3/33 cut-off events. [2023-08-03 21:55:09,289 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-03 21:55:09,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:55:09,289 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 21:55:09,289 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:55:09,290 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:55:09,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1302958535, now seen corresponding path program 1 times [2023-08-03 21:55:09,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:55:09,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014098175] [2023-08-03 21:55:09,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:55:09,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:55:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:55:09,496 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:55:09,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:55:09,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014098175] [2023-08-03 21:55:09,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014098175] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:55:09,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764388270] [2023-08-03 21:55:09,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:55:09,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:55:09,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:55:09,507 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-03 21:55:09,509 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-03 21:55:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:55:09,614 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 21:55:09,616 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:55:09,685 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:55:09,685 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 21:55:09,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764388270] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:55:09,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 21:55:09,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 21:55:09,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8065668] [2023-08-03 21:55:09,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:55:09,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:55:09,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:55:09,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:55:09,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 21:55:09,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 288 [2023-08-03 21:55:09,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 58 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 0 states have call successors, (0), 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-03 21:55:09,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:55:09,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 288 [2023-08-03 21:55:09,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:55:10,064 INFO L124 PetriNetUnfolderBase]: 934/1547 cut-off events. [2023-08-03 21:55:10,065 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-08-03 21:55:10,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2993 conditions, 1547 events. 934/1547 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7715 event pairs, 0 based on Foata normal form. 0/1191 useless extension candidates. Maximal degree in co-relation 291. Up to 987 conditions per place. [2023-08-03 21:55:10,069 INFO L140 encePairwiseOnDemand]: 282/288 looper letters, 0 selfloop transitions, 0 changer transitions 101/101 dead transitions. [2023-08-03 21:55:10,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 101 transitions, 370 flow [2023-08-03 21:55:10,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 21:55:10,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 21:55:10,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 751 transitions. [2023-08-03 21:55:10,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5215277777777778 [2023-08-03 21:55:10,084 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 751 transitions. [2023-08-03 21:55:10,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 751 transitions. [2023-08-03 21:55:10,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:55:10,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 751 transitions. [2023-08-03 21:55:10,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 150.2) internal successors, (751), 5 states have internal predecessors, (751), 0 states have call successors, (0), 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-03 21:55:10,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 288.0) internal successors, (1728), 6 states have internal predecessors, (1728), 0 states have call successors, (0), 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-03 21:55:10,100 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 288.0) internal successors, (1728), 6 states have internal predecessors, (1728), 0 states have call successors, (0), 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-03 21:55:10,102 INFO L175 Difference]: Start difference. First operand has 53 places, 58 transitions, 128 flow. Second operand 5 states and 751 transitions. [2023-08-03 21:55:10,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 101 transitions, 370 flow [2023-08-03 21:55:10,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 101 transitions, 369 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 21:55:10,106 INFO L231 Difference]: Finished difference. Result has 55 places, 0 transitions, 0 flow [2023-08-03 21:55:10,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=55, PETRI_TRANSITIONS=0} [2023-08-03 21:55:10,111 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2023-08-03 21:55:10,111 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 0 transitions, 0 flow [2023-08-03 21:55:10,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 0 states have call successors, (0), 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-03 21:55:10,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-03 21:55:10,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-03 21:55:10,318 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-03 21:55:10,318 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-03 21:55:10,319 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE (1/2) [2023-08-03 21:55:10,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 163 transitions, 338 flow [2023-08-03 21:55:10,343 INFO L124 PetriNetUnfolderBase]: 15/188 cut-off events. [2023-08-03 21:55:10,343 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-03 21:55:10,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 188 events. 15/188 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 342 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 139. Up to 6 conditions per place. [2023-08-03 21:55:10,345 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 163 transitions, 338 flow [2023-08-03 21:55:10,347 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 163 transitions, 338 flow [2023-08-03 21:55:10,347 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 21:55:10,347 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 163 transitions, 338 flow [2023-08-03 21:55:10,348 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 163 transitions, 338 flow [2023-08-03 21:55:10,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 163 transitions, 338 flow [2023-08-03 21:55:10,371 INFO L124 PetriNetUnfolderBase]: 15/188 cut-off events. [2023-08-03 21:55:10,372 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-03 21:55:10,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 188 events. 15/188 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 342 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 139. Up to 6 conditions per place. [2023-08-03 21:55:10,378 INFO L119 LiptonReduction]: Number of co-enabled transitions 11780 [2023-08-03 21:55:14,692 INFO L134 LiptonReduction]: Checked pairs total: 24029 [2023-08-03 21:55:14,692 INFO L136 LiptonReduction]: Total number of compositions: 125 [2023-08-03 21:55:14,694 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 21:55:14,695 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;@70ebf50e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 21:55:14,695 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-03 21:55:14,700 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 21:55:14,700 INFO L124 PetriNetUnfolderBase]: 6/44 cut-off events. [2023-08-03 21:55:14,700 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-03 21:55:14,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:55:14,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:55:14,700 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-03 21:55:14,701 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:55:14,701 INFO L85 PathProgramCache]: Analyzing trace with hash 440453578, now seen corresponding path program 1 times [2023-08-03 21:55:14,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:55:14,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254113035] [2023-08-03 21:55:14,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:55:14,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:55:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:55:14,823 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-03 21:55:14,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:55:14,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254113035] [2023-08-03 21:55:14,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254113035] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:55:14,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:55:14,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 21:55:14,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228210776] [2023-08-03 21:55:14,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:55:14,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 21:55:14,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:55:14,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 21:55:14,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-03 21:55:14,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 288 [2023-08-03 21:55:14,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 58 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 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-03 21:55:14,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:55:14,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 288 [2023-08-03 21:55:14,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:55:15,206 INFO L124 PetriNetUnfolderBase]: 1602/3014 cut-off events. [2023-08-03 21:55:15,207 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-08-03 21:55:15,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5429 conditions, 3014 events. 1602/3014 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 19009 event pairs, 375 based on Foata normal form. 0/2334 useless extension candidates. Maximal degree in co-relation 4815. Up to 1630 conditions per place. [2023-08-03 21:55:15,220 INFO L140 encePairwiseOnDemand]: 276/288 looper letters, 73 selfloop transitions, 8 changer transitions 0/100 dead transitions. [2023-08-03 21:55:15,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 100 transitions, 384 flow [2023-08-03 21:55:15,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 21:55:15,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 21:55:15,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 736 transitions. [2023-08-03 21:55:15,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2023-08-03 21:55:15,225 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 736 transitions. [2023-08-03 21:55:15,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 736 transitions. [2023-08-03 21:55:15,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:55:15,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 736 transitions. [2023-08-03 21:55:15,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 147.2) internal successors, (736), 5 states have internal predecessors, (736), 0 states have call successors, (0), 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-03 21:55:15,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 288.0) internal successors, (1728), 6 states have internal predecessors, (1728), 0 states have call successors, (0), 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-03 21:55:15,230 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 288.0) internal successors, (1728), 6 states have internal predecessors, (1728), 0 states have call successors, (0), 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-03 21:55:15,230 INFO L175 Difference]: Start difference. First operand has 53 places, 58 transitions, 128 flow. Second operand 5 states and 736 transitions. [2023-08-03 21:55:15,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 100 transitions, 384 flow [2023-08-03 21:55:15,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 100 transitions, 382 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-03 21:55:15,235 INFO L231 Difference]: Finished difference. Result has 61 places, 63 transitions, 192 flow [2023-08-03 21:55:15,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=192, PETRI_PLACES=61, PETRI_TRANSITIONS=63} [2023-08-03 21:55:15,236 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2023-08-03 21:55:15,236 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 192 flow [2023-08-03 21:55:15,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 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-03 21:55:15,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:55:15,237 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:55:15,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 21:55:15,237 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-03 21:55:15,237 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:55:15,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1511436345, now seen corresponding path program 1 times [2023-08-03 21:55:15,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:55:15,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000881801] [2023-08-03 21:55:15,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:55:15,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:55:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:55:15,308 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-03 21:55:15,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:55:15,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000881801] [2023-08-03 21:55:15,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000881801] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:55:15,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:55:15,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 21:55:15,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465449454] [2023-08-03 21:55:15,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:55:15,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:55:15,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:55:15,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:55:15,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 21:55:15,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 288 [2023-08-03 21:55:15,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 63 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 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-03 21:55:15,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:55:15,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 288 [2023-08-03 21:55:15,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:55:15,651 INFO L124 PetriNetUnfolderBase]: 2041/3729 cut-off events. [2023-08-03 21:55:15,651 INFO L125 PetriNetUnfolderBase]: For 1024/1046 co-relation queries the response was YES. [2023-08-03 21:55:15,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7707 conditions, 3729 events. 2041/3729 cut-off events. For 1024/1046 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 23927 event pairs, 427 based on Foata normal form. 94/3206 useless extension candidates. Maximal degree in co-relation 4107. Up to 2543 conditions per place. [2023-08-03 21:55:15,675 INFO L140 encePairwiseOnDemand]: 283/288 looper letters, 58 selfloop transitions, 3 changer transitions 0/83 dead transitions. [2023-08-03 21:55:15,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 83 transitions, 387 flow [2023-08-03 21:55:15,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:55:15,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:55:15,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2023-08-03 21:55:15,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5289351851851852 [2023-08-03 21:55:15,677 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2023-08-03 21:55:15,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2023-08-03 21:55:15,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:55:15,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2023-08-03 21:55:15,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 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-03 21:55:15,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 288.0) internal successors, (1152), 4 states have internal predecessors, (1152), 0 states have call successors, (0), 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-03 21:55:15,683 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 288.0) internal successors, (1152), 4 states have internal predecessors, (1152), 0 states have call successors, (0), 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-03 21:55:15,687 INFO L175 Difference]: Start difference. First operand has 61 places, 63 transitions, 192 flow. Second operand 3 states and 457 transitions. [2023-08-03 21:55:15,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 83 transitions, 387 flow [2023-08-03 21:55:15,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 83 transitions, 387 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 21:55:15,694 INFO L231 Difference]: Finished difference. Result has 64 places, 65 transitions, 213 flow [2023-08-03 21:55:15,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=213, PETRI_PLACES=64, PETRI_TRANSITIONS=65} [2023-08-03 21:55:15,695 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 11 predicate places. [2023-08-03 21:55:15,697 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 65 transitions, 213 flow [2023-08-03 21:55:15,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 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-03 21:55:15,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:55:15,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:55:15,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-03 21:55:15,698 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-03 21:55:15,698 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:55:15,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1011828470, now seen corresponding path program 1 times [2023-08-03 21:55:15,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:55:15,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103314762] [2023-08-03 21:55:15,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:55:15,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:55:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:55:15,847 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-03 21:55:15,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:55:15,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103314762] [2023-08-03 21:55:15,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103314762] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:55:15,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:55:15,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 21:55:15,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289014621] [2023-08-03 21:55:15,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:55:15,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:55:15,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:55:15,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:55:15,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:55:15,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 288 [2023-08-03 21:55:15,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 65 transitions, 213 flow. Second operand has 5 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 0 states have call successors, (0), 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-03 21:55:15,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:55:15,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 288 [2023-08-03 21:55:15,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:55:16,501 INFO L124 PetriNetUnfolderBase]: 3072/5488 cut-off events. [2023-08-03 21:55:16,501 INFO L125 PetriNetUnfolderBase]: For 1503/1537 co-relation queries the response was YES. [2023-08-03 21:55:16,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11771 conditions, 5488 events. 3072/5488 cut-off events. For 1503/1537 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 35877 event pairs, 671 based on Foata normal form. 22/4559 useless extension candidates. Maximal degree in co-relation 7727. Up to 2748 conditions per place. [2023-08-03 21:55:16,529 INFO L140 encePairwiseOnDemand]: 280/288 looper letters, 114 selfloop transitions, 8 changer transitions 0/143 dead transitions. [2023-08-03 21:55:16,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 143 transitions, 698 flow [2023-08-03 21:55:16,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-03 21:55:16,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-03 21:55:16,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 874 transitions. [2023-08-03 21:55:16,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5057870370370371 [2023-08-03 21:55:16,532 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 874 transitions. [2023-08-03 21:55:16,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 874 transitions. [2023-08-03 21:55:16,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:55:16,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 874 transitions. [2023-08-03 21:55:16,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 145.66666666666666) internal successors, (874), 6 states have internal predecessors, (874), 0 states have call successors, (0), 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-03 21:55:16,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 288.0) internal successors, (2016), 7 states have internal predecessors, (2016), 0 states have call successors, (0), 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-03 21:55:16,538 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 288.0) internal successors, (2016), 7 states have internal predecessors, (2016), 0 states have call successors, (0), 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-03 21:55:16,538 INFO L175 Difference]: Start difference. First operand has 64 places, 65 transitions, 213 flow. Second operand 6 states and 874 transitions. [2023-08-03 21:55:16,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 143 transitions, 698 flow [2023-08-03 21:55:16,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 143 transitions, 694 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 21:55:16,542 INFO L231 Difference]: Finished difference. Result has 71 places, 70 transitions, 258 flow [2023-08-03 21:55:16,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=71, PETRI_TRANSITIONS=70} [2023-08-03 21:55:16,543 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 18 predicate places. [2023-08-03 21:55:16,543 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 258 flow [2023-08-03 21:55:16,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 0 states have call successors, (0), 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-03 21:55:16,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:55:16,544 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:55:16,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-03 21:55:16,544 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-03 21:55:16,544 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:55:16,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1614561468, now seen corresponding path program 1 times [2023-08-03 21:55:16,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:55:16,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405684718] [2023-08-03 21:55:16,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:55:16,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:55:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:55:16,618 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-03 21:55:16,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:55:16,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405684718] [2023-08-03 21:55:16,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405684718] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:55:16,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:55:16,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 21:55:16,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659514154] [2023-08-03 21:55:16,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:55:16,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:55:16,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:55:16,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:55:16,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:55:16,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 288 [2023-08-03 21:55:16,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 258 flow. Second operand has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 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-03 21:55:16,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:55:16,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 288 [2023-08-03 21:55:16,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:55:17,551 INFO L124 PetriNetUnfolderBase]: 4498/8074 cut-off events. [2023-08-03 21:55:17,551 INFO L125 PetriNetUnfolderBase]: For 2753/2783 co-relation queries the response was YES. [2023-08-03 21:55:17,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18197 conditions, 8074 events. 4498/8074 cut-off events. For 2753/2783 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 56323 event pairs, 975 based on Foata normal form. 22/6741 useless extension candidates. Maximal degree in co-relation 12315. Up to 4221 conditions per place. [2023-08-03 21:55:17,602 INFO L140 encePairwiseOnDemand]: 280/288 looper letters, 126 selfloop transitions, 9 changer transitions 0/157 dead transitions. [2023-08-03 21:55:17,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 157 transitions, 852 flow [2023-08-03 21:55:17,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-03 21:55:17,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-03 21:55:17,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 871 transitions. [2023-08-03 21:55:17,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5040509259259259 [2023-08-03 21:55:17,605 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 871 transitions. [2023-08-03 21:55:17,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 871 transitions. [2023-08-03 21:55:17,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:55:17,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 871 transitions. [2023-08-03 21:55:17,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 145.16666666666666) internal successors, (871), 6 states have internal predecessors, (871), 0 states have call successors, (0), 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-03 21:55:17,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 288.0) internal successors, (2016), 7 states have internal predecessors, (2016), 0 states have call successors, (0), 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-03 21:55:17,610 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 288.0) internal successors, (2016), 7 states have internal predecessors, (2016), 0 states have call successors, (0), 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-03 21:55:17,610 INFO L175 Difference]: Start difference. First operand has 71 places, 70 transitions, 258 flow. Second operand 6 states and 871 transitions. [2023-08-03 21:55:17,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 157 transitions, 852 flow [2023-08-03 21:55:17,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 157 transitions, 842 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-03 21:55:17,618 INFO L231 Difference]: Finished difference. Result has 77 places, 75 transitions, 304 flow [2023-08-03 21:55:17,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=304, PETRI_PLACES=77, PETRI_TRANSITIONS=75} [2023-08-03 21:55:17,618 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 24 predicate places. [2023-08-03 21:55:17,618 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 75 transitions, 304 flow [2023-08-03 21:55:17,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 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-03 21:55:17,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:55:17,619 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-03 21:55:17,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-03 21:55:17,619 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-03 21:55:17,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:55:17,620 INFO L85 PathProgramCache]: Analyzing trace with hash -547698110, now seen corresponding path program 1 times [2023-08-03 21:55:17,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:55:17,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192635252] [2023-08-03 21:55:17,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:55:17,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:55:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 21:55:17,653 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 21:55:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 21:55:17,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 21:55:17,712 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 21:55:17,712 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-03 21:55:17,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-03 21:55:17,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-03 21:55:17,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-03 21:55:17,713 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-03 21:55:17,713 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2023-08-03 21:55:17,716 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 21:55:17,716 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 21:55:17,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 09:55:17 BasicIcfg [2023-08-03 21:55:17,795 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 21:55:17,796 INFO L158 Benchmark]: Toolchain (without parser) took 19951.99ms. Allocated memory was 450.9MB in the beginning and 650.1MB in the end (delta: 199.2MB). Free memory was 399.4MB in the beginning and 258.4MB in the end (delta: 141.0MB). Peak memory consumption was 342.0MB. Max. memory is 16.0GB. [2023-08-03 21:55:17,796 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 331.4MB. Free memory was 284.1MB in the beginning and 284.0MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 21:55:17,796 INFO L158 Benchmark]: CACSL2BoogieTranslator took 423.64ms. Allocated memory is still 450.9MB. Free memory was 399.1MB in the beginning and 378.7MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-03 21:55:17,796 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.99ms. Allocated memory is still 450.9MB. Free memory was 378.7MB in the beginning and 376.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 21:55:17,797 INFO L158 Benchmark]: Boogie Preprocessor took 52.00ms. Allocated memory is still 450.9MB. Free memory was 376.0MB in the beginning and 374.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 21:55:17,797 INFO L158 Benchmark]: RCFGBuilder took 644.84ms. Allocated memory is still 450.9MB. Free memory was 374.3MB in the beginning and 386.8MB in the end (delta: -12.5MB). Peak memory consumption was 14.4MB. Max. memory is 16.0GB. [2023-08-03 21:55:17,797 INFO L158 Benchmark]: TraceAbstraction took 18762.90ms. Allocated memory was 450.9MB in the beginning and 650.1MB in the end (delta: 199.2MB). Free memory was 385.7MB in the beginning and 258.4MB in the end (delta: 127.3MB). Peak memory consumption was 325.5MB. Max. memory is 16.0GB. [2023-08-03 21:55:17,799 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 331.4MB. Free memory was 284.1MB in the beginning and 284.0MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 423.64ms. Allocated memory is still 450.9MB. Free memory was 399.1MB in the beginning and 378.7MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 61.99ms. Allocated memory is still 450.9MB. Free memory was 378.7MB in the beginning and 376.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 52.00ms. Allocated memory is still 450.9MB. Free memory was 376.0MB in the beginning and 374.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 644.84ms. Allocated memory is still 450.9MB. Free memory was 374.3MB in the beginning and 386.8MB in the end (delta: -12.5MB). Peak memory consumption was 14.4MB. Max. memory is 16.0GB. * TraceAbstraction took 18762.90ms. Allocated memory was 450.9MB in the beginning and 650.1MB in the end (delta: 199.2MB). Free memory was 385.7MB in the beginning and 258.4MB in the end (delta: 127.3MB). Peak memory consumption was 325.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 256]: Unsoundness Warning unspecified type, defaulting to int C: short [256] - GenericResultAtLocation [Line: 256]: Unsoundness Warning unspecified type, defaulting to int C: short [256] - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 96 PlacesBefore, 17 PlacesAfterwards, 100 TransitionsBefore, 17 TransitionsAfterwards, 1984 CoEnabledTransitionPairs, 5 FixpointIterations, 20 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 99 TotalNumberOfCompositions, 1726 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1518, independent: 1471, independent conditional: 0, independent unconditional: 1471, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1073, independent: 1049, independent conditional: 0, independent unconditional: 1049, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1518, independent: 422, independent conditional: 0, independent unconditional: 422, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 1073, unknown conditional: 0, unknown unconditional: 1073] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 19, Positive conditional cache size: 0, Positive unconditional cache size: 19, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 155 PlacesBefore, 53 PlacesAfterwards, 163 TransitionsBefore, 58 TransitionsAfterwards, 11780 CoEnabledTransitionPairs, 5 FixpointIterations, 20 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 23 ConcurrentYvCompositions, 3 ChoiceCompositions, 125 TotalNumberOfCompositions, 23811 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10674, independent: 10291, independent conditional: 0, independent unconditional: 10291, dependent: 383, dependent conditional: 0, dependent unconditional: 383, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5875, independent: 5809, independent conditional: 0, independent unconditional: 5809, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10674, independent: 4482, independent conditional: 0, independent unconditional: 4482, dependent: 317, dependent conditional: 0, dependent unconditional: 317, unknown: 5875, unknown conditional: 0, unknown unconditional: 5875] , Statistics on independence cache: Total cache size (in pairs): 358, Positive cache size: 326, Positive conditional cache size: 0, Positive unconditional cache size: 326, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 155 PlacesBefore, 53 PlacesAfterwards, 163 TransitionsBefore, 58 TransitionsAfterwards, 11780 CoEnabledTransitionPairs, 5 FixpointIterations, 20 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 23 ConcurrentYvCompositions, 3 ChoiceCompositions, 125 TotalNumberOfCompositions, 24029 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11676, independent: 11289, independent conditional: 0, independent unconditional: 11289, dependent: 387, dependent conditional: 0, dependent unconditional: 387, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5966, independent: 5898, independent conditional: 0, independent unconditional: 5898, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11676, independent: 5391, independent conditional: 0, independent unconditional: 5391, dependent: 319, dependent conditional: 0, dependent unconditional: 319, unknown: 5966, unknown conditional: 0, unknown unconditional: 5966] , Statistics on independence cache: Total cache size (in pairs): 414, Positive cache size: 381, Positive conditional cache size: 0, Positive unconditional cache size: 381, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 749]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L701] 0 int memory[(2*320+1)]; [L702] 0 int next_alloc_idx = 1; [L703] 0 int m = 0; [L704] 0 int top; [L759] 0 int m2 = 0; [L760] 0 int state = 0; [L778] 0 pthread_t t; [L779] 0 int asdf=0; VAL [asdf=0, m2={4:0}, m={3:0}, next_alloc_idx=1, state=0, t={5:0}, top=0] [L779] COND TRUE 0 asdf<2 [L779] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [asdf=0, m2={4:0}, m={3:0}, next_alloc_idx=1, pthread_create(&t, 0, thr1, 0)=6, state=0, t={5:0}, top=0] [L763] CALL 1 __VERIFIER_atomic_acquire(&m2) [L693] EXPR 1 \read(*m) [L693] CALL 1 assume_abort_if_not(*m==0) [L4] COND FALSE 1 !(!cond) [L693] RET 1 assume_abort_if_not(*m==0) [L694] 1 *m = 1 [L763] RET 1 __VERIFIER_atomic_acquire(&m2) [L766] 1 case 0: [L767] CALL 1 EBStack_init() [L719] 1 top = 0 VAL [m2={4:0}, m={3:0}, next_alloc_idx=1, state=0, top=0] [L767] RET 1 EBStack_init() [L768] 1 state = 1 VAL [arg={0:0}, arg={0:0}, m2={4:0}, m={3:0}, next_alloc_idx=1, state=1, top=0] [L769] 1 case 1: [L770] CALL 1 __VERIFIER_atomic_release(&m2) [L698] EXPR 1 \read(*m) [L698] CALL 1 assume_abort_if_not(*m==1) [L4] COND FALSE 1 !(!cond) [L698] RET 1 assume_abort_if_not(*m==1) [L699] 1 *m = 0 [L770] RET 1 __VERIFIER_atomic_release(&m2) [L771] CALL 1 push_loop() [L752] 1 int r = -1; [L753] 1 int arg = __VERIFIER_nondet_int(); [L754] COND TRUE 1 1 [L755] CALL, EXPR 1 push(arg) [L728] 1 int oldTop = -1, newTop = -1; [L729] CALL, EXPR 1 index_malloc() [L706] 1 int curr_alloc_idx = -1; [L707] CALL 1 __VERIFIER_atomic_acquire(&m) [L693] EXPR 1 \read(*m) [L693] CALL 1 assume_abort_if_not(*m==0) [L4] COND FALSE 1 !(!cond) [L693] RET 1 assume_abort_if_not(*m==0) [L694] 1 *m = 1 [L707] RET 1 __VERIFIER_atomic_acquire(&m) [L708] COND FALSE 1 !(next_alloc_idx+2-1 > (2*320+1)) VAL [curr_alloc_idx=-1, m2={4:0}, m={3:0}, next_alloc_idx=1, state=1, top=0] [L712] 1 curr_alloc_idx = next_alloc_idx VAL [curr_alloc_idx=1, m2={4:0}, m={3:0}, next_alloc_idx=1, state=1, top=0] [L713] 1 next_alloc_idx += 2 VAL [curr_alloc_idx=1, m2={4:0}, m={3:0}, next_alloc_idx=3, state=1, top=0] [L714] CALL 1 __VERIFIER_atomic_release(&m) [L698] EXPR 1 \read(*m) [L698] CALL 1 assume_abort_if_not(*m==1) [L4] COND FALSE 1 !(!cond) [L698] RET 1 assume_abort_if_not(*m==1) [L699] 1 *m = 0 [L714] RET 1 __VERIFIER_atomic_release(&m) [L716] 1 return curr_alloc_idx; [L729] RET, EXPR 1 index_malloc() [L729] 1 newTop = index_malloc() [L730] COND FALSE 1 !(newTop == 0) [L733] 1 memory[newTop+0] = d VAL [\old(d)=-1, d=-1, m2={4:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=-1, state=1, top=0] [L734] CALL 1 __VERIFIER_atomic_acquire(&m) [L693] EXPR 1 \read(*m) [L693] CALL 1 assume_abort_if_not(*m==0) [L4] COND FALSE 1 !(!cond) [L693] RET 1 assume_abort_if_not(*m==0) [L694] 1 *m = 1 [L734] RET 1 __VERIFIER_atomic_acquire(&m) [L735] 1 oldTop = top VAL [\old(d)=-1, d=-1, m2={4:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=0, state=1, top=0] [L736] 1 memory[newTop+1] = oldTop VAL [\old(d)=-1, d=-1, m2={4:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=0, state=1, top=0] [L738] 1 top = newTop VAL [\old(d)=-1, d=-1, m2={4:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=0, state=1, top=1] [L740] CALL 1 __VERIFIER_atomic_release(&m) [L698] EXPR 1 \read(*m) [L698] CALL 1 assume_abort_if_not(*m==1) [L4] COND FALSE 1 !(!cond) [L698] RET 1 assume_abort_if_not(*m==1) [L699] 1 *m = 0 [L740] RET 1 __VERIFIER_atomic_release(&m) [L741] 1 return 1; [L755] RET, EXPR 1 push(arg) [L755] 1 r = push(arg) VAL [arg=-1, m2={4:0}, m={3:0}, next_alloc_idx=3, push(arg)=1, r=1, state=1, top=1] [L756] CALL 1 __VERIFIER_atomic_assert(r) [L749] EXPR 1 !r || !isEmpty() [L749] CALL, EXPR 1 isEmpty() [L722] COND FALSE 1 !(top == 0) [L725] 1 return 0; [L749] RET, EXPR 1 isEmpty() [L749] EXPR 1 !r || !isEmpty() [L749] COND TRUE 1 !(!(!r || !isEmpty())) [L749] 1 reach_error() VAL [\old(r)=1, m2={4:0}, m={3:0}, next_alloc_idx=3, r=1, state=1, top=1] - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 151 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: 5.4s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, InterpolantAutomatonStates: 0, 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, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 4 procedures, 208 locations, 4 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: 5.7s, OverallIterations: 1, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 134 IncrementalHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 0 mSDtfsCounter, 134 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=0, InterpolantAutomatonStates: 5, 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.3s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 56 SizeOfPredicates, 0 NumberOfNonLiveVariables, 111 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 11/16 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 1 thread instances CFG has 4 procedures, 208 locations, 4 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: 7.4s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 322 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 272 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 763 IncrementalHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 24 mSDtfsCounter, 763 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=4, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 83 NumberOfCodeBlocks, 83 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 150 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2/2 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-03 21:55:17,818 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...