/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_36_stack_cas_p0_vs_concur_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 21:56:42,615 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 21:56:42,692 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 21:56:42,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 21:56:42,698 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 21:56:42,699 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 21:56:42,699 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 21:56:42,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 21:56:42,728 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 21:56:42,729 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 21:56:42,731 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 21:56:42,732 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 21:56:42,732 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 21:56:42,734 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 21:56:42,734 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 21:56:42,734 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 21:56:42,735 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 21:56:42,735 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 21:56:42,735 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 21:56:42,735 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 21:56:42,736 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 21:56:42,736 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 21:56:42,736 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 21:56:42,736 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 21:56:42,738 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 21:56:42,738 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 21:56:42,738 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 21:56:42,738 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 21:56:42,739 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 21:56:42,739 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 21:56:42,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 21:56:42,740 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 21:56:42,740 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 21:56:42,740 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 21:56:42,740 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 21:56:42,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 21:56:42,741 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 21:56:42,741 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 21:56:42,741 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 21:56:42,741 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 21:56:42,741 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 21:56:42,741 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:56:42,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 21:56:43,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 21:56:43,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 21:56:43,028 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 21:56:43,029 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 21:56:43,030 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/pthread-ext_36_stack_cas_p0_vs_concur_bound2.i [2023-08-03 21:56:44,303 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 21:56:44,603 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 21:56:44,603 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/pthread-ext_36_stack_cas_p0_vs_concur_bound2.i [2023-08-03 21:56:44,614 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c71680d42/d1c1e7878efb41288e3d57c9bf725f63/FLAG3fedb9cb4 [2023-08-03 21:56:44,629 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c71680d42/d1c1e7878efb41288e3d57c9bf725f63 [2023-08-03 21:56:44,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 21:56:44,633 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 21:56:44,634 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 21:56:44,634 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 21:56:44,637 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 21:56:44,638 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 09:56:44" (1/1) ... [2023-08-03 21:56:44,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ce70cdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:56:44, skipping insertion in model container [2023-08-03 21:56:44,639 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 09:56:44" (1/1) ... [2023-08-03 21:56:44,671 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 21:56:44,892 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_36_stack_cas_p0_vs_concur_bound2.i[30687,30700] [2023-08-03 21:56:44,896 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 21:56:44,906 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 21:56:44,924 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [253] [2023-08-03 21:56:44,926 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [253] [2023-08-03 21:56:44,941 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_36_stack_cas_p0_vs_concur_bound2.i[30687,30700] [2023-08-03 21:56:44,943 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 21:56:44,969 INFO L206 MainTranslator]: Completed translation [2023-08-03 21:56:44,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:56:44 WrapperNode [2023-08-03 21:56:44,970 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 21:56:44,971 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 21:56:44,971 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 21:56:44,971 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 21:56:44,977 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:56:44" (1/1) ... [2023-08-03 21:56:44,989 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:56:44" (1/1) ... [2023-08-03 21:56:45,013 INFO L138 Inliner]: procedures = 170, calls = 35, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 106 [2023-08-03 21:56:45,014 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 21:56:45,015 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 21:56:45,015 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 21:56:45,015 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 21:56:45,022 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:56:44" (1/1) ... [2023-08-03 21:56:45,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:56:44" (1/1) ... [2023-08-03 21:56:45,035 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:56:44" (1/1) ... [2023-08-03 21:56:45,035 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:56:44" (1/1) ... [2023-08-03 21:56:45,039 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:56:44" (1/1) ... [2023-08-03 21:56:45,042 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:56:44" (1/1) ... [2023-08-03 21:56:45,044 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:56:44" (1/1) ... [2023-08-03 21:56:45,056 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:56:44" (1/1) ... [2023-08-03 21:56:45,061 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 21:56:45,062 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 21:56:45,062 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 21:56:45,062 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 21:56:45,063 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:56:44" (1/1) ... [2023-08-03 21:56:45,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 21:56:45,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:56:45,099 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:56:45,109 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:56:45,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-03 21:56:45,135 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-03 21:56:45,136 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-03 21:56:45,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 21:56:45,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 21:56:45,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 21:56:45,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 21:56:45,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 21:56:45,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 21:56:45,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 21:56:45,139 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:56:45,251 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 21:56:45,253 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 21:56:45,415 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 21:56:45,483 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 21:56:45,484 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-03 21:56:45,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 09:56:45 BoogieIcfgContainer [2023-08-03 21:56:45,486 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 21:56:45,488 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 21:56:45,488 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 21:56:45,491 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 21:56:45,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 09:56:44" (1/3) ... [2023-08-03 21:56:45,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@471c0de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 09:56:45, skipping insertion in model container [2023-08-03 21:56:45,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:56:44" (2/3) ... [2023-08-03 21:56:45,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@471c0de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 09:56:45, skipping insertion in model container [2023-08-03 21:56:45,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 09:56:45" (3/3) ... [2023-08-03 21:56:45,493 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-ext_36_stack_cas_p0_vs_concur_bound2.i [2023-08-03 21:56:45,500 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 21:56:45,509 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 21:56:45,509 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-03 21:56:45,510 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 21:56:45,589 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 21:56:45,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 95 transitions, 195 flow [2023-08-03 21:56:45,670 INFO L124 PetriNetUnfolderBase]: 10/105 cut-off events. [2023-08-03 21:56:45,671 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 21:56:45,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 105 events. 10/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 122 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2023-08-03 21:56:45,676 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 95 transitions, 195 flow [2023-08-03 21:56:45,680 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 95 transitions, 195 flow [2023-08-03 21:56:45,683 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 21:56:45,691 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 95 transitions, 195 flow [2023-08-03 21:56:45,693 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 95 transitions, 195 flow [2023-08-03 21:56:45,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 95 transitions, 195 flow [2023-08-03 21:56:45,717 INFO L124 PetriNetUnfolderBase]: 10/105 cut-off events. [2023-08-03 21:56:45,717 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 21:56:45,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 105 events. 10/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 122 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2023-08-03 21:56:45,720 INFO L119 LiptonReduction]: Number of co-enabled transitions 1984 [2023-08-03 21:56:47,449 INFO L134 LiptonReduction]: Checked pairs total: 2843 [2023-08-03 21:56:47,449 INFO L136 LiptonReduction]: Total number of compositions: 83 [2023-08-03 21:56:47,474 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-03 21:56:47,479 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;@5f29ec60, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 21:56:47,479 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-03 21:56:47,483 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 21:56:47,483 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2023-08-03 21:56:47,483 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 21:56:47,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:56:47,484 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 21:56:47,485 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:56:47,489 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:56:47,489 INFO L85 PathProgramCache]: Analyzing trace with hash 771863353, now seen corresponding path program 1 times [2023-08-03 21:56:47,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:56:47,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615651701] [2023-08-03 21:56:47,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:56:47,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:56:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 21:56:47,597 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 21:56:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 21:56:47,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 21:56:47,636 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 21:56:47,638 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-03 21:56:47,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 21:56:47,640 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-03 21:56:47,644 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (1/2) [2023-08-03 21:56:47,645 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 21:56:47,645 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 21:56:47,687 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 21:56:47,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 158 transitions, 328 flow [2023-08-03 21:56:47,759 INFO L124 PetriNetUnfolderBase]: 19/183 cut-off events. [2023-08-03 21:56:47,759 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-03 21:56:47,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 183 events. 19/183 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 412 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 139. Up to 6 conditions per place. [2023-08-03 21:56:47,765 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 158 transitions, 328 flow [2023-08-03 21:56:47,767 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 146 places, 158 transitions, 328 flow [2023-08-03 21:56:47,767 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 21:56:47,768 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 158 transitions, 328 flow [2023-08-03 21:56:47,768 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 158 transitions, 328 flow [2023-08-03 21:56:47,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 158 transitions, 328 flow [2023-08-03 21:56:47,816 INFO L124 PetriNetUnfolderBase]: 19/183 cut-off events. [2023-08-03 21:56:47,817 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-03 21:56:47,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 183 events. 19/183 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 412 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 139. Up to 6 conditions per place. [2023-08-03 21:56:47,827 INFO L119 LiptonReduction]: Number of co-enabled transitions 11780 [2023-08-03 21:56:49,766 INFO L134 LiptonReduction]: Checked pairs total: 21821 [2023-08-03 21:56:49,767 INFO L136 LiptonReduction]: Total number of compositions: 123 [2023-08-03 21:56:49,769 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-03 21:56:49,770 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;@5f29ec60, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 21:56:49,770 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-03 21:56:49,774 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 21:56:49,774 INFO L124 PetriNetUnfolderBase]: 1/30 cut-off events. [2023-08-03 21:56:49,774 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-03 21:56:49,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:56:49,774 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 21:56:49,775 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:56:49,775 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:56:49,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1734102252, now seen corresponding path program 1 times [2023-08-03 21:56:49,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:56:49,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823173882] [2023-08-03 21:56:49,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:56:49,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:56:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:56:49,908 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:56:49,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:56:49,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823173882] [2023-08-03 21:56:49,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823173882] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:56:49,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:56:49,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 21:56:49,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101582917] [2023-08-03 21:56:49,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:56:49,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:56:49,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:56:49,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:56:49,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:56:49,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 281 [2023-08-03 21:56:49,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 54 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 133.6) internal successors, (668), 5 states have internal predecessors, (668), 0 states have call successors, (0), 0 states 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:56:49,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:56:49,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 281 [2023-08-03 21:56:49,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:56:50,321 INFO L124 PetriNetUnfolderBase]: 1480/2363 cut-off events. [2023-08-03 21:56:50,321 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-08-03 21:56:50,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4701 conditions, 2363 events. 1480/2363 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 11173 event pairs, 45 based on Foata normal form. 0/2052 useless extension candidates. Maximal degree in co-relation 621. Up to 1669 conditions per place. [2023-08-03 21:56:50,328 INFO L140 encePairwiseOnDemand]: 273/281 looper letters, 0 selfloop transitions, 0 changer transitions 101/101 dead transitions. [2023-08-03 21:56:50,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 101 transitions, 396 flow [2023-08-03 21:56:50,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 21:56:50,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 21:56:50,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 764 transitions. [2023-08-03 21:56:50,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5437722419928825 [2023-08-03 21:56:50,346 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 764 transitions. [2023-08-03 21:56:50,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 764 transitions. [2023-08-03 21:56:50,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:56:50,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 764 transitions. [2023-08-03 21:56:50,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 152.8) internal successors, (764), 5 states have internal predecessors, (764), 0 states have call successors, (0), 0 states 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:56:50,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states 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:56:50,366 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states 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:56:50,367 INFO L175 Difference]: Start difference. First operand has 51 places, 54 transitions, 120 flow. Second operand 5 states and 764 transitions. [2023-08-03 21:56:50,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 101 transitions, 396 flow [2023-08-03 21:56:50,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 101 transitions, 395 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 21:56:50,374 INFO L231 Difference]: Finished difference. Result has 49 places, 0 transitions, 0 flow [2023-08-03 21:56:50,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=49, PETRI_TRANSITIONS=0} [2023-08-03 21:56:50,379 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2023-08-03 21:56:50,380 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 0 transitions, 0 flow [2023-08-03 21:56:50,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.6) internal successors, (668), 5 states have internal predecessors, (668), 0 states have call successors, (0), 0 states 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:56:50,381 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-03 21:56:50,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 21:56:50,381 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-03 21:56:50,382 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE (1/2) [2023-08-03 21:56:50,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 158 transitions, 328 flow [2023-08-03 21:56:50,411 INFO L124 PetriNetUnfolderBase]: 19/183 cut-off events. [2023-08-03 21:56:50,412 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-03 21:56:50,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 183 events. 19/183 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 412 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 139. Up to 6 conditions per place. [2023-08-03 21:56:50,415 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 158 transitions, 328 flow [2023-08-03 21:56:50,417 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 146 places, 158 transitions, 328 flow [2023-08-03 21:56:50,421 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 21:56:50,421 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 158 transitions, 328 flow [2023-08-03 21:56:50,422 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 158 transitions, 328 flow [2023-08-03 21:56:50,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 158 transitions, 328 flow [2023-08-03 21:56:50,442 INFO L124 PetriNetUnfolderBase]: 19/183 cut-off events. [2023-08-03 21:56:50,442 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-03 21:56:50,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 183 events. 19/183 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 412 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 139. Up to 6 conditions per place. [2023-08-03 21:56:50,448 INFO L119 LiptonReduction]: Number of co-enabled transitions 11780 [2023-08-03 21:56:52,248 INFO L134 LiptonReduction]: Checked pairs total: 21334 [2023-08-03 21:56:52,248 INFO L136 LiptonReduction]: Total number of compositions: 124 [2023-08-03 21:56:52,250 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 21:56:52,251 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;@5f29ec60, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 21:56:52,251 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-03 21:56:52,255 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 21:56:52,256 INFO L124 PetriNetUnfolderBase]: 2/37 cut-off events. [2023-08-03 21:56:52,256 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-03 21:56:52,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:56:52,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:56:52,256 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-03 21:56:52,257 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:56:52,257 INFO L85 PathProgramCache]: Analyzing trace with hash -461305307, now seen corresponding path program 1 times [2023-08-03 21:56:52,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:56:52,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029851937] [2023-08-03 21:56:52,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:56:52,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:56:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:56:52,313 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:56:52,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:56:52,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029851937] [2023-08-03 21:56:52,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029851937] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:56:52,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:56:52,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 21:56:52,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135064685] [2023-08-03 21:56:52,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:56:52,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-03 21:56:52,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:56:52,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-03 21:56:52,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-03 21:56:52,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 282 [2023-08-03 21:56:52,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 54 transitions, 120 flow. Second operand has 2 states, 2 states have (on average 142.5) internal successors, (285), 2 states have internal predecessors, (285), 0 states have call successors, (0), 0 states 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:56:52,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:56:52,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 282 [2023-08-03 21:56:52,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:56:52,580 INFO L124 PetriNetUnfolderBase]: 1929/3090 cut-off events. [2023-08-03 21:56:52,581 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-08-03 21:56:52,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6102 conditions, 3090 events. 1929/3090 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 15161 event pairs, 1609 based on Foata normal form. 64/2501 useless extension candidates. Maximal degree in co-relation 5064. Up to 2953 conditions per place. [2023-08-03 21:56:52,598 INFO L140 encePairwiseOnDemand]: 277/282 looper letters, 38 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2023-08-03 21:56:52,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 47 transitions, 182 flow [2023-08-03 21:56:52,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-03 21:56:52,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-03 21:56:52,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 317 transitions. [2023-08-03 21:56:52,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5620567375886525 [2023-08-03 21:56:52,601 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 317 transitions. [2023-08-03 21:56:52,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 317 transitions. [2023-08-03 21:56:52,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:56:52,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 317 transitions. [2023-08-03 21:56:52,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 158.5) internal successors, (317), 2 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:56:52,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 0 states have call successors, (0), 0 states 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:56:52,604 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 0 states have call successors, (0), 0 states 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:56:52,604 INFO L175 Difference]: Start difference. First operand has 51 places, 54 transitions, 120 flow. Second operand 2 states and 317 transitions. [2023-08-03 21:56:52,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 47 transitions, 182 flow [2023-08-03 21:56:52,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 47 transitions, 180 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-03 21:56:52,608 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 104 flow [2023-08-03 21:56:52,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=104, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2023-08-03 21:56:52,611 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2023-08-03 21:56:52,611 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 104 flow [2023-08-03 21:56:52,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 142.5) internal successors, (285), 2 states have internal predecessors, (285), 0 states have call successors, (0), 0 states 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:56:52,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:56:52,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:56:52,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 21:56:52,612 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-03 21:56:52,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:56:52,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1103003321, now seen corresponding path program 1 times [2023-08-03 21:56:52,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:56:52,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421761427] [2023-08-03 21:56:52,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:56:52,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:56:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:56:53,089 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:56:53,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:56:53,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421761427] [2023-08-03 21:56:53,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421761427] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:56:53,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:56:53,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-03 21:56:53,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237093900] [2023-08-03 21:56:53,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:56:53,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-03 21:56:53,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:56:53,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-03 21:56:53,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-08-03 21:56:53,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 282 [2023-08-03 21:56:53,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 104 flow. Second operand has 10 states, 10 states have (on average 121.7) internal successors, (1217), 10 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states 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:56:53,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:56:53,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 282 [2023-08-03 21:56:53,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:56:54,263 INFO L124 PetriNetUnfolderBase]: 2843/4682 cut-off events. [2023-08-03 21:56:54,263 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2023-08-03 21:56:54,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9226 conditions, 4682 events. 2843/4682 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 25585 event pairs, 207 based on Foata normal form. 0/3843 useless extension candidates. Maximal degree in co-relation 9221. Up to 3239 conditions per place. [2023-08-03 21:56:54,287 INFO L140 encePairwiseOnDemand]: 266/282 looper letters, 115 selfloop transitions, 37 changer transitions 0/160 dead transitions. [2023-08-03 21:56:54,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 160 transitions, 689 flow [2023-08-03 21:56:54,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-03 21:56:54,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-03 21:56:54,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1715 transitions. [2023-08-03 21:56:54,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46781232951445717 [2023-08-03 21:56:54,291 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1715 transitions. [2023-08-03 21:56:54,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1715 transitions. [2023-08-03 21:56:54,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:56:54,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1715 transitions. [2023-08-03 21:56:54,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 131.92307692307693) internal successors, (1715), 13 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states 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:56:54,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 282.0) internal successors, (3948), 14 states have internal predecessors, (3948), 0 states have call successors, (0), 0 states 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:56:54,303 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 282.0) internal successors, (3948), 14 states have internal predecessors, (3948), 0 states have call successors, (0), 0 states 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:56:54,303 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 104 flow. Second operand 13 states and 1715 transitions. [2023-08-03 21:56:54,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 160 transitions, 689 flow [2023-08-03 21:56:54,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 160 transitions, 689 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 21:56:54,306 INFO L231 Difference]: Finished difference. Result has 69 places, 85 transitions, 357 flow [2023-08-03 21:56:54,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=357, PETRI_PLACES=69, PETRI_TRANSITIONS=85} [2023-08-03 21:56:54,307 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2023-08-03 21:56:54,307 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 85 transitions, 357 flow [2023-08-03 21:56:54,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 121.7) internal successors, (1217), 10 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states 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:56:54,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:56:54,308 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:56:54,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-03 21:56:54,309 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-03 21:56:54,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:56:54,309 INFO L85 PathProgramCache]: Analyzing trace with hash 45537525, now seen corresponding path program 1 times [2023-08-03 21:56:54,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:56:54,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941711644] [2023-08-03 21:56:54,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:56:54,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:56:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:56:54,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:56:54,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:56:54,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941711644] [2023-08-03 21:56:54,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941711644] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:56:54,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462223382] [2023-08-03 21:56:54,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:56:54,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:56:54,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:56:54,818 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:56:54,837 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:56:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:56:54,942 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 63 conjunts are in the unsatisfiable core [2023-08-03 21:56:54,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:56:54,989 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-03 21:56:55,053 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:56:55,053 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 21:56:55,172 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-03 21:56:55,249 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-03 21:56:55,498 INFO L322 Elim1Store]: treesize reduction 38, result has 44.9 percent of original size [2023-08-03 21:56:55,499 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 72 [2023-08-03 21:56:55,559 INFO L322 Elim1Store]: treesize reduction 73, result has 35.4 percent of original size [2023-08-03 21:56:55,560 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 63 treesize of output 111 [2023-08-03 21:56:55,582 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-08-03 21:56:55,878 INFO L322 Elim1Store]: treesize reduction 163, result has 35.1 percent of original size [2023-08-03 21:56:55,878 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 82 treesize of output 178 [2023-08-03 21:56:56,725 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 21:56:56,732 INFO L322 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-08-03 21:56:56,733 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 17 [2023-08-03 21:56:56,769 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 21:56:56,775 INFO L322 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-08-03 21:56:56,775 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 17 [2023-08-03 21:56:56,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:56:56,847 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 21:56:56,848 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 17 [2023-08-03 21:56:56,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:56:56,888 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 21:56:56,890 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 16 [2023-08-03 21:56:57,150 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-08-03 21:56:57,658 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 21:56:57,684 INFO L322 Elim1Store]: treesize reduction 38, result has 40.6 percent of original size [2023-08-03 21:56:57,684 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 46 [2023-08-03 21:56:57,717 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 21:56:57,750 INFO L322 Elim1Store]: treesize reduction 30, result has 53.1 percent of original size [2023-08-03 21:56:57,750 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 51 [2023-08-03 21:56:57,856 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-03 21:56:57,924 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2023-08-03 21:56:57,941 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-03 21:56:57,953 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2023-08-03 21:56:57,964 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-03 21:56:57,980 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 990 treesize of output 983 [2023-08-03 21:56:58,170 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-03 21:56:58,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:56:58,444 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:57:20,232 WARN L233 SmtUtils]: Spent 10.53s on a formula simplification. DAG size of input: 35 DAG size of output: 25 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 21:57:22,256 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#top~0.base|))) (and (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| Int) (v_ArrVal_111 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|))) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_111) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9|) |c_thr1Thread1of2ForFork0_push_~#ret~0#1.offset| 1)) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (= |c_thr1Thread1of2ForFork0_push_~oldTop~0#1| (select .cse0 |c_~#top~0.offset|)))) is different from false [2023-08-03 21:57:40,650 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| Int) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_111 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_109))) (store (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse0 |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|))) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| (store (select (store .cse0 |c_~#top~0.base| v_ArrVal_111) |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9|) |c_thr1Thread1of2ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2023-08-03 21:57:40,678 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:57:40,679 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2023-08-03 21:57:40,690 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:57:40,690 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-03 21:57:40,743 INFO L322 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2023-08-03 21:57:40,744 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1220 treesize of output 1182 [2023-08-03 21:57:40,783 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 322 treesize of output 314 [2023-08-03 21:57:40,791 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 298 [2023-08-03 21:57:40,836 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 102 [2023-08-03 21:57:40,912 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:57:40,912 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 586 treesize of output 568 [2023-08-03 21:57:40,947 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 273 treesize of output 257 [2023-08-03 21:57:40,956 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 257 treesize of output 249 [2023-08-03 21:57:41,026 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-08-03 21:57:41,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-03 21:57:41,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462223382] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:57:41,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:57:41,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27 [2023-08-03 21:57:41,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361643395] [2023-08-03 21:57:41,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:57:41,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-03 21:57:41,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:57:41,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-03 21:57:41,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=596, Unknown=18, NotChecked=102, Total=812 [2023-08-03 21:57:41,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 282 [2023-08-03 21:57:41,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 85 transitions, 357 flow. Second operand has 29 states, 29 states have (on average 88.93103448275862) internal successors, (2579), 29 states have internal predecessors, (2579), 0 states have call successors, (0), 0 states 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:57:41,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:57:41,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 282 [2023-08-03 21:57:41,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:58:04,450 INFO L124 PetriNetUnfolderBase]: 8360/13112 cut-off events. [2023-08-03 21:58:04,450 INFO L125 PetriNetUnfolderBase]: For 5681/5681 co-relation queries the response was YES. [2023-08-03 21:58:04,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33494 conditions, 13112 events. 8360/13112 cut-off events. For 5681/5681 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 82408 event pairs, 735 based on Foata normal form. 213/12647 useless extension candidates. Maximal degree in co-relation 33480. Up to 4772 conditions per place. [2023-08-03 21:58:04,515 INFO L140 encePairwiseOnDemand]: 263/282 looper letters, 561 selfloop transitions, 260 changer transitions 0/825 dead transitions. [2023-08-03 21:58:04,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 825 transitions, 4363 flow [2023-08-03 21:58:04,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-08-03 21:58:04,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2023-08-03 21:58:04,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 4913 transitions. [2023-08-03 21:58:04,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3629580378250591 [2023-08-03 21:58:04,528 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 4913 transitions. [2023-08-03 21:58:04,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 4913 transitions. [2023-08-03 21:58:04,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:58:04,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 4913 transitions. [2023-08-03 21:58:04,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 102.35416666666667) internal successors, (4913), 48 states have internal predecessors, (4913), 0 states have call successors, (0), 0 states 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:58:04,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 282.0) internal successors, (13818), 49 states have internal predecessors, (13818), 0 states have call successors, (0), 0 states 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:58:04,561 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 282.0) internal successors, (13818), 49 states have internal predecessors, (13818), 0 states have call successors, (0), 0 states 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:58:04,561 INFO L175 Difference]: Start difference. First operand has 69 places, 85 transitions, 357 flow. Second operand 48 states and 4913 transitions. [2023-08-03 21:58:04,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 825 transitions, 4363 flow [2023-08-03 21:58:04,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 825 transitions, 4363 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 21:58:04,621 INFO L231 Difference]: Finished difference. Result has 145 places, 365 transitions, 2761 flow [2023-08-03 21:58:04,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=2761, PETRI_PLACES=145, PETRI_TRANSITIONS=365} [2023-08-03 21:58:04,623 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 94 predicate places. [2023-08-03 21:58:04,624 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 365 transitions, 2761 flow [2023-08-03 21:58:04,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 88.93103448275862) internal successors, (2579), 29 states have internal predecessors, (2579), 0 states have call successors, (0), 0 states 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:58:04,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:58:04,625 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:58:04,636 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:58:04,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:58:04,831 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-03 21:58:04,831 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:58:04,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1841979395, now seen corresponding path program 2 times [2023-08-03 21:58:04,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:58:04,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300325436] [2023-08-03 21:58:04,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:58:04,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:58:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:58:05,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:58:05,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:58:05,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300325436] [2023-08-03 21:58:05,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300325436] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:58:05,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499353358] [2023-08-03 21:58:05,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 21:58:05,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:58:05,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:58:05,325 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:58:05,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-03 21:58:05,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 21:58:05,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:58:05,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 62 conjunts are in the unsatisfiable core [2023-08-03 21:58:05,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:58:05,420 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:58:05,421 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 21:58:05,517 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-03 21:58:05,728 INFO L322 Elim1Store]: treesize reduction 38, result has 44.9 percent of original size [2023-08-03 21:58:05,729 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 72 [2023-08-03 21:58:05,768 INFO L322 Elim1Store]: treesize reduction 77, result has 31.9 percent of original size [2023-08-03 21:58:05,768 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 63 treesize of output 107 [2023-08-03 21:58:05,784 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-08-03 21:58:05,836 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2023-08-03 21:58:05,891 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-08-03 21:58:05,969 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-03 21:58:05,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:58:05,995 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:58:06,002 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_177 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_177) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2023-08-03 21:58:13,870 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:58:13,871 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2023-08-03 21:58:13,882 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:58:13,883 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-03 21:58:13,980 INFO L322 Elim1Store]: treesize reduction 73, result has 45.5 percent of original size [2023-08-03 21:58:13,980 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 123 treesize of output 162 [2023-08-03 21:58:13,998 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:58:13,998 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 113 [2023-08-03 21:58:14,087 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-08-03 21:58:14,106 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-08-03 21:58:14,120 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-08-03 21:58:14,134 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-08-03 21:58:14,330 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-08-03 21:58:14,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-03 21:58:14,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-08-03 21:58:14,536 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:187) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:296) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:296) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:296) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:282) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-08-03 21:58:14,540 INFO L158 Benchmark]: Toolchain (without parser) took 89905.60ms. Allocated memory was 499.1MB in the beginning and 721.4MB in the end (delta: 222.3MB). Free memory was 450.1MB in the beginning and 473.0MB in the end (delta: -22.9MB). Peak memory consumption was 200.7MB. Max. memory is 16.0GB. [2023-08-03 21:58:14,540 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 333.4MB. Free memory is still 281.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 21:58:14,541 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.28ms. Allocated memory is still 499.1MB. Free memory was 450.1MB in the beginning and 430.2MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-03 21:58:14,541 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.42ms. Allocated memory is still 499.1MB. Free memory was 430.2MB in the beginning and 428.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 21:58:14,541 INFO L158 Benchmark]: Boogie Preprocessor took 46.52ms. Allocated memory is still 499.1MB. Free memory was 428.1MB in the beginning and 426.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 21:58:14,542 INFO L158 Benchmark]: RCFGBuilder took 424.06ms. Allocated memory is still 499.1MB. Free memory was 426.5MB in the beginning and 406.7MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-03 21:58:14,542 INFO L158 Benchmark]: TraceAbstraction took 89050.29ms. Allocated memory was 499.1MB in the beginning and 721.4MB in the end (delta: 222.3MB). Free memory was 406.1MB in the beginning and 473.0MB in the end (delta: -67.0MB). Peak memory consumption was 156.7MB. Max. memory is 16.0GB. [2023-08-03 21:58:14,544 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 333.4MB. Free memory is still 281.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 336.28ms. Allocated memory is still 499.1MB. Free memory was 450.1MB in the beginning and 430.2MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 43.42ms. Allocated memory is still 499.1MB. Free memory was 430.2MB in the beginning and 428.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 46.52ms. Allocated memory is still 499.1MB. Free memory was 428.1MB in the beginning and 426.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 424.06ms. Allocated memory is still 499.1MB. Free memory was 426.5MB in the beginning and 406.7MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 89050.29ms. Allocated memory was 499.1MB in the beginning and 721.4MB in the end (delta: 222.3MB). Free memory was 406.1MB in the beginning and 473.0MB in the end (delta: -67.0MB). Peak memory consumption was 156.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 253]: Unsoundness Warning unspecified type, defaulting to int C: short [253] - GenericResultAtLocation [Line: 253]: Unsoundness Warning unspecified type, defaulting to int C: short [253] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 89 PlacesBefore, 27 PlacesAfterwards, 95 TransitionsBefore, 29 TransitionsAfterwards, 1984 CoEnabledTransitionPairs, 5 FixpointIterations, 15 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 4 ChoiceCompositions, 83 TotalNumberOfCompositions, 2843 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1923, independent: 1755, independent conditional: 0, independent unconditional: 1755, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1108, independent: 1060, independent conditional: 0, independent unconditional: 1060, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1923, independent: 695, independent conditional: 0, independent unconditional: 695, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 1108, unknown conditional: 0, unknown unconditional: 1108] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 42, Positive conditional cache size: 0, Positive unconditional cache size: 42, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 146 PlacesBefore, 51 PlacesAfterwards, 158 TransitionsBefore, 54 TransitionsAfterwards, 11780 CoEnabledTransitionPairs, 5 FixpointIterations, 15 TrivialSequentialCompositions, 82 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 17 ConcurrentYvCompositions, 9 ChoiceCompositions, 123 TotalNumberOfCompositions, 21821 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9565, independent: 9195, independent conditional: 0, independent unconditional: 9195, dependent: 370, dependent conditional: 0, dependent unconditional: 370, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6016, independent: 5921, independent conditional: 0, independent unconditional: 5921, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9565, independent: 3274, independent conditional: 0, independent unconditional: 3274, dependent: 275, dependent conditional: 0, dependent unconditional: 275, unknown: 6016, unknown conditional: 0, unknown unconditional: 6016] , Statistics on independence cache: Total cache size (in pairs): 311, Positive cache size: 250, Positive conditional cache size: 0, Positive unconditional cache size: 250, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 146 PlacesBefore, 51 PlacesAfterwards, 158 TransitionsBefore, 54 TransitionsAfterwards, 11780 CoEnabledTransitionPairs, 5 FixpointIterations, 15 TrivialSequentialCompositions, 82 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 18 ConcurrentYvCompositions, 9 ChoiceCompositions, 124 TotalNumberOfCompositions, 21334 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9542, independent: 9187, independent conditional: 0, independent unconditional: 9187, dependent: 355, dependent conditional: 0, dependent unconditional: 355, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6006, independent: 5930, independent conditional: 0, independent unconditional: 5930, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9542, independent: 3257, independent conditional: 0, independent unconditional: 3257, dependent: 279, dependent conditional: 0, dependent unconditional: 279, unknown: 6006, unknown conditional: 0, unknown unconditional: 6006] , Statistics on independence cache: Total cache size (in pairs): 232, Positive cache size: 191, Positive conditional cache size: 0, Positive unconditional cache size: 191, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:333) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-08-03 21:58:14,573 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...