/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/04_incdec_cas.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 11:15:18,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 11:15:18,924 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 11:15:18,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 11:15:18,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 11:15:18,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 11:15:18,959 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 11:15:18,960 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 11:15:18,960 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 11:15:18,964 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 11:15:18,964 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 11:15:18,964 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 11:15:18,964 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 11:15:18,965 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 11:15:18,965 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 11:15:18,965 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 11:15:18,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 11:15:18,966 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 11:15:18,966 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 11:15:18,966 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 11:15:18,966 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 11:15:18,970 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 11:15:18,970 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 11:15:18,970 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 11:15:18,970 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 11:15:18,971 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 11:15:18,971 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 11:15:18,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:15:18,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 11:15:18,972 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 11:15:18,972 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 11:15:18,972 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 11:15:18,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 11:15:18,972 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 11:15:18,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 11:15:18,973 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-24 11:15:19,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 11:15:19,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 11:15:19,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 11:15:19,314 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 11:15:19,314 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 11:15:19,315 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/04_incdec_cas.i [2023-08-24 11:15:20,446 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 11:15:20,658 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 11:15:20,659 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i [2023-08-24 11:15:20,690 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/505e3795b/2aaf02a5c5b848ba96d71a38cf3c1358/FLAGfeadf3490 [2023-08-24 11:15:20,703 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/505e3795b/2aaf02a5c5b848ba96d71a38cf3c1358 [2023-08-24 11:15:20,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 11:15:20,706 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 11:15:20,709 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 11:15:20,709 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 11:15:20,711 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 11:15:20,712 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:15:20" (1/1) ... [2023-08-24 11:15:20,712 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ca87e6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:15:20, skipping insertion in model container [2023-08-24 11:15:20,713 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:15:20" (1/1) ... [2023-08-24 11:15:20,770 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 11:15:21,030 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30285,30298] [2023-08-24 11:15:21,035 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30729,30742] [2023-08-24 11:15:21,041 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:15:21,050 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 11:15:21,079 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [250] [2023-08-24 11:15:21,081 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [250] [2023-08-24 11:15:21,102 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: volatile unsigned [686] [2023-08-24 11:15:21,102 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [687] [2023-08-24 11:15:21,102 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [688] [2023-08-24 11:15:21,103 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [689] [2023-08-24 11:15:21,103 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: volatile unsigned [690] [2023-08-24 11:15:21,104 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: volatile unsigned [701] [2023-08-24 11:15:21,104 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: volatile unsigned [702] [2023-08-24 11:15:21,105 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: volatile unsigned [703] [2023-08-24 11:15:21,105 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [704] [2023-08-24 11:15:21,106 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30285,30298] [2023-08-24 11:15:21,106 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: inline unsigned [708] [2023-08-24 11:15:21,106 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [709] [2023-08-24 11:15:21,116 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [722] [2023-08-24 11:15:21,117 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30729,30742] [2023-08-24 11:15:21,118 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: inline unsigned [726] [2023-08-24 11:15:21,118 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [727] [2023-08-24 11:15:21,123 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:15:21,165 INFO L206 MainTranslator]: Completed translation [2023-08-24 11:15:21,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:15:21 WrapperNode [2023-08-24 11:15:21,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 11:15:21,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 11:15:21,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 11:15:21,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 11:15:21,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:15:21" (1/1) ... [2023-08-24 11:15:21,203 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:15:21" (1/1) ... [2023-08-24 11:15:21,233 INFO L138 Inliner]: procedures = 172, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2023-08-24 11:15:21,233 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 11:15:21,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 11:15:21,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 11:15:21,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 11:15:21,241 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:15:21" (1/1) ... [2023-08-24 11:15:21,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:15:21" (1/1) ... [2023-08-24 11:15:21,259 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:15:21" (1/1) ... [2023-08-24 11:15:21,260 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:15:21" (1/1) ... [2023-08-24 11:15:21,264 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:15:21" (1/1) ... [2023-08-24 11:15:21,267 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:15:21" (1/1) ... [2023-08-24 11:15:21,269 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:15:21" (1/1) ... [2023-08-24 11:15:21,270 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:15:21" (1/1) ... [2023-08-24 11:15:21,283 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 11:15:21,284 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 11:15:21,284 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 11:15:21,284 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 11:15:21,285 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:15:21" (1/1) ... [2023-08-24 11:15:21,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:15:21,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:15:21,311 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-24 11:15:21,312 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-24 11:15:21,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 11:15:21,335 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-24 11:15:21,335 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-24 11:15:21,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 11:15:21,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 11:15:21,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 11:15:21,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 11:15:21,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 11:15:21,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 11:15:21,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 11:15:21,337 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 11:15:21,490 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 11:15:21,491 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 11:15:21,746 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 11:15:21,962 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 11:15:21,963 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-24 11:15:21,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:15:21 BoogieIcfgContainer [2023-08-24 11:15:21,965 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 11:15:21,968 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 11:15:21,968 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 11:15:21,971 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 11:15:21,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 11:15:20" (1/3) ... [2023-08-24 11:15:21,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133e12dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:15:21, skipping insertion in model container [2023-08-24 11:15:21,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:15:21" (2/3) ... [2023-08-24 11:15:21,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133e12dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:15:21, skipping insertion in model container [2023-08-24 11:15:21,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:15:21" (3/3) ... [2023-08-24 11:15:21,973 INFO L112 eAbstractionObserver]: Analyzing ICFG 04_incdec_cas.i [2023-08-24 11:15:21,985 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 11:15:21,986 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 11:15:21,986 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 11:15:22,065 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 11:15:22,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 98 transitions, 201 flow [2023-08-24 11:15:22,148 INFO L124 PetriNetUnfolderBase]: 9/108 cut-off events. [2023-08-24 11:15:22,148 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:15:22,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 108 events. 9/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 219 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2023-08-24 11:15:22,158 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 98 transitions, 201 flow [2023-08-24 11:15:22,161 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 98 transitions, 201 flow [2023-08-24 11:15:22,164 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:15:22,177 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 98 transitions, 201 flow [2023-08-24 11:15:22,179 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 98 transitions, 201 flow [2023-08-24 11:15:22,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 98 transitions, 201 flow [2023-08-24 11:15:22,204 INFO L124 PetriNetUnfolderBase]: 9/108 cut-off events. [2023-08-24 11:15:22,204 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:15:22,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 108 events. 9/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 219 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2023-08-24 11:15:22,211 INFO L119 LiptonReduction]: Number of co-enabled transitions 1690 [2023-08-24 11:15:25,187 INFO L134 LiptonReduction]: Checked pairs total: 2354 [2023-08-24 11:15:25,188 INFO L136 LiptonReduction]: Total number of compositions: 84 [2023-08-24 11:15:25,207 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 11:15:25,213 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=false, 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;@655f8cb7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:15:25,214 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-24 11:15:25,218 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:15:25,218 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2023-08-24 11:15:25,218 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:15:25,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:15:25,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-24 11:15:25,219 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:15:25,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:15:25,226 INFO L85 PathProgramCache]: Analyzing trace with hash 147063794, now seen corresponding path program 1 times [2023-08-24 11:15:25,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:15:25,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465629119] [2023-08-24 11:15:25,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:15:25,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:15:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:15:25,386 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-24 11:15:25,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:15:25,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465629119] [2023-08-24 11:15:25,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465629119] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:15:25,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:15:25,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:15:25,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162410190] [2023-08-24 11:15:25,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:15:25,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-24 11:15:25,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:15:25,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-24 11:15:25,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-24 11:15:25,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 182 [2023-08-24 11:15:25,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 27 transitions, 59 flow. Second operand has 2 states, 2 states have (on average 90.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:15:25,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:15:25,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 182 [2023-08-24 11:15:25,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:15:25,468 INFO L124 PetriNetUnfolderBase]: 43/91 cut-off events. [2023-08-24 11:15:25,468 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:15:25,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 91 events. 43/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 250 event pairs, 28 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 174. Up to 91 conditions per place. [2023-08-24 11:15:25,470 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 16 selfloop transitions, 0 changer transitions 7/24 dead transitions. [2023-08-24 11:15:25,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 24 transitions, 99 flow [2023-08-24 11:15:25,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-24 11:15:25,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-24 11:15:25,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 200 transitions. [2023-08-24 11:15:25,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5494505494505495 [2023-08-24 11:15:25,481 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 200 transitions. [2023-08-24 11:15:25,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 200 transitions. [2023-08-24 11:15:25,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:15:25,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 200 transitions. [2023-08-24 11:15:25,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:15:25,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:15:25,489 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:15:25,491 INFO L175 Difference]: Start difference. First operand has 23 places, 27 transitions, 59 flow. Second operand 2 states and 200 transitions. [2023-08-24 11:15:25,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 24 transitions, 99 flow [2023-08-24 11:15:25,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 24 transitions, 99 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 11:15:25,494 INFO L231 Difference]: Finished difference. Result has 23 places, 17 transitions, 39 flow [2023-08-24 11:15:25,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=53, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=39, PETRI_PLACES=23, PETRI_TRANSITIONS=17} [2023-08-24 11:15:25,498 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 0 predicate places. [2023-08-24 11:15:25,498 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 39 flow [2023-08-24 11:15:25,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 90.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:15:25,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:15:25,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:15:25,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 11:15:25,499 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:15:25,499 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:15:25,499 INFO L85 PathProgramCache]: Analyzing trace with hash -405140658, now seen corresponding path program 1 times [2023-08-24 11:15:25,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:15:25,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062441429] [2023-08-24 11:15:25,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:15:25,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:15:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:15:26,349 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-24 11:15:26,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:15:26,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062441429] [2023-08-24 11:15:26,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062441429] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:15:26,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:15:26,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 11:15:26,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422738304] [2023-08-24 11:15:26,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:15:26,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 11:15:26,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:15:26,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 11:15:26,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-24 11:15:26,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 182 [2023-08-24 11:15:26,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 39 flow. Second operand has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:15:26,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:15:26,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 182 [2023-08-24 11:15:26,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:15:26,489 INFO L124 PetriNetUnfolderBase]: 25/71 cut-off events. [2023-08-24 11:15:26,490 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:15:26,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 71 events. 25/71 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 176 event pairs, 2 based on Foata normal form. 6/67 useless extension candidates. Maximal degree in co-relation 144. Up to 30 conditions per place. [2023-08-24 11:15:26,490 INFO L140 encePairwiseOnDemand]: 175/182 looper letters, 20 selfloop transitions, 7 changer transitions 1/29 dead transitions. [2023-08-24 11:15:26,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 29 transitions, 119 flow [2023-08-24 11:15:26,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:15:26,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:15:26,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 394 transitions. [2023-08-24 11:15:26,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3092621664050236 [2023-08-24 11:15:26,497 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 394 transitions. [2023-08-24 11:15:26,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 394 transitions. [2023-08-24 11:15:26,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:15:26,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 394 transitions. [2023-08-24 11:15:26,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 56.285714285714285) internal successors, (394), 7 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:15:26,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:15:26,508 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:15:26,512 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 39 flow. Second operand 7 states and 394 transitions. [2023-08-24 11:15:26,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 29 transitions, 119 flow [2023-08-24 11:15:26,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 29 transitions, 119 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 11:15:26,513 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 64 flow [2023-08-24 11:15:26,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=29, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=64, PETRI_PLACES=23, PETRI_TRANSITIONS=16} [2023-08-24 11:15:26,514 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 0 predicate places. [2023-08-24 11:15:26,514 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 16 transitions, 64 flow [2023-08-24 11:15:26,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:15:26,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:15:26,515 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:15:26,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 11:15:26,517 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:15:26,517 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:15:26,518 INFO L85 PathProgramCache]: Analyzing trace with hash -42027423, now seen corresponding path program 1 times [2023-08-24 11:15:26,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:15:26,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321685949] [2023-08-24 11:15:26,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:15:26,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:15:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:15:27,139 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-24 11:15:27,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:15:27,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321685949] [2023-08-24 11:15:27,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321685949] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:15:27,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6760414] [2023-08-24 11:15:27,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:15:27,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:15:27,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:15:27,147 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-24 11:15:27,150 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-24 11:15:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:15:27,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-24 11:15:27,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:15:27,359 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-24 11:15:27,360 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 33 [2023-08-24 11:15:27,423 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-24 11:15:27,557 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-24 11:15:27,557 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 11:15:27,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 11:15:27,758 INFO L322 Elim1Store]: treesize reduction 52, result has 32.5 percent of original size [2023-08-24 11:15:27,759 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 120 [2023-08-24 11:15:27,783 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 14 treesize of output 11 [2023-08-24 11:15:27,808 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-24 11:15:27,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 11:15:27,893 INFO L322 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-08-24 11:15:27,894 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 33 [2023-08-24 11:15:27,934 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 11:15:27,936 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 61 [2023-08-24 11:15:27,999 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-24 11:15:28,024 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-24 11:15:28,025 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 11:15:28,066 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_85 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_85))) (or (not (= (mod (select (select .cse0 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< (mod |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1| 4294967296) (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) is different from false [2023-08-24 11:15:30,546 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-24 11:15:30,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6760414] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 11:15:30,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 11:15:30,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 17 [2023-08-24 11:15:30,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609124320] [2023-08-24 11:15:30,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 11:15:30,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-24 11:15:30,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:15:30,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-24 11:15:30,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=242, Unknown=8, NotChecked=32, Total=342 [2023-08-24 11:15:30,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 182 [2023-08-24 11:15:30,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 16 transitions, 64 flow. Second operand has 19 states, 19 states have (on average 51.578947368421055) internal successors, (980), 19 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:15:30,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:15:30,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 182 [2023-08-24 11:15:30,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:15:38,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:15:42,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:15:43,487 INFO L124 PetriNetUnfolderBase]: 34/95 cut-off events. [2023-08-24 11:15:43,487 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-08-24 11:15:43,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 95 events. 34/95 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 283 event pairs, 0 based on Foata normal form. 2/85 useless extension candidates. Maximal degree in co-relation 252. Up to 36 conditions per place. [2023-08-24 11:15:43,488 INFO L140 encePairwiseOnDemand]: 174/182 looper letters, 20 selfloop transitions, 19 changer transitions 4/44 dead transitions. [2023-08-24 11:15:43,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 44 transitions, 229 flow [2023-08-24 11:15:43,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-24 11:15:43,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-24 11:15:43,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 695 transitions. [2023-08-24 11:15:43,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2937447168216399 [2023-08-24 11:15:43,491 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 695 transitions. [2023-08-24 11:15:43,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 695 transitions. [2023-08-24 11:15:43,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:15:43,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 695 transitions. [2023-08-24 11:15:43,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 53.46153846153846) internal successors, (695), 13 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:15:43,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 182.0) internal successors, (2548), 14 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:15:43,498 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 182.0) internal successors, (2548), 14 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:15:43,498 INFO L175 Difference]: Start difference. First operand has 23 places, 16 transitions, 64 flow. Second operand 13 states and 695 transitions. [2023-08-24 11:15:43,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 44 transitions, 229 flow [2023-08-24 11:15:43,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 44 transitions, 227 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 11:15:43,500 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 181 flow [2023-08-24 11:15:43,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=181, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2023-08-24 11:15:43,500 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 15 predicate places. [2023-08-24 11:15:43,501 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 181 flow [2023-08-24 11:15:43,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 51.578947368421055) internal successors, (980), 19 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:15:43,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:15:43,501 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:15:43,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-24 11:15:43,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:15:43,707 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:15:43,708 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:15:43,708 INFO L85 PathProgramCache]: Analyzing trace with hash 253294844, now seen corresponding path program 1 times [2023-08-24 11:15:43,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:15:43,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134443535] [2023-08-24 11:15:43,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:15:43,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:15:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:15:44,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:15:44,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:15:44,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134443535] [2023-08-24 11:15:44,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134443535] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:15:44,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274326357] [2023-08-24 11:15:44,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:15:44,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:15:44,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:15:44,765 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-24 11:15:44,767 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-24 11:15:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:15:44,904 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 60 conjunts are in the unsatisfiable core [2023-08-24 11:15:44,909 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:15:45,444 INFO L322 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2023-08-24 11:15:45,445 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2023-08-24 11:15:45,466 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-24 11:15:45,487 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-24 11:15:45,510 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-24 11:15:45,634 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 11:15:45,710 INFO L322 Elim1Store]: treesize reduction 57, result has 12.3 percent of original size [2023-08-24 11:15:45,711 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 100 treesize of output 99 [2023-08-24 11:15:45,790 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 11:15:45,791 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 11:15:45,801 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 11:15:45,802 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 49 [2023-08-24 11:15:45,982 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 11:15:45,983 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 102 [2023-08-24 11:15:46,114 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 11:15:46,116 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2023-08-24 11:15:46,185 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 5 [2023-08-24 11:15:46,197 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-08-24 11:15:46,252 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 11:15:46,253 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 129 [2023-08-24 11:15:46,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:15:46,600 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 11:15:46,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274326357] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:15:46,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 11:15:46,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 13 [2023-08-24 11:15:46,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630107641] [2023-08-24 11:15:46,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:15:46,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:15:46,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:15:46,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:15:46,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-08-24 11:15:46,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 182 [2023-08-24 11:15:46,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 181 flow. Second operand has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:15:46,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:15:46,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 182 [2023-08-24 11:15:46,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:15:46,776 INFO L124 PetriNetUnfolderBase]: 8/43 cut-off events. [2023-08-24 11:15:46,776 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-08-24 11:15:46,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 43 events. 8/43 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 99 event pairs, 1 based on Foata normal form. 5/48 useless extension candidates. Maximal degree in co-relation 167. Up to 15 conditions per place. [2023-08-24 11:15:46,777 INFO L140 encePairwiseOnDemand]: 176/182 looper letters, 11 selfloop transitions, 11 changer transitions 2/25 dead transitions. [2023-08-24 11:15:46,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 25 transitions, 208 flow [2023-08-24 11:15:46,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:15:46,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:15:46,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 409 transitions. [2023-08-24 11:15:46,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37454212454212454 [2023-08-24 11:15:46,779 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 409 transitions. [2023-08-24 11:15:46,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 409 transitions. [2023-08-24 11:15:46,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:15:46,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 409 transitions. [2023-08-24 11:15:46,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 68.16666666666667) internal successors, (409), 6 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:15:46,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:15:46,782 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:15:46,782 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 181 flow. Second operand 6 states and 409 transitions. [2023-08-24 11:15:46,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 25 transitions, 208 flow [2023-08-24 11:15:46,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 25 transitions, 149 flow, removed 12 selfloop flow, removed 11 redundant places. [2023-08-24 11:15:46,785 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 129 flow [2023-08-24 11:15:46,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=129, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-08-24 11:15:46,785 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 9 predicate places. [2023-08-24 11:15:46,785 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 129 flow [2023-08-24 11:15:46,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:15:46,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:15:46,786 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:15:46,795 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-24 11:15:46,991 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,SelfDestructingSolverStorable3 [2023-08-24 11:15:46,991 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:15:46,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:15:46,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1480454311, now seen corresponding path program 2 times [2023-08-24 11:15:46,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:15:46,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698329191] [2023-08-24 11:15:46,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:15:46,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:15:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:15:48,072 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:15:48,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:15:48,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698329191] [2023-08-24 11:15:48,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698329191] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:15:48,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550091647] [2023-08-24 11:15:48,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 11:15:48,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:15:48,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:15:48,074 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 11:15:48,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-24 11:15:48,189 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 11:15:48,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 11:15:48,191 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 88 conjunts are in the unsatisfiable core [2023-08-24 11:15:48,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:15:48,239 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-24 11:15:48,239 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2023-08-24 11:15:48,348 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-24 11:15:48,458 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-24 11:15:48,459 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 11:15:48,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 11:15:48,939 INFO L322 Elim1Store]: treesize reduction 116, result has 29.7 percent of original size [2023-08-24 11:15:48,939 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 118 treesize of output 358 [2023-08-24 11:15:48,967 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-24 11:15:48,994 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-24 11:15:49,020 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-24 11:15:49,048 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-24 11:15:49,120 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 11:15:49,121 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 340 [2023-08-24 11:15:49,232 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 11:15:49,234 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 384 [2023-08-24 11:15:49,372 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 11:15:49,375 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 502 [2023-08-24 11:15:50,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 11:15:50,049 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 24 [2023-08-24 11:15:50,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 11:15:50,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 11:15:50,080 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 22 [2023-08-24 11:15:50,131 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 64 [2023-08-24 11:15:50,260 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 11:15:50,261 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 161 [2023-08-24 11:15:50,347 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-24 11:15:50,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:15:50,437 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 11:15:50,684 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1| 4294967296))) (let ((.cse0 (= .cse1 (mod (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (and (or .cse0 (forall ((v_ArrVal_273 (Array Int Int))) (or (= 0 (mod (select v_ArrVal_273 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296)) (< .cse1 (mod (select (select (store |c_#memory_int| |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_273) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (or (not .cse0) (forall ((v_ArrVal_270 (Array Int Int)) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| Int) (v_ArrVal_269 (Array Int Int))) (< .cse1 (mod (select (select (store (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_269) |c_~#value~0.base| v_ArrVal_272) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_274) |c_~#value~0.base| v_ArrVal_270) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) is different from false [2023-08-24 11:15:51,283 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (= (mod |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1| 4294967296) (mod (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (and (or (not .cse0) (forall ((v_ArrVal_270 (Array Int Int)) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_274 (Array Int Int)) (v_ArrVal_262 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_12| Int) (v_ArrVal_267 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| Int) (v_ArrVal_269 (Array Int Int))) (let ((.cse1 (store (store (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_12| v_ArrVal_262) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_12| v_ArrVal_264) |c_~#value~0.base|) |c_~#value~0.offset| (+ |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1| 1))) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_12| v_ArrVal_260) |c_~#value~0.base| v_ArrVal_263) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_267))) (or (< (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store (store .cse1 |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_269) |c_~#value~0.base| v_ArrVal_272) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store .cse1 |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_274) |c_~#value~0.base| v_ArrVal_270) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< 0 (mod (select (select .cse1 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296)))))) (or .cse0 (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_270 (Array Int Int)) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| Int) (v_ArrVal_269 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_267))) (or (< 0 (mod (select (select .cse2 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296)) (< (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store (store .cse2 |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_269) |c_~#value~0.base| v_ArrVal_272) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store .cse2 |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_274) |c_~#value~0.base| v_ArrVal_270) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))) is different from false [2023-08-24 11:15:51,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-24 11:15:51,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550091647] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 11:15:51,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 11:15:51,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 10] total 24 [2023-08-24 11:15:51,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403723001] [2023-08-24 11:15:51,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 11:15:51,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-24 11:15:51,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:15:51,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-24 11:15:51,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=411, Unknown=21, NotChecked=86, Total=600 [2023-08-24 11:15:51,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 182 [2023-08-24 11:15:51,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 129 flow. Second operand has 25 states, 25 states have (on average 52.56) internal successors, (1314), 25 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:15:51,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:15:51,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 182 [2023-08-24 11:15:51,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:15:52,714 INFO L124 PetriNetUnfolderBase]: 7/35 cut-off events. [2023-08-24 11:15:52,714 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-08-24 11:15:52,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 35 events. 7/35 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 80 event pairs, 2 based on Foata normal form. 2/37 useless extension candidates. Maximal degree in co-relation 127. Up to 16 conditions per place. [2023-08-24 11:15:52,714 INFO L140 encePairwiseOnDemand]: 177/182 looper letters, 0 selfloop transitions, 0 changer transitions 17/17 dead transitions. [2023-08-24 11:15:52,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 17 transitions, 127 flow [2023-08-24 11:15:52,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:15:52,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:15:52,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 321 transitions. [2023-08-24 11:15:52,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29395604395604397 [2023-08-24 11:15:52,716 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 321 transitions. [2023-08-24 11:15:52,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 321 transitions. [2023-08-24 11:15:52,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:15:52,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 321 transitions. [2023-08-24 11:15:52,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 53.5) internal successors, (321), 6 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:15:52,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:15:52,742 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:15:52,742 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 129 flow. Second operand 6 states and 321 transitions. [2023-08-24 11:15:52,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 17 transitions, 127 flow [2023-08-24 11:15:52,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 17 transitions, 112 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-08-24 11:15:52,743 INFO L231 Difference]: Finished difference. Result has 28 places, 0 transitions, 0 flow [2023-08-24 11:15:52,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=28, PETRI_TRANSITIONS=0} [2023-08-24 11:15:52,744 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 5 predicate places. [2023-08-24 11:15:52,744 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 0 transitions, 0 flow [2023-08-24 11:15:52,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 52.56) internal successors, (1314), 25 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:15:52,747 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-24 11:15:52,747 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-24 11:15:52,749 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-24 11:15:52,750 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-24 11:15:52,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-24 11:15:52,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:15:52,955 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2023-08-24 11:15:52,957 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-24 11:15:52,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 98 transitions, 201 flow [2023-08-24 11:15:52,969 INFO L124 PetriNetUnfolderBase]: 9/108 cut-off events. [2023-08-24 11:15:52,970 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:15:52,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 108 events. 9/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 219 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2023-08-24 11:15:52,970 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 98 transitions, 201 flow [2023-08-24 11:15:52,971 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 98 transitions, 201 flow [2023-08-24 11:15:52,971 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:15:52,971 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 98 transitions, 201 flow [2023-08-24 11:15:52,971 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 98 transitions, 201 flow [2023-08-24 11:15:52,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 98 transitions, 201 flow [2023-08-24 11:15:52,980 INFO L124 PetriNetUnfolderBase]: 9/108 cut-off events. [2023-08-24 11:15:52,980 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:15:52,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 108 events. 9/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 219 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2023-08-24 11:15:52,982 INFO L119 LiptonReduction]: Number of co-enabled transitions 1690 [2023-08-24 11:15:58,753 INFO L134 LiptonReduction]: Checked pairs total: 2357 [2023-08-24 11:15:58,754 INFO L136 LiptonReduction]: Total number of compositions: 84 [2023-08-24 11:15:58,755 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-24 11:15:58,756 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=false, 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;@655f8cb7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:15:58,756 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-24 11:15:58,758 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:15:58,758 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2023-08-24 11:15:58,758 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:15:58,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:15:58,758 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-24 11:15:58,758 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 11:15:58,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:15:58,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1668209586, now seen corresponding path program 1 times [2023-08-24 11:15:58,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:15:58,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824997084] [2023-08-24 11:15:58,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:15:58,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:15:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:15:58,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 11:15:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:15:58,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 11:15:58,785 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 11:15:58,785 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-24 11:15:58,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 11:15:58,785 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-24 11:15:58,786 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-24 11:15:58,786 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-24 11:15:58,786 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-24 11:15:58,826 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 11:15:58,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 164 transitions, 340 flow [2023-08-24 11:15:58,846 INFO L124 PetriNetUnfolderBase]: 17/186 cut-off events. [2023-08-24 11:15:58,846 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 11:15:58,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 186 events. 17/186 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 590 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 142. Up to 6 conditions per place. [2023-08-24 11:15:58,847 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 164 transitions, 340 flow [2023-08-24 11:15:58,849 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 164 transitions, 340 flow [2023-08-24 11:15:58,849 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:15:58,849 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 164 transitions, 340 flow [2023-08-24 11:15:58,849 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 164 transitions, 340 flow [2023-08-24 11:15:58,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 164 transitions, 340 flow [2023-08-24 11:15:58,866 INFO L124 PetriNetUnfolderBase]: 17/186 cut-off events. [2023-08-24 11:15:58,866 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 11:15:58,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 186 events. 17/186 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 590 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 142. Up to 6 conditions per place. [2023-08-24 11:15:58,872 INFO L119 LiptonReduction]: Number of co-enabled transitions 11960 [2023-08-24 11:16:08,397 INFO L134 LiptonReduction]: Checked pairs total: 17927 [2023-08-24 11:16:08,398 INFO L136 LiptonReduction]: Total number of compositions: 142 [2023-08-24 11:16:08,399 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 11:16:08,399 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=false, 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;@655f8cb7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:16:08,399 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-24 11:16:08,401 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:16:08,401 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2023-08-24 11:16:08,401 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:16:08,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:08,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-24 11:16:08,402 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-24 11:16:08,402 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:08,402 INFO L85 PathProgramCache]: Analyzing trace with hash 742146531, now seen corresponding path program 1 times [2023-08-24 11:16:08,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:08,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229996581] [2023-08-24 11:16:08,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:08,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:08,415 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-24 11:16:08,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:08,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229996581] [2023-08-24 11:16:08,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229996581] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:08,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:08,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:16:08,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043839132] [2023-08-24 11:16:08,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:08,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-24 11:16:08,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:08,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-24 11:16:08,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-24 11:16:08,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 306 [2023-08-24 11:16:08,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 52 transitions, 116 flow. Second operand has 2 states, 2 states have (on average 147.0) internal successors, (294), 2 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:08,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:08,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 306 [2023-08-24 11:16:08,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:08,746 INFO L124 PetriNetUnfolderBase]: 1065/1643 cut-off events. [2023-08-24 11:16:08,746 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-08-24 11:16:08,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3328 conditions, 1643 events. 1065/1643 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 8582 event pairs, 735 based on Foata normal form. 0/1157 useless extension candidates. Maximal degree in co-relation 770. Up to 1612 conditions per place. [2023-08-24 11:16:08,754 INFO L140 encePairwiseOnDemand]: 301/306 looper letters, 44 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2023-08-24 11:16:08,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 194 flow [2023-08-24 11:16:08,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-24 11:16:08,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-24 11:16:08,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 337 transitions. [2023-08-24 11:16:08,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5506535947712419 [2023-08-24 11:16:08,755 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 337 transitions. [2023-08-24 11:16:08,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 337 transitions. [2023-08-24 11:16:08,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:08,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 337 transitions. [2023-08-24 11:16:08,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:08,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:08,758 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:08,758 INFO L175 Difference]: Start difference. First operand has 43 places, 52 transitions, 116 flow. Second operand 2 states and 337 transitions. [2023-08-24 11:16:08,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 194 flow [2023-08-24 11:16:08,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 47 transitions, 192 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-24 11:16:08,761 INFO L231 Difference]: Finished difference. Result has 43 places, 47 transitions, 104 flow [2023-08-24 11:16:08,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, 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=43, PETRI_TRANSITIONS=47} [2023-08-24 11:16:08,762 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2023-08-24 11:16:08,762 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 47 transitions, 104 flow [2023-08-24 11:16:08,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 147.0) internal successors, (294), 2 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:08,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:08,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:08,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 11:16:08,763 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-24 11:16:08,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:08,763 INFO L85 PathProgramCache]: Analyzing trace with hash 240118255, now seen corresponding path program 1 times [2023-08-24 11:16:08,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:08,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22942561] [2023-08-24 11:16:08,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:08,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:09,309 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-24 11:16:09,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:09,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22942561] [2023-08-24 11:16:09,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22942561] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:09,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:09,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 11:16:09,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150982839] [2023-08-24 11:16:09,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:09,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 11:16:09,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:09,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 11:16:09,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-24 11:16:09,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 306 [2023-08-24 11:16:09,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 47 transitions, 104 flow. Second operand has 8 states, 8 states have (on average 100.0) internal successors, (800), 8 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:09,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:09,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 306 [2023-08-24 11:16:09,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:10,837 INFO L124 PetriNetUnfolderBase]: 1481/2320 cut-off events. [2023-08-24 11:16:10,838 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2023-08-24 11:16:10,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4698 conditions, 2320 events. 1481/2320 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 13068 event pairs, 223 based on Foata normal form. 0/1698 useless extension candidates. Maximal degree in co-relation 4693. Up to 1346 conditions per place. [2023-08-24 11:16:10,849 INFO L140 encePairwiseOnDemand]: 289/306 looper letters, 121 selfloop transitions, 32 changer transitions 4/160 dead transitions. [2023-08-24 11:16:10,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 160 transitions, 674 flow [2023-08-24 11:16:10,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-24 11:16:10,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-24 11:16:10,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1261 transitions. [2023-08-24 11:16:10,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3746286393345217 [2023-08-24 11:16:10,853 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1261 transitions. [2023-08-24 11:16:10,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1261 transitions. [2023-08-24 11:16:10,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:10,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1261 transitions. [2023-08-24 11:16:10,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 114.63636363636364) internal successors, (1261), 11 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:10,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 306.0) internal successors, (3672), 12 states have internal predecessors, (3672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:10,861 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 306.0) internal successors, (3672), 12 states have internal predecessors, (3672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:10,861 INFO L175 Difference]: Start difference. First operand has 43 places, 47 transitions, 104 flow. Second operand 11 states and 1261 transitions. [2023-08-24 11:16:10,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 160 transitions, 674 flow [2023-08-24 11:16:10,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 160 transitions, 674 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 11:16:10,864 INFO L231 Difference]: Finished difference. Result has 61 places, 79 transitions, 332 flow [2023-08-24 11:16:10,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=332, PETRI_PLACES=61, PETRI_TRANSITIONS=79} [2023-08-24 11:16:10,864 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2023-08-24 11:16:10,864 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 79 transitions, 332 flow [2023-08-24 11:16:10,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 100.0) internal successors, (800), 8 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:10,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:10,865 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:10,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 11:16:10,865 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-24 11:16:10,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:10,866 INFO L85 PathProgramCache]: Analyzing trace with hash -2055155924, now seen corresponding path program 1 times [2023-08-24 11:16:10,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:10,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044508829] [2023-08-24 11:16:10,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:10,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:11,426 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-24 11:16:11,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:11,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044508829] [2023-08-24 11:16:11,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044508829] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:16:11,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341546023] [2023-08-24 11:16:11,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:11,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:16:11,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:16:11,429 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 11:16:11,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-24 11:16:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:11,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 61 conjunts are in the unsatisfiable core [2023-08-24 11:16:11,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:16:11,656 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-24 11:16:11,657 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 33 [2023-08-24 11:16:11,794 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-24 11:16:11,948 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-24 11:16:11,948 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 11:16:12,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 11:16:12,339 INFO L322 Elim1Store]: treesize reduction 52, result has 32.5 percent of original size [2023-08-24 11:16:12,340 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 120 [2023-08-24 11:16:12,357 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 14 treesize of output 11 [2023-08-24 11:16:12,375 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-24 11:16:12,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 11:16:12,476 INFO L322 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-08-24 11:16:12,476 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 33 [2023-08-24 11:16:12,554 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 11:16:12,554 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 61 [2023-08-24 11:16:12,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 11:16:12,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 11:16:12,841 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2023-08-24 11:16:12,895 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-24 11:16:12,896 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 11:16:16,089 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-24 11:16:16,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341546023] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 11:16:16,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 11:16:16,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 17 [2023-08-24 11:16:16,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794697375] [2023-08-24 11:16:16,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 11:16:16,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-24 11:16:16,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:16,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-24 11:16:16,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=267, Unknown=13, NotChecked=0, Total=342 [2023-08-24 11:16:16,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 306 [2023-08-24 11:16:16,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 79 transitions, 332 flow. Second operand has 19 states, 19 states have (on average 98.42105263157895) internal successors, (1870), 19 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:16,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:16,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 306 [2023-08-24 11:16:16,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:19,281 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse4 (mod |c_thr1Thread1of2ForFork0_inc_~inc__v~0#1| 4294967296)) (.cse1 (mod .cse11 4294967296))) (let ((.cse5 (= .cse4 .cse1)) (.cse2 (+ 1 .cse11))) (and (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| Int) (v_ArrVal_360 (Array Int Int)) (v_ArrVal_362 (Array Int Int)) (v_ArrVal_361 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (let ((.cse0 (store (store (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_360) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_361) |c_~#value~0.base|) |c_~#value~0.offset| .cse2)) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_362) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_365))) (or (not (= (mod (select (select .cse0 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse1 (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< |c_~#inc_flag~0.base| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11|)))) (or (forall ((v_ArrVal_364 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_364) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_365))) (or (not (= (mod (select (select .cse3 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse4 (mod (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) .cse5) (forall ((|v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_65| Int) (v_ArrVal_358 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| Int) (v_ArrVal_360 (Array Int Int)) (v_ArrVal_362 (Array Int Int)) (v_ArrVal_361 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_358))) (let ((.cse7 (select (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse6 (store (store (store (store .cse8 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_360) |c_~#value~0.base| (store (select (store .cse8 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_361) |c_~#value~0.base|) |c_~#value~0.offset| (+ .cse7 1))) |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_65| v_ArrVal_362) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_365))) (or (not (= (mod (select (select .cse6 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_65|) 0)) (< (mod .cse7 4294967296) (mod (select (select .cse6 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< |c_~#inc_flag~0.base| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11|)))))) (or (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| Int) (v_ArrVal_360 (Array Int Int)) (v_ArrVal_362 (Array Int Int)) (v_ArrVal_361 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (let ((.cse9 (store (store (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_360) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_361) |c_~#value~0.base|) |c_~#value~0.offset| (+ |c_thr1Thread1of2ForFork0_inc_~inc__v~0#1| 1))) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_362) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_365))) (or (< .cse4 (mod (select (select .cse9 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< |c_~#inc_flag~0.base| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11|) (not (= (mod (select (select .cse9 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0))))) (not .cse5)) (forall ((|v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_65| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_65|) 0)) (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| Int) (v_ArrVal_360 (Array Int Int)) (v_ArrVal_362 (Array Int Int)) (v_ArrVal_361 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (let ((.cse10 (store (store (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_360) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_361) |c_~#value~0.base|) |c_~#value~0.offset| .cse2)) |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_65| v_ArrVal_362) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_365))) (or (not (= (mod (select (select .cse10 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse1 (mod (select (select .cse10 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< |c_~#inc_flag~0.base| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11|)))))))))) is different from false [2023-08-24 11:16:22,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-24 11:16:31,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:16:34,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-24 11:16:40,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:16:43,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:16:46,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:16:48,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:16:50,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:16:56,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:16:58,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:17:09,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:17:11,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-24 11:17:14,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-24 11:17:15,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:17:19,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-24 11:17:21,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-24 11:17:23,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:17:25,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-24 11:17:27,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-24 11:17:41,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:17:50,894 WARN L234 SmtUtils]: Spent 6.28s on a formula simplification that was a NOOP. DAG size: 83 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 11:18:01,004 WARN L234 SmtUtils]: Spent 6.46s on a formula simplification that was a NOOP. DAG size: 96 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 11:18:03,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-24 11:18:05,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:18:08,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:18:10,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:18:13,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:18:15,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:18:19,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-24 11:18:21,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-24 11:18:23,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-24 11:18:25,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-24 11:18:27,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-24 11:18:29,847 INFO L124 PetriNetUnfolderBase]: 2713/4493 cut-off events. [2023-08-24 11:18:29,847 INFO L125 PetriNetUnfolderBase]: For 11805/11810 co-relation queries the response was YES. [2023-08-24 11:18:29,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15319 conditions, 4493 events. 2713/4493 cut-off events. For 11805/11810 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 29531 event pairs, 197 based on Foata normal form. 169/4095 useless extension candidates. Maximal degree in co-relation 15305. Up to 1656 conditions per place. [2023-08-24 11:18:29,876 INFO L140 encePairwiseOnDemand]: 278/306 looper letters, 234 selfloop transitions, 203 changer transitions 28/468 dead transitions. [2023-08-24 11:18:29,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 468 transitions, 2987 flow [2023-08-24 11:18:29,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-08-24 11:18:29,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-08-24 11:18:29,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 3864 transitions. [2023-08-24 11:18:29,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3607843137254902 [2023-08-24 11:18:29,887 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 3864 transitions. [2023-08-24 11:18:29,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 3864 transitions. [2023-08-24 11:18:29,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:18:29,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 3864 transitions. [2023-08-24 11:18:29,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 110.4) internal successors, (3864), 35 states have internal predecessors, (3864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:18:29,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 306.0) internal successors, (11016), 36 states have internal predecessors, (11016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:18:29,909 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 306.0) internal successors, (11016), 36 states have internal predecessors, (11016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:18:29,909 INFO L175 Difference]: Start difference. First operand has 61 places, 79 transitions, 332 flow. Second operand 35 states and 3864 transitions. [2023-08-24 11:18:29,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 468 transitions, 2987 flow [2023-08-24 11:18:29,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 468 transitions, 2987 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 11:18:29,931 INFO L231 Difference]: Finished difference. Result has 119 places, 262 transitions, 2322 flow [2023-08-24 11:18:29,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=2322, PETRI_PLACES=119, PETRI_TRANSITIONS=262} [2023-08-24 11:18:29,935 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 76 predicate places. [2023-08-24 11:18:29,935 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 262 transitions, 2322 flow [2023-08-24 11:18:29,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 98.42105263157895) internal successors, (1870), 19 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:18:29,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:18:29,936 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:18:29,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-24 11:18:30,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:18:30,141 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-24 11:18:30,142 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:18:30,142 INFO L85 PathProgramCache]: Analyzing trace with hash 272482645, now seen corresponding path program 1 times [2023-08-24 11:18:30,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:18:30,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123965894] [2023-08-24 11:18:30,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:18:30,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:18:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:18:31,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 11:18:31,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:18:31,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123965894] [2023-08-24 11:18:31,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123965894] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:18:31,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262898862] [2023-08-24 11:18:31,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:18:31,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:18:31,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:18:31,162 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 11:18:31,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-24 11:18:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:18:31,290 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 69 conjunts are in the unsatisfiable core [2023-08-24 11:18:31,293 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:18:31,461 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-24 11:18:31,461 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 33 [2023-08-24 11:18:31,729 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-24 11:18:32,091 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-24 11:18:32,414 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-24 11:18:32,415 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 11:18:32,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 11:18:32,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 11:18:33,482 INFO L322 Elim1Store]: treesize reduction 116, result has 29.7 percent of original size [2023-08-24 11:18:33,483 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 125 treesize of output 383 [2023-08-24 11:18:33,533 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-24 11:18:33,580 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-24 11:18:33,624 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-24 11:18:33,668 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-24 11:18:33,830 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 11:18:33,832 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 272 [2023-08-24 11:18:33,937 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 11:18:33,938 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 297 [2023-08-24 11:18:34,143 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 11:18:34,144 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 237 [2023-08-24 11:18:34,344 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 11:18:34,345 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 136 [2023-08-24 11:18:34,412 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 11:18:34,414 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 385 [2023-08-24 11:18:34,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 11:18:34,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 11:18:34,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 11:18:34,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 11:18:35,068 INFO L322 Elim1Store]: treesize reduction 92, result has 5.2 percent of original size [2023-08-24 11:18:35,068 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 591 treesize of output 585 [2023-08-24 11:18:35,440 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 11:18:35,440 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 133 [2023-08-24 11:18:35,838 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 11:18:35,839 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 11 [2023-08-24 11:18:35,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 11:18:36,014 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 26 [2023-08-24 11:18:37,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 11:18:37,326 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 11:18:41,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 11:18:41,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262898862] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 11:18:41,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 11:18:41,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2023-08-24 11:18:41,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307572526] [2023-08-24 11:18:41,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 11:18:41,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-24 11:18:41,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:18:41,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-24 11:18:41,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=303, Unknown=3, NotChecked=0, Total=380 [2023-08-24 11:18:41,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 306 [2023-08-24 11:18:41,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 262 transitions, 2322 flow. Second operand has 20 states, 20 states have (on average 96.5) internal successors, (1930), 20 states have internal predecessors, (1930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:18:41,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:18:41,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 306 [2023-08-24 11:18:41,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:18:49,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:18:51,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:18:55,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:18:57,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:18:59,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:19:01,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:19:10,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:19:14,919 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| 3))) (let ((.cse7 (= (select (select |c_#memory_int| 5) |c_~#dec_flag~0.offset|) 0)) (.cse8 (= (select .cse9 0) 1))) (and (= |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.offset| 0) (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_424 (Array Int Int)) (v_ArrVal_416 (Array Int Int)) (v_ArrVal_417 (Array Int Int)) (|v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_57| Int) (v_ArrVal_421 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_416))) (let ((.cse1 (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse0 (store (store (store .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_424) |c_~#value~0.base| (store (select (store .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_417) |c_~#value~0.base|) |c_~#value~0.offset| (+ .cse1 1))) |v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_57| (store (select (store (store .cse2 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_421) |c_~#value~0.base| v_ArrVal_425) |v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_57|) 0 1)))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_57|) 0)) (not (= (mod (select (select .cse0 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< |c_~#inc_flag~0.base| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9|) (< (mod .cse1 4294967296) (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) (not (= 3 |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|)) (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_424 (Array Int Int)) (v_ArrVal_417 (Array Int Int)) (|v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_57| Int) (v_ArrVal_421 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| Int)) (let ((.cse3 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse4 (store (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_424) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_417) |c_~#value~0.base|) |c_~#value~0.offset| (+ 1 .cse3))) |v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_57| (store (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_421) |c_~#value~0.base| v_ArrVal_425) |v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_57|) 0 1)))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base_57|) 0)) (< |c_~#inc_flag~0.base| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9|) (< (mod .cse3 4294967296) (mod (select (select .cse4 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse4 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)))))) (= |c_thr1Thread2of2ForFork0_inc_~inc__v~0#1| 0) (= 5 |c_~#dec_flag~0.base|) (<= 1 |c_thr1Thread2of2ForFork0_inc_~inc__vn~0#1|) (<= |c_thr1Thread2of2ForFork0_inc_~inc__vn~0#1| 1) (or (and (exists ((|thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| Int) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (|thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base| Int)) (let ((.cse6 (select |c_#memory_int| |thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|))) (let ((.cse5 (store (store (store (store (store (store |c_#memory_int| |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base| v_DerPreprocessor_27) 3 v_DerPreprocessor_28) |thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| .cse6) |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base| v_DerPreprocessor_27) 3 v_DerPreprocessor_28) |thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| .cse6))) (and (not (= |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base| |thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|)) (not (= 5 |thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|)) (not (= 3 |thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|)) (= (select (select .cse5 3) 0) 1) (<= |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base| 4) (not (= |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base| 3)) (= (select .cse6 0) 1) (= (select .cse5 |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base|) (select |c_#memory_int| |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base|)))))) .cse7 .cse8) (and .cse7 (exists ((|thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| Int)) (and (not (= 3 |thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|)) (<= |thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| 4) (= (select (select |c_#memory_int| |thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|) 0) 1))) .cse8) (and .cse7 .cse8 (exists ((|thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| Int) (v_DerPreprocessor_38 (Array Int Int))) (let ((.cse10 (select |c_#memory_int| |thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|))) (and (not (= 5 |thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|)) (not (= 3 |thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|)) (= .cse9 (select (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_int| 3 v_DerPreprocessor_38) |thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| .cse10) 3 v_DerPreprocessor_38) |thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| .cse10) 3 v_DerPreprocessor_38) |thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| .cse10) 3 v_DerPreprocessor_38) |thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| .cse10) 3 v_DerPreprocessor_38) |thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| .cse10) 3 v_DerPreprocessor_38) |thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| .cse10) 3)) (= (select .cse10 0) 1)))))) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (let ((.cse11 (select |c_#memory_int| |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|))) (let ((.cse12 (= (select .cse11 0) 1))) (or (and (exists ((v_DerPreprocessor_38 (Array Int Int))) (= (select (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_int| 3 v_DerPreprocessor_38) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| .cse11) 3 v_DerPreprocessor_38) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| .cse11) 3 v_DerPreprocessor_38) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| .cse11) 3 v_DerPreprocessor_38) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| .cse11) 3 v_DerPreprocessor_38) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| .cse11) 3 v_DerPreprocessor_38) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| .cse11) 3) .cse9)) .cse7 .cse8 .cse12) (and .cse7 .cse8 (exists ((v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (|thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base| Int)) (let ((.cse13 (store (store (store (store (store (store |c_#memory_int| |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base| v_DerPreprocessor_27) 3 v_DerPreprocessor_28) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| .cse11) |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base| v_DerPreprocessor_27) 3 v_DerPreprocessor_28) |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| .cse11))) (and (not (= |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base| |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|)) (= (select (select .cse13 3) 0) 1) (<= |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base| 4) (not (= |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base| 3)) (= (select |c_#memory_int| |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base|) (select .cse13 |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base|))))) .cse12) (and .cse7 .cse8 (<= |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base| 4) .cse12)))) (not (= 5 |c_thr1Thread2of2ForFork0_inc_~#inc__casret~0#1.base|))))) is different from true [2023-08-24 11:19:28,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:19:30,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:19:46,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:19:48,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:19:51,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:19:53,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:19:56,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:19:58,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:20:01,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:20:03,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:20:07,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:20:09,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:20:11,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:20:24,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:20:27,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:20:29,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:20:31,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:20:33,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-24 11:20:35,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:20:38,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:20:41,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:20:43,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:20:45,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:20:47,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:20:49,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:20:52,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:21:04,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:21:30,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:21:32,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:21:35,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:21:36,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:21:38,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:21:40,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:21:43,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:22:03,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:22:05,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:22:07,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:22:10,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:22:12,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:22:14,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:22:16,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:22:18,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:22:31,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:22:34,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:22:36,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:22:38,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:22:42,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:23:12,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:23:14,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:23:17,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:23:19,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:23:22,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:23:24,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:23:26,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:23:28,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:23:31,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:23:59,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:24:01,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:24:03,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:24:06,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:24:09,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:24:18,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:24:20,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:24:22,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:24:24,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:24:25,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:24:28,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:24:30,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:24:32,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:24:34,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:24:36,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:24:39,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:24:41,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:24:43,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:24:45,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:24:48,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:24:50,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:24:52,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:24:54,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:24:57,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:24:59,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:25:03,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:25:09,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:25:11,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:25:14,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:25:16,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:25:18,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:25:20,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:25:24,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:25:26,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:25:29,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:25:31,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:25:48,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:25:50,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:25:52,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:25:54,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:25:57,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:25:59,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:26:01,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:26:04,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:26:07,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:26:09,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:26:12,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:26:14,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:26:16,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:26:18,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:26:20,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:26:22,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:26:24,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:26:26,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:26:28,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:26:31,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:26:33,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:26:36,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:26:40,858 INFO L124 PetriNetUnfolderBase]: 5045/8407 cut-off events. [2023-08-24 11:26:40,858 INFO L125 PetriNetUnfolderBase]: For 96508/96565 co-relation queries the response was YES. [2023-08-24 11:26:40,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46777 conditions, 8407 events. 5045/8407 cut-off events. For 96508/96565 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 61250 event pairs, 422 based on Foata normal form. 184/7916 useless extension candidates. Maximal degree in co-relation 46739. Up to 4261 conditions per place. [2023-08-24 11:26:40,923 INFO L140 encePairwiseOnDemand]: 279/306 looper letters, 590 selfloop transitions, 456 changer transitions 81/1130 dead transitions. [2023-08-24 11:26:40,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 1130 transitions, 12001 flow [2023-08-24 11:26:40,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-08-24 11:26:40,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2023-08-24 11:26:40,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 4765 transitions. [2023-08-24 11:26:40,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35390671420083186 [2023-08-24 11:26:40,934 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 4765 transitions. [2023-08-24 11:26:40,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 4765 transitions. [2023-08-24 11:26:40,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:26:40,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 4765 transitions. [2023-08-24 11:26:40,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 108.29545454545455) internal successors, (4765), 44 states have internal predecessors, (4765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:26:40,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 306.0) internal successors, (13770), 45 states have internal predecessors, (13770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:26:40,960 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 306.0) internal successors, (13770), 45 states have internal predecessors, (13770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:26:40,960 INFO L175 Difference]: Start difference. First operand has 119 places, 262 transitions, 2322 flow. Second operand 44 states and 4765 transitions. [2023-08-24 11:26:40,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 1130 transitions, 12001 flow [2023-08-24 11:26:41,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 1130 transitions, 11017 flow, removed 476 selfloop flow, removed 5 redundant places. [2023-08-24 11:26:41,457 INFO L231 Difference]: Finished difference. Result has 191 places, 712 transitions, 7651 flow [2023-08-24 11:26:41,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=1990, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=7651, PETRI_PLACES=191, PETRI_TRANSITIONS=712} [2023-08-24 11:26:41,458 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 148 predicate places. [2023-08-24 11:26:41,458 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 712 transitions, 7651 flow [2023-08-24 11:26:41,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 96.5) internal successors, (1930), 20 states have internal predecessors, (1930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:26:41,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:26:41,459 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:26:41,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-24 11:26:41,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-08-24 11:26:41,665 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-24 11:26:41,665 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:26:41,665 INFO L85 PathProgramCache]: Analyzing trace with hash -142964150, now seen corresponding path program 1 times [2023-08-24 11:26:41,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:26:41,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353170805] [2023-08-24 11:26:41,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:26:41,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:26:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:26:42,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 11:26:42,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:26:42,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353170805] [2023-08-24 11:26:42,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353170805] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:26:42,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419701506] [2023-08-24 11:26:42,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:26:42,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:26:42,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:26:42,712 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 11:26:42,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-24 11:26:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:26:42,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 69 conjunts are in the unsatisfiable core [2023-08-24 11:26:42,835 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:26:43,057 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-24 11:26:43,058 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 33 [2023-08-24 11:26:43,368 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-24 11:26:43,857 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-24 11:26:44,275 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-24 11:26:44,276 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 11:26:44,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 11:26:44,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 11:26:45,451 INFO L322 Elim1Store]: treesize reduction 116, result has 29.7 percent of original size [2023-08-24 11:26:45,451 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 125 treesize of output 383 [2023-08-24 11:26:45,497 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-24 11:26:45,534 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-24 11:26:45,571 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-24 11:26:45,611 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-24 11:26:45,757 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 11:26:45,758 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 11:26:45,768 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 11:26:45,817 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 11:26:45,848 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 11:26:45,848 INFO L217 Elim1Store]: Index analysis took 103 ms [2023-08-24 11:26:45,913 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 215 [2023-08-24 11:26:46,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 11:26:46,250 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 11:26:46,281 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 11:26:46,360 INFO L217 Elim1Store]: Index analysis took 259 ms [2023-08-24 11:26:46,450 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 230 [2023-08-24 11:26:46,579 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 11:26:46,580 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 240 [2023-08-24 11:26:46,863 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 11:26:46,864 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 156 [2023-08-24 11:26:47,045 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 11:26:47,046 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 246 [2023-08-24 11:26:47,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 11:26:47,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 11:26:47,522 INFO L322 Elim1Store]: treesize reduction 121, result has 18.2 percent of original size [2023-08-24 11:26:47,522 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 781 treesize of output 795 [2023-08-24 11:26:48,432 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 11:26:48,437 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 252 [2023-08-24 11:26:48,682 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 11:26:48,683 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 471 [2023-08-24 11:26:49,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 11:26:49,197 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 11 [2023-08-24 11:26:49,288 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 11:26:49,290 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 336 [2023-08-24 11:26:49,549 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 11 [2023-08-24 11:26:49,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 11:26:49,755 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 42 [2023-08-24 11:26:49,860 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 11:26:49,861 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 183 [2023-08-24 11:26:50,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 11:26:50,626 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 11:26:54,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 11:26:54,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419701506] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 11:26:54,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 11:26:54,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2023-08-24 11:26:54,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594801702] [2023-08-24 11:26:54,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 11:26:54,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-24 11:26:54,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:26:54,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-24 11:26:54,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=303, Unknown=2, NotChecked=0, Total=380 [2023-08-24 11:26:54,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 306 [2023-08-24 11:26:54,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 712 transitions, 7651 flow. Second operand has 20 states, 20 states have (on average 96.65) internal successors, (1933), 20 states have internal predecessors, (1933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:26:54,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:26:54,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 306 [2023-08-24 11:26:54,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:27:05,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:27:07,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:27:10,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:27:12,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:27:16,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:27:18,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:27:20,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:27:22,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:27:30,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:27:32,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:27:35,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:27:36,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:27:38,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:27:59,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:28:15,011 WARN L234 SmtUtils]: Spent 10.97s on a formula simplification that was a NOOP. DAG size: 127 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 11:28:19,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:28:23,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:28:25,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:28:27,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:28:29,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:28:41,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:28:43,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:28:45,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:28:47,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:28:51,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:28:53,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:28:55,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:28:57,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:29:00,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:29:02,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:29:08,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:29:11,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:29:13,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 11:29:16,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-08-24 11:29:38,310 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 11:29:38,357 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 11:29:39,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-24 11:29:39,511 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-24 11:29:39,566 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 137 [2023-08-24 11:29:39,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-24 11:29:39,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 11:29:39,568 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:167) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:376) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:482) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.computeUnfoldingHelper(PetriNetUnfolderBase.java:226) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.computeUnfolding(PetriNetUnfolderBase.java:183) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.(PetriNetUnfolderBase.java:123) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:72) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:128) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:481) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) 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-24 11:29:39,571 INFO L158 Benchmark]: Toolchain (without parser) took 858865.04ms. Allocated memory was 367.0MB in the beginning and 501.2MB in the end (delta: 134.2MB). Free memory was 324.4MB in the beginning and 180.7MB in the end (delta: 143.7MB). Peak memory consumption was 281.7MB. Max. memory is 16.0GB. [2023-08-24 11:29:39,571 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 367.0MB. Free memory was 345.0MB in the beginning and 344.9MB in the end (delta: 86.8kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 11:29:39,571 INFO L158 Benchmark]: CACSL2BoogieTranslator took 458.34ms. Allocated memory is still 367.0MB. Free memory was 324.1MB in the beginning and 303.1MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-24 11:29:39,571 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.44ms. Allocated memory is still 367.0MB. Free memory was 303.1MB in the beginning and 301.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 11:29:39,571 INFO L158 Benchmark]: Boogie Preprocessor took 49.45ms. Allocated memory is still 367.0MB. Free memory was 301.0MB in the beginning and 298.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 11:29:39,571 INFO L158 Benchmark]: RCFGBuilder took 680.89ms. Allocated memory is still 367.0MB. Free memory was 298.9MB in the beginning and 262.2MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-08-24 11:29:39,572 INFO L158 Benchmark]: TraceAbstraction took 857602.43ms. Allocated memory was 367.0MB in the beginning and 501.2MB in the end (delta: 134.2MB). Free memory was 261.2MB in the beginning and 180.7MB in the end (delta: 80.4MB). Peak memory consumption was 218.8MB. Max. memory is 16.0GB. [2023-08-24 11:29:39,572 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.14ms. Allocated memory is still 367.0MB. Free memory was 345.0MB in the beginning and 344.9MB in the end (delta: 86.8kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 458.34ms. Allocated memory is still 367.0MB. Free memory was 324.1MB in the beginning and 303.1MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 65.44ms. Allocated memory is still 367.0MB. Free memory was 303.1MB in the beginning and 301.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 49.45ms. Allocated memory is still 367.0MB. Free memory was 301.0MB in the beginning and 298.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 680.89ms. Allocated memory is still 367.0MB. Free memory was 298.9MB in the beginning and 262.2MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 857602.43ms. Allocated memory was 367.0MB in the beginning and 501.2MB in the end (delta: 134.2MB). Free memory was 261.2MB in the beginning and 180.7MB in the end (delta: 80.4MB). Peak memory consumption was 218.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 250]: Unsoundness Warning unspecified type, defaulting to int C: short [250] - GenericResultAtLocation [Line: 250]: Unsoundness Warning unspecified type, defaulting to int C: short [250] - GenericResultAtLocation [Line: 686]: Unsoundness Warning unspecified type, defaulting to int C: volatile unsigned [686] - GenericResultAtLocation [Line: 687]: Unsoundness Warning unspecified type, defaulting to int C: unsigned [687] - GenericResultAtLocation [Line: 688]: Unsoundness Warning unspecified type, defaulting to int C: unsigned [688] - GenericResultAtLocation [Line: 689]: Unsoundness Warning unspecified type, defaulting to int C: unsigned [689] - GenericResultAtLocation [Line: 690]: Unsoundness Warning unspecified type, defaulting to int C: volatile unsigned [690] - GenericResultAtLocation [Line: 701]: Unsoundness Warning unspecified type, defaulting to int C: volatile unsigned [701] - GenericResultAtLocation [Line: 702]: Unsoundness Warning unspecified type, defaulting to int C: volatile unsigned [702] - GenericResultAtLocation [Line: 703]: Unsoundness Warning unspecified type, defaulting to int C: volatile unsigned [703] - GenericResultAtLocation [Line: 704]: Unsoundness Warning unspecified type, defaulting to int C: unsigned [704] - GenericResultAtLocation [Line: 708]: Unsoundness Warning unspecified type, defaulting to int C: inline unsigned [708] - GenericResultAtLocation [Line: 709]: Unsoundness Warning unspecified type, defaulting to int C: unsigned [709] - GenericResultAtLocation [Line: 722]: Unsoundness Warning unspecified type, defaulting to int C: unsigned [722] - GenericResultAtLocation [Line: 726]: Unsoundness Warning unspecified type, defaulting to int C: inline unsigned [726] - GenericResultAtLocation [Line: 727]: Unsoundness Warning unspecified type, defaulting to int C: unsigned [727] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 93 PlacesBefore, 23 PlacesAfterwards, 98 TransitionsBefore, 27 TransitionsAfterwards, 1690 CoEnabledTransitionPairs, 6 FixpointIterations, 18 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 1 ChoiceCompositions, 84 TotalNumberOfCompositions, 2354 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1558, independent: 1424, independent conditional: 0, independent unconditional: 1424, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 917, independent: 873, independent conditional: 0, independent unconditional: 873, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1558, independent: 551, independent conditional: 0, independent unconditional: 551, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 917, unknown conditional: 0, unknown unconditional: 917] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 93 PlacesBefore, 23 PlacesAfterwards, 98 TransitionsBefore, 27 TransitionsAfterwards, 1690 CoEnabledTransitionPairs, 6 FixpointIterations, 18 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 1 ChoiceCompositions, 84 TotalNumberOfCompositions, 2357 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1576, independent: 1442, independent conditional: 0, independent unconditional: 1442, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 930, independent: 885, independent conditional: 0, independent unconditional: 885, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1576, independent: 557, independent conditional: 0, independent unconditional: 557, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 930, unknown conditional: 0, unknown unconditional: 930] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.5s, 154 PlacesBefore, 43 PlacesAfterwards, 164 TransitionsBefore, 52 TransitionsAfterwards, 11960 CoEnabledTransitionPairs, 5 FixpointIterations, 18 TrivialSequentialCompositions, 100 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 23 ConcurrentYvCompositions, 1 ChoiceCompositions, 142 TotalNumberOfCompositions, 17927 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10258, independent: 10030, independent conditional: 0, independent unconditional: 10030, dependent: 228, dependent conditional: 0, dependent unconditional: 228, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6463, independent: 6384, independent conditional: 0, independent unconditional: 6384, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10258, independent: 3646, independent conditional: 0, independent unconditional: 3646, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 6463, unknown conditional: 0, unknown unconditional: 6463] , Statistics on independence cache: Total cache size (in pairs): 301, Positive cache size: 268, Positive conditional cache size: 0, Positive unconditional cache size: 268, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown