/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 INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 08:16:52,272 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 08:16:52,336 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 08:16:52,347 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 08:16:52,347 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 08:16:52,364 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 08:16:52,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 08:16:52,365 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 08:16:52,365 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 08:16:52,368 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 08:16:52,368 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 08:16:52,368 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 08:16:52,368 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 08:16:52,369 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 08:16:52,369 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 08:16:52,369 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 08:16:52,370 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 08:16:52,370 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 08:16:52,370 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 08:16:52,370 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 08:16:52,370 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 08:16:52,371 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 08:16:52,371 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 08:16:52,371 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 08:16:52,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 08:16:52,371 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 08:16:52,372 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 08:16:52,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 08:16:52,372 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 08:16:52,372 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 08:16:52,373 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 08:16:52,373 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 08:16:52,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 08:16:52,373 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 08:16:52,373 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 08:16:52,374 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 -> INSUFFICIENT_FIRST [2023-08-24 08:16:52,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 08:16:52,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 08:16:52,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 08:16:52,664 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 08:16:52,664 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 08:16:52,670 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c [2023-08-24 08:16:53,635 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 08:16:53,846 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 08:16:53,847 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c [2023-08-24 08:16:53,855 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bed6a7697/aba61d18294346e297f96bd48d946bb6/FLAGd3fafcf34 [2023-08-24 08:16:53,868 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bed6a7697/aba61d18294346e297f96bd48d946bb6 [2023-08-24 08:16:53,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 08:16:53,871 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 08:16:53,871 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 08:16:53,872 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 08:16:53,873 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 08:16:53,874 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 08:16:53" (1/1) ... [2023-08-24 08:16:53,874 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76fe9b10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:16:53, skipping insertion in model container [2023-08-24 08:16:53,875 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 08:16:53" (1/1) ... [2023-08-24 08:16:53,893 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 08:16:54,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/weaver/parallel-parallel-sum-1-dsl.wvr.c[4372,4385] [2023-08-24 08:16:54,045 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 08:16:54,055 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 08:16:54,087 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c[4372,4385] [2023-08-24 08:16:54,089 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 08:16:54,098 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 08:16:54,099 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 08:16:54,103 INFO L206 MainTranslator]: Completed translation [2023-08-24 08:16:54,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:16:54 WrapperNode [2023-08-24 08:16:54,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 08:16:54,105 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 08:16:54,105 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 08:16:54,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 08:16:54,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:16:54" (1/1) ... [2023-08-24 08:16:54,130 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:16:54" (1/1) ... [2023-08-24 08:16:54,161 INFO L138 Inliner]: procedures = 29, calls = 95, calls flagged for inlining = 21, calls inlined = 27, statements flattened = 304 [2023-08-24 08:16:54,162 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 08:16:54,162 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 08:16:54,162 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 08:16:54,162 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 08:16:54,170 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:16:54" (1/1) ... [2023-08-24 08:16:54,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:16:54" (1/1) ... [2023-08-24 08:16:54,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:16:54" (1/1) ... [2023-08-24 08:16:54,180 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:16:54" (1/1) ... [2023-08-24 08:16:54,188 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:16:54" (1/1) ... [2023-08-24 08:16:54,191 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:16:54" (1/1) ... [2023-08-24 08:16:54,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:16:54" (1/1) ... [2023-08-24 08:16:54,194 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:16:54" (1/1) ... [2023-08-24 08:16:54,196 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 08:16:54,196 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 08:16:54,196 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 08:16:54,196 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 08:16:54,207 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:16:54" (1/1) ... [2023-08-24 08:16:54,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 08:16:54,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 08:16:54,258 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-24 08:16:54,290 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 08:16:54,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 08:16:54,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 08:16:54,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 08:16:54,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 08:16:54,305 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 08:16:54,305 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 08:16:54,305 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 08:16:54,305 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 08:16:54,305 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-24 08:16:54,305 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-24 08:16:54,305 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-24 08:16:54,305 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-24 08:16:54,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 08:16:54,306 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-08-24 08:16:54,306 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-08-24 08:16:54,307 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-08-24 08:16:54,307 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-08-24 08:16:54,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 08:16:54,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 08:16:54,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-24 08:16:54,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 08:16:54,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 08:16:54,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 08:16:54,309 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 08:16:54,407 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 08:16:54,409 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 08:16:54,734 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 08:16:54,906 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 08:16:54,906 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-08-24 08:16:54,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 08:16:54 BoogieIcfgContainer [2023-08-24 08:16:54,908 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 08:16:54,909 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 08:16:54,909 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 08:16:54,911 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 08:16:54,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 08:16:53" (1/3) ... [2023-08-24 08:16:54,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634d9d17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 08:16:54, skipping insertion in model container [2023-08-24 08:16:54,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:16:54" (2/3) ... [2023-08-24 08:16:54,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634d9d17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 08:16:54, skipping insertion in model container [2023-08-24 08:16:54,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 08:16:54" (3/3) ... [2023-08-24 08:16:54,913 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1-dsl.wvr.c [2023-08-24 08:16:54,924 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 08:16:54,924 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 08:16:54,924 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 08:16:55,023 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2023-08-24 08:16:55,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 264 places, 263 transitions, 598 flow [2023-08-24 08:16:55,154 INFO L124 PetriNetUnfolderBase]: 18/235 cut-off events. [2023-08-24 08:16:55,154 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-24 08:16:55,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 235 events. 18/235 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 305 event pairs, 0 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 204. Up to 3 conditions per place. [2023-08-24 08:16:55,159 INFO L82 GeneralOperation]: Start removeDead. Operand has 264 places, 263 transitions, 598 flow [2023-08-24 08:16:55,166 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 228 places, 227 transitions, 502 flow [2023-08-24 08:16:55,170 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 08:16:55,185 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 228 places, 227 transitions, 502 flow [2023-08-24 08:16:55,187 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 228 places, 227 transitions, 502 flow [2023-08-24 08:16:55,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 228 places, 227 transitions, 502 flow [2023-08-24 08:16:55,278 INFO L124 PetriNetUnfolderBase]: 18/227 cut-off events. [2023-08-24 08:16:55,278 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-24 08:16:55,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 227 events. 18/227 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 302 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 204. Up to 3 conditions per place. [2023-08-24 08:16:55,283 INFO L119 LiptonReduction]: Number of co-enabled transitions 7920 [2023-08-24 08:17:00,028 INFO L134 LiptonReduction]: Checked pairs total: 33760 [2023-08-24 08:17:00,028 INFO L136 LiptonReduction]: Total number of compositions: 188 [2023-08-24 08:17:00,037 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 08:17:00,041 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;@3e1be5cc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 08:17:00,041 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-08-24 08:17:00,048 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 08:17:00,048 INFO L124 PetriNetUnfolderBase]: 9/64 cut-off events. [2023-08-24 08:17:00,048 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-24 08:17:00,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:17:00,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:17:00,049 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 08:17:00,052 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:17:00,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1898109785, now seen corresponding path program 1 times [2023-08-24 08:17:00,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:17:00,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14339468] [2023-08-24 08:17:00,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:17:00,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:17:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:17:00,564 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 08:17:00,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:17:00,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14339468] [2023-08-24 08:17:00,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14339468] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:17:00,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:17:00,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 08:17:00,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609611971] [2023-08-24 08:17:00,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:17:00,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 08:17:00,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:17:00,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 08:17:00,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 08:17:00,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 455 [2023-08-24 08:17:00,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 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 08:17:00,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:17:00,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 455 [2023-08-24 08:17:00,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:17:03,124 INFO L124 PetriNetUnfolderBase]: 24447/33183 cut-off events. [2023-08-24 08:17:03,125 INFO L125 PetriNetUnfolderBase]: For 5662/5662 co-relation queries the response was YES. [2023-08-24 08:17:03,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69959 conditions, 33183 events. 24447/33183 cut-off events. For 5662/5662 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 178552 event pairs, 7197 based on Foata normal form. 1/25597 useless extension candidates. Maximal degree in co-relation 68487. Up to 12303 conditions per place. [2023-08-24 08:17:03,279 INFO L140 encePairwiseOnDemand]: 448/455 looper letters, 109 selfloop transitions, 8 changer transitions 1/138 dead transitions. [2023-08-24 08:17:03,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 138 transitions, 641 flow [2023-08-24 08:17:03,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 08:17:03,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 08:17:03,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 975 transitions. [2023-08-24 08:17:03,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2023-08-24 08:17:03,297 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 975 transitions. [2023-08-24 08:17:03,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 975 transitions. [2023-08-24 08:17:03,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:17:03,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 975 transitions. [2023-08-24 08:17:03,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 243.75) internal successors, (975), 4 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:17:03,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 455.0) internal successors, (2275), 5 states have internal predecessors, (2275), 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 08:17:03,312 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 455.0) internal successors, (2275), 5 states have internal predecessors, (2275), 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 08:17:03,314 INFO L175 Difference]: Start difference. First operand has 75 places, 65 transitions, 178 flow. Second operand 4 states and 975 transitions. [2023-08-24 08:17:03,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 138 transitions, 641 flow [2023-08-24 08:17:03,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 138 transitions, 555 flow, removed 0 selfloop flow, removed 12 redundant places. [2023-08-24 08:17:03,482 INFO L231 Difference]: Finished difference. Result has 68 places, 72 transitions, 199 flow [2023-08-24 08:17:03,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=68, PETRI_TRANSITIONS=72} [2023-08-24 08:17:03,486 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -7 predicate places. [2023-08-24 08:17:03,486 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 72 transitions, 199 flow [2023-08-24 08:17:03,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 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 08:17:03,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:17:03,487 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:17:03,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 08:17:03,488 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 08:17:03,494 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:17:03,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1410762776, now seen corresponding path program 1 times [2023-08-24 08:17:03,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:17:03,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259777236] [2023-08-24 08:17:03,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:17:03,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:17:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:17:03,699 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 08:17:03,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:17:03,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259777236] [2023-08-24 08:17:03,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259777236] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:17:03,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:17:03,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 08:17:03,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017450168] [2023-08-24 08:17:03,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:17:03,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 08:17:03,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:17:03,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 08:17:03,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 08:17:03,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 455 [2023-08-24 08:17:03,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 72 transitions, 199 flow. Second operand has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 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 08:17:03,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:17:03,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 455 [2023-08-24 08:17:03,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:17:07,267 INFO L124 PetriNetUnfolderBase]: 40211/54719 cut-off events. [2023-08-24 08:17:07,267 INFO L125 PetriNetUnfolderBase]: For 11876/11876 co-relation queries the response was YES. [2023-08-24 08:17:07,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120973 conditions, 54719 events. 40211/54719 cut-off events. For 11876/11876 co-relation queries the response was YES. Maximal size of possible extension queue 1378. Compared 312439 event pairs, 15979 based on Foata normal form. 1/42240 useless extension candidates. Maximal degree in co-relation 43215. Up to 22845 conditions per place. [2023-08-24 08:17:07,445 INFO L140 encePairwiseOnDemand]: 448/455 looper letters, 115 selfloop transitions, 11 changer transitions 1/147 dead transitions. [2023-08-24 08:17:07,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 147 transitions, 654 flow [2023-08-24 08:17:07,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 08:17:07,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 08:17:07,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 977 transitions. [2023-08-24 08:17:07,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5368131868131868 [2023-08-24 08:17:07,448 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 977 transitions. [2023-08-24 08:17:07,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 977 transitions. [2023-08-24 08:17:07,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:17:07,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 977 transitions. [2023-08-24 08:17:07,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 244.25) internal successors, (977), 4 states have internal predecessors, (977), 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 08:17:07,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 455.0) internal successors, (2275), 5 states have internal predecessors, (2275), 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 08:17:07,453 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 455.0) internal successors, (2275), 5 states have internal predecessors, (2275), 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 08:17:07,453 INFO L175 Difference]: Start difference. First operand has 68 places, 72 transitions, 199 flow. Second operand 4 states and 977 transitions. [2023-08-24 08:17:07,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 147 transitions, 654 flow [2023-08-24 08:17:07,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 147 transitions, 654 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 08:17:07,459 INFO L231 Difference]: Finished difference. Result has 73 places, 79 transitions, 278 flow [2023-08-24 08:17:07,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=278, PETRI_PLACES=73, PETRI_TRANSITIONS=79} [2023-08-24 08:17:07,460 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -2 predicate places. [2023-08-24 08:17:07,460 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 79 transitions, 278 flow [2023-08-24 08:17:07,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 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 08:17:07,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:17:07,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:17:07,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 08:17:07,461 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 08:17:07,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:17:07,461 INFO L85 PathProgramCache]: Analyzing trace with hash -322165593, now seen corresponding path program 1 times [2023-08-24 08:17:07,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:17:07,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394854392] [2023-08-24 08:17:07,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:17:07,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:17:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:17:07,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:17:07,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:17:07,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394854392] [2023-08-24 08:17:07,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394854392] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:17:07,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:17:07,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 08:17:07,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056941012] [2023-08-24 08:17:07,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:17:07,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:17:07,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:17:07,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:17:07,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:17:07,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 455 [2023-08-24 08:17:07,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 79 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 207.8) internal successors, (1039), 5 states have internal predecessors, (1039), 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 08:17:07,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:17:07,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 455 [2023-08-24 08:17:07,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:17:12,217 INFO L124 PetriNetUnfolderBase]: 52244/71422 cut-off events. [2023-08-24 08:17:12,217 INFO L125 PetriNetUnfolderBase]: For 34593/34593 co-relation queries the response was YES. [2023-08-24 08:17:12,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169705 conditions, 71422 events. 52244/71422 cut-off events. For 34593/34593 co-relation queries the response was YES. Maximal size of possible extension queue 1847. Compared 428320 event pairs, 34723 based on Foata normal form. 0/55814 useless extension candidates. Maximal degree in co-relation 71375. Up to 50266 conditions per place. [2023-08-24 08:17:12,461 INFO L140 encePairwiseOnDemand]: 449/455 looper letters, 121 selfloop transitions, 5 changer transitions 0/146 dead transitions. [2023-08-24 08:17:12,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 146 transitions, 753 flow [2023-08-24 08:17:12,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:17:12,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:17:12,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1112 transitions. [2023-08-24 08:17:12,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4887912087912088 [2023-08-24 08:17:12,464 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1112 transitions. [2023-08-24 08:17:12,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1112 transitions. [2023-08-24 08:17:12,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:17:12,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1112 transitions. [2023-08-24 08:17:12,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 222.4) internal successors, (1112), 5 states have internal predecessors, (1112), 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 08:17:12,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 455.0) internal successors, (2730), 6 states have internal predecessors, (2730), 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 08:17:12,471 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 455.0) internal successors, (2730), 6 states have internal predecessors, (2730), 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 08:17:12,471 INFO L175 Difference]: Start difference. First operand has 73 places, 79 transitions, 278 flow. Second operand 5 states and 1112 transitions. [2023-08-24 08:17:12,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 146 transitions, 753 flow [2023-08-24 08:17:12,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 146 transitions, 749 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-24 08:17:12,495 INFO L231 Difference]: Finished difference. Result has 80 places, 83 transitions, 324 flow [2023-08-24 08:17:12,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=324, PETRI_PLACES=80, PETRI_TRANSITIONS=83} [2023-08-24 08:17:12,496 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 5 predicate places. [2023-08-24 08:17:12,498 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 83 transitions, 324 flow [2023-08-24 08:17:12,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 207.8) internal successors, (1039), 5 states have internal predecessors, (1039), 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 08:17:12,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:17:12,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:17:12,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 08:17:12,499 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 08:17:12,500 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:17:12,500 INFO L85 PathProgramCache]: Analyzing trace with hash 348277624, now seen corresponding path program 1 times [2023-08-24 08:17:12,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:17:12,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514217220] [2023-08-24 08:17:12,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:17:12,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:17:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:17:12,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:17:12,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:17:12,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514217220] [2023-08-24 08:17:12,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514217220] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:17:12,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:17:12,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 08:17:12,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121325019] [2023-08-24 08:17:12,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:17:12,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:17:12,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:17:12,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:17:12,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:17:12,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 455 [2023-08-24 08:17:12,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 83 transitions, 324 flow. Second operand has 5 states, 5 states have (on average 207.8) internal successors, (1039), 5 states have internal predecessors, (1039), 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 08:17:12,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:17:12,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 455 [2023-08-24 08:17:12,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:17:16,439 INFO L124 PetriNetUnfolderBase]: 43919/60156 cut-off events. [2023-08-24 08:17:16,439 INFO L125 PetriNetUnfolderBase]: For 33722/33722 co-relation queries the response was YES. [2023-08-24 08:17:16,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147051 conditions, 60156 events. 43919/60156 cut-off events. For 33722/33722 co-relation queries the response was YES. Maximal size of possible extension queue 1583. Compared 353513 event pairs, 30832 based on Foata normal form. 0/51689 useless extension candidates. Maximal degree in co-relation 134975. Up to 50266 conditions per place. [2023-08-24 08:17:16,656 INFO L140 encePairwiseOnDemand]: 449/455 looper letters, 58 selfloop transitions, 2 changer transitions 51/131 dead transitions. [2023-08-24 08:17:16,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 131 transitions, 677 flow [2023-08-24 08:17:16,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:17:16,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:17:16,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1103 transitions. [2023-08-24 08:17:16,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4848351648351648 [2023-08-24 08:17:16,659 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1103 transitions. [2023-08-24 08:17:16,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1103 transitions. [2023-08-24 08:17:16,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:17:16,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1103 transitions. [2023-08-24 08:17:16,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 220.6) internal successors, (1103), 5 states have internal predecessors, (1103), 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 08:17:16,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 455.0) internal successors, (2730), 6 states have internal predecessors, (2730), 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 08:17:16,665 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 455.0) internal successors, (2730), 6 states have internal predecessors, (2730), 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 08:17:16,665 INFO L175 Difference]: Start difference. First operand has 80 places, 83 transitions, 324 flow. Second operand 5 states and 1103 transitions. [2023-08-24 08:17:16,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 131 transitions, 677 flow [2023-08-24 08:17:16,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 131 transitions, 673 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 08:17:16,680 INFO L231 Difference]: Finished difference. Result has 85 places, 80 transitions, 302 flow [2023-08-24 08:17:16,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=302, PETRI_PLACES=85, PETRI_TRANSITIONS=80} [2023-08-24 08:17:16,681 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 10 predicate places. [2023-08-24 08:17:16,681 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 80 transitions, 302 flow [2023-08-24 08:17:16,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 207.8) internal successors, (1039), 5 states have internal predecessors, (1039), 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 08:17:16,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:17:16,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:17:16,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 08:17:16,682 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 08:17:16,682 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:17:16,682 INFO L85 PathProgramCache]: Analyzing trace with hash -2068381003, now seen corresponding path program 1 times [2023-08-24 08:17:16,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:17:16,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084564664] [2023-08-24 08:17:16,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:17:16,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:17:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:17:16,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:17:16,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:17:16,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084564664] [2023-08-24 08:17:16,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084564664] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 08:17:16,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952156720] [2023-08-24 08:17:16,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:17:16,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 08:17:16,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 08:17:16,824 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 08:17:16,892 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 08:17:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:17:16,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-24 08:17:16,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 08:17:17,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:17:17,085 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 08:17:17,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:17:17,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952156720] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 08:17:17,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 08:17:17,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-24 08:17:17,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005225159] [2023-08-24 08:17:17,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 08:17:17,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-24 08:17:17,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:17:17,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-24 08:17:17,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-08-24 08:17:17,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 455 [2023-08-24 08:17:17,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 80 transitions, 302 flow. Second operand has 11 states, 11 states have (on average 205.45454545454547) internal successors, (2260), 11 states have internal predecessors, (2260), 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 08:17:17,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:17:17,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 455 [2023-08-24 08:17:17,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:17:21,882 INFO L124 PetriNetUnfolderBase]: 50674/69405 cut-off events. [2023-08-24 08:17:21,882 INFO L125 PetriNetUnfolderBase]: For 48897/48897 co-relation queries the response was YES. [2023-08-24 08:17:22,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175332 conditions, 69405 events. 50674/69405 cut-off events. For 48897/48897 co-relation queries the response was YES. Maximal size of possible extension queue 1840. Compared 425307 event pairs, 17153 based on Foata normal form. 3638/68767 useless extension candidates. Maximal degree in co-relation 175311. Up to 28288 conditions per place. [2023-08-24 08:17:22,206 INFO L140 encePairwiseOnDemand]: 447/455 looper letters, 159 selfloop transitions, 8 changer transitions 0/187 dead transitions. [2023-08-24 08:17:22,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 187 transitions, 1059 flow [2023-08-24 08:17:22,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 08:17:22,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 08:17:22,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1544 transitions. [2023-08-24 08:17:22,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4847723704866562 [2023-08-24 08:17:22,213 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1544 transitions. [2023-08-24 08:17:22,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1544 transitions. [2023-08-24 08:17:22,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:17:22,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1544 transitions. [2023-08-24 08:17:22,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 220.57142857142858) internal successors, (1544), 7 states have internal predecessors, (1544), 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 08:17:22,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 455.0) internal successors, (3640), 8 states have internal predecessors, (3640), 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 08:17:22,220 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 455.0) internal successors, (3640), 8 states have internal predecessors, (3640), 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 08:17:22,220 INFO L175 Difference]: Start difference. First operand has 85 places, 80 transitions, 302 flow. Second operand 7 states and 1544 transitions. [2023-08-24 08:17:22,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 187 transitions, 1059 flow [2023-08-24 08:17:22,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 187 transitions, 1035 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-08-24 08:17:22,241 INFO L231 Difference]: Finished difference. Result has 88 places, 86 transitions, 368 flow [2023-08-24 08:17:22,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=368, PETRI_PLACES=88, PETRI_TRANSITIONS=86} [2023-08-24 08:17:22,242 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 13 predicate places. [2023-08-24 08:17:22,242 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 86 transitions, 368 flow [2023-08-24 08:17:22,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 205.45454545454547) internal successors, (2260), 11 states have internal predecessors, (2260), 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 08:17:22,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:17:22,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:17:22,248 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 08:17:22,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 08:17:22,448 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 08:17:22,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:17:22,448 INFO L85 PathProgramCache]: Analyzing trace with hash 2027202032, now seen corresponding path program 1 times [2023-08-24 08:17:22,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:17:22,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461949562] [2023-08-24 08:17:22,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:17:22,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:17:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:17:22,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:17:22,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:17:22,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461949562] [2023-08-24 08:17:22,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461949562] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 08:17:22,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473718182] [2023-08-24 08:17:22,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:17:22,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 08:17:22,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 08:17:22,656 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 08:17:22,663 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 08:17:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:17:22,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-24 08:17:22,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 08:17:22,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:17:22,849 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 08:17:22,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:17:22,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473718182] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 08:17:22,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 08:17:22,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-24 08:17:22,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047251129] [2023-08-24 08:17:22,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 08:17:22,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-24 08:17:22,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:17:22,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-24 08:17:22,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-08-24 08:17:22,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 455 [2023-08-24 08:17:22,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 86 transitions, 368 flow. Second operand has 12 states, 12 states have (on average 205.41666666666666) internal successors, (2465), 12 states have internal predecessors, (2465), 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 08:17:22,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:17:22,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 455 [2023-08-24 08:17:22,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:17:27,205 INFO L124 PetriNetUnfolderBase]: 40749/56293 cut-off events. [2023-08-24 08:17:27,205 INFO L125 PetriNetUnfolderBase]: For 64553/64553 co-relation queries the response was YES. [2023-08-24 08:17:27,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156626 conditions, 56293 events. 40749/56293 cut-off events. For 64553/64553 co-relation queries the response was YES. Maximal size of possible extension queue 1569. Compared 337020 event pairs, 12988 based on Foata normal form. 2458/55322 useless extension candidates. Maximal degree in co-relation 143695. Up to 26698 conditions per place. [2023-08-24 08:17:27,439 INFO L140 encePairwiseOnDemand]: 447/455 looper letters, 100 selfloop transitions, 5 changer transitions 51/176 dead transitions. [2023-08-24 08:17:27,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 176 transitions, 1023 flow [2023-08-24 08:17:27,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 08:17:27,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 08:17:27,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1535 transitions. [2023-08-24 08:17:27,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48194662480376765 [2023-08-24 08:17:27,442 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1535 transitions. [2023-08-24 08:17:27,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1535 transitions. [2023-08-24 08:17:27,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:17:27,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1535 transitions. [2023-08-24 08:17:27,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 219.28571428571428) internal successors, (1535), 7 states have internal predecessors, (1535), 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 08:17:27,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 455.0) internal successors, (3640), 8 states have internal predecessors, (3640), 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 08:17:27,448 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 455.0) internal successors, (3640), 8 states have internal predecessors, (3640), 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 08:17:27,449 INFO L175 Difference]: Start difference. First operand has 88 places, 86 transitions, 368 flow. Second operand 7 states and 1535 transitions. [2023-08-24 08:17:27,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 176 transitions, 1023 flow [2023-08-24 08:17:27,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 176 transitions, 1007 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-24 08:17:27,467 INFO L231 Difference]: Finished difference. Result has 96 places, 85 transitions, 362 flow [2023-08-24 08:17:27,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=362, PETRI_PLACES=96, PETRI_TRANSITIONS=85} [2023-08-24 08:17:27,468 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 21 predicate places. [2023-08-24 08:17:27,468 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 85 transitions, 362 flow [2023-08-24 08:17:27,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 205.41666666666666) internal successors, (2465), 12 states have internal predecessors, (2465), 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 08:17:27,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:17:27,469 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:17:27,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-24 08:17:27,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-08-24 08:17:27,674 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 08:17:27,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:17:27,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1593234664, now seen corresponding path program 1 times [2023-08-24 08:17:27,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:17:27,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599240289] [2023-08-24 08:17:27,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:17:27,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:17:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:17:27,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:17:27,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:17:27,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599240289] [2023-08-24 08:17:27,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599240289] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 08:17:27,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187606635] [2023-08-24 08:17:27,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:17:27,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 08:17:27,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 08:17:27,867 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 08:17:27,896 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 08:17:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:17:28,002 INFO L262 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-24 08:17:28,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 08:17:28,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:17:28,094 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 08:17:28,161 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 08:17:28,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187606635] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 08:17:28,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 08:17:28,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-24 08:17:28,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011864240] [2023-08-24 08:17:28,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 08:17:28,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-24 08:17:28,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:17:28,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-24 08:17:28,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-08-24 08:17:28,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 455 [2023-08-24 08:17:28,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 85 transitions, 362 flow. Second operand has 12 states, 12 states have (on average 206.66666666666666) internal successors, (2480), 12 states have internal predecessors, (2480), 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 08:17:28,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:17:28,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 455 [2023-08-24 08:17:28,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:17:31,167 INFO L124 PetriNetUnfolderBase]: 28494/38679 cut-off events. [2023-08-24 08:17:31,167 INFO L125 PetriNetUnfolderBase]: For 63978/63978 co-relation queries the response was YES. [2023-08-24 08:17:31,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122051 conditions, 38679 events. 28494/38679 cut-off events. For 63978/63978 co-relation queries the response was YES. Maximal size of possible extension queue 1081. Compared 210950 event pairs, 15424 based on Foata normal form. 1152/37794 useless extension candidates. Maximal degree in co-relation 122010. Up to 32675 conditions per place. [2023-08-24 08:17:31,346 INFO L140 encePairwiseOnDemand]: 447/455 looper letters, 88 selfloop transitions, 8 changer transitions 0/116 dead transitions. [2023-08-24 08:17:31,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 116 transitions, 693 flow [2023-08-24 08:17:31,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 08:17:31,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 08:17:31,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1481 transitions. [2023-08-24 08:17:31,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4649921507064364 [2023-08-24 08:17:31,349 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1481 transitions. [2023-08-24 08:17:31,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1481 transitions. [2023-08-24 08:17:31,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:17:31,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1481 transitions. [2023-08-24 08:17:31,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 211.57142857142858) internal successors, (1481), 7 states have internal predecessors, (1481), 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 08:17:31,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 455.0) internal successors, (3640), 8 states have internal predecessors, (3640), 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 08:17:31,355 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 455.0) internal successors, (3640), 8 states have internal predecessors, (3640), 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 08:17:31,355 INFO L175 Difference]: Start difference. First operand has 96 places, 85 transitions, 362 flow. Second operand 7 states and 1481 transitions. [2023-08-24 08:17:31,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 116 transitions, 693 flow [2023-08-24 08:17:31,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 116 transitions, 651 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-08-24 08:17:31,386 INFO L231 Difference]: Finished difference. Result has 92 places, 87 transitions, 370 flow [2023-08-24 08:17:31,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=370, PETRI_PLACES=92, PETRI_TRANSITIONS=87} [2023-08-24 08:17:31,386 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 17 predicate places. [2023-08-24 08:17:31,387 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 87 transitions, 370 flow [2023-08-24 08:17:31,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 206.66666666666666) internal successors, (2480), 12 states have internal predecessors, (2480), 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 08:17:31,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:17:31,387 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:17:31,405 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 08:17:31,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 08:17:31,593 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 08:17:31,593 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:17:31,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1296418912, now seen corresponding path program 1 times [2023-08-24 08:17:31,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:17:31,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609551893] [2023-08-24 08:17:31,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:17:31,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:17:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:17:31,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:17:31,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:17:31,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609551893] [2023-08-24 08:17:31,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609551893] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 08:17:31,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824974592] [2023-08-24 08:17:31,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:17:31,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 08:17:31,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 08:17:31,765 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 08:17:31,768 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 08:17:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:17:31,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-24 08:17:31,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 08:17:31,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:17:31,976 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 08:17:32,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:17:32,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824974592] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-24 08:17:32,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-24 08:17:32,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2023-08-24 08:17:32,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019702038] [2023-08-24 08:17:32,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:17:32,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 08:17:32,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:17:32,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 08:17:32,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-08-24 08:17:32,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 455 [2023-08-24 08:17:32,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 87 transitions, 370 flow. Second operand has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 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 08:17:32,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:17:32,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 455 [2023-08-24 08:17:32,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:17:34,196 INFO L124 PetriNetUnfolderBase]: 21901/29332 cut-off events. [2023-08-24 08:17:34,197 INFO L125 PetriNetUnfolderBase]: For 41930/41930 co-relation queries the response was YES. [2023-08-24 08:17:34,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92309 conditions, 29332 events. 21901/29332 cut-off events. For 41930/41930 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 148272 event pairs, 11661 based on Foata normal form. 816/28769 useless extension candidates. Maximal degree in co-relation 92269. Up to 25062 conditions per place. [2023-08-24 08:17:34,329 INFO L140 encePairwiseOnDemand]: 448/455 looper letters, 93 selfloop transitions, 7 changer transitions 0/120 dead transitions. [2023-08-24 08:17:34,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 120 transitions, 716 flow [2023-08-24 08:17:34,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 08:17:34,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 08:17:34,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1280 transitions. [2023-08-24 08:17:34,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46886446886446886 [2023-08-24 08:17:34,332 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1280 transitions. [2023-08-24 08:17:34,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1280 transitions. [2023-08-24 08:17:34,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:17:34,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1280 transitions. [2023-08-24 08:17:34,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 213.33333333333334) internal successors, (1280), 6 states have internal predecessors, (1280), 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 08:17:34,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 455.0) internal successors, (3185), 7 states have internal predecessors, (3185), 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 08:17:34,347 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 455.0) internal successors, (3185), 7 states have internal predecessors, (3185), 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 08:17:34,347 INFO L175 Difference]: Start difference. First operand has 92 places, 87 transitions, 370 flow. Second operand 6 states and 1280 transitions. [2023-08-24 08:17:34,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 120 transitions, 716 flow [2023-08-24 08:17:34,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 120 transitions, 691 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-24 08:17:34,372 INFO L231 Difference]: Finished difference. Result has 94 places, 89 transitions, 386 flow [2023-08-24 08:17:34,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=386, PETRI_PLACES=94, PETRI_TRANSITIONS=89} [2023-08-24 08:17:34,375 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 19 predicate places. [2023-08-24 08:17:34,375 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 89 transitions, 386 flow [2023-08-24 08:17:34,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 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 08:17:34,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:17:34,376 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:17:34,392 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 08:17:34,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 08:17:34,581 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 08:17:34,581 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:17:34,581 INFO L85 PathProgramCache]: Analyzing trace with hash 477685320, now seen corresponding path program 1 times [2023-08-24 08:17:34,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:17:34,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991761477] [2023-08-24 08:17:34,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:17:34,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:17:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:17:35,499 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 08:17:35,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:17:35,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991761477] [2023-08-24 08:17:35,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991761477] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 08:17:35,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742173043] [2023-08-24 08:17:35,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:17:35,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 08:17:35,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 08:17:35,517 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 08:17:35,541 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 08:17:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:17:35,682 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 62 conjunts are in the unsatisfiable core [2023-08-24 08:17:35,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 08:17:35,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 08:17:35,916 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 08:17:35,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 08:17:35,970 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 08:17:36,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 08:17:36,105 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 08:17:36,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 08:17:36,169 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 08:17:36,200 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-08-24 08:17:36,271 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 08:17:36,272 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 08:17:36,633 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_497) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_498) c_~X_0~0.base) .cse0) (+ 1 c_~s_2~0))))) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_497) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_498) c_~X_0~0.base) .cse0))))))) is different from false [2023-08-24 08:17:37,618 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= c_~s_2~0 (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_497) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_498) c_~X_0~0.base) .cse0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_497) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_498) c_~X_0~0.base) .cse0) (+ 1 c_~s_2~0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))))) is different from false [2023-08-24 08:17:38,950 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_497) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_498) c_~X_0~0.base) .cse0) (+ c_~t_4~0 1 c_~s_2~0))))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_497) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_498) c_~X_0~0.base) .cse0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))))) is different from false [2023-08-24 08:17:39,048 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int) (v_ArrVal_496 (Array Int Int))) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_497) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_498) c_~X_0~0.base) .cse0) (+ c_~t_4~0 1 c_~s_2~0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int) (v_ArrVal_496 (Array Int Int))) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_497) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_498) c_~X_0~0.base) .cse0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))))) is different from false [2023-08-24 08:17:41,148 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int) (v_ArrVal_496 (Array Int Int)) (v_ArrVal_495 (Array Int Int))) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (select (select (store (store (store (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t3~0.base| v_ArrVal_495) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_497) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_498) c_~X_0~0.base) .cse0) (+ c_~t_4~0 1 c_~s_2~0))))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int) (v_ArrVal_496 (Array Int Int)) (v_ArrVal_495 (Array Int Int))) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store (store (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t3~0.base| v_ArrVal_495) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_497) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_498) c_~X_0~0.base) .cse0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))))) is different from false [2023-08-24 08:17:41,216 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 08:17:41,217 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 922 treesize of output 630 [2023-08-24 08:17:41,232 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 306 treesize of output 290 [2023-08-24 08:17:41,238 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 290 treesize of output 258 [2023-08-24 08:17:41,249 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 123 [2023-08-24 08:17:41,259 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 122 [2023-08-24 08:17:41,664 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 08:17:41,664 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 08:17:41,664 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 08:17:41,665 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 08:17:41,810 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 08:17:41,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742173043] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 08:17:41,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 08:17:41,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 36 [2023-08-24 08:17:41,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279130699] [2023-08-24 08:17:41,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 08:17:41,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-08-24 08:17:41,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:17:41,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-08-24 08:17:41,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=907, Unknown=20, NotChecked=330, Total=1406 [2023-08-24 08:17:41,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 455 [2023-08-24 08:17:41,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 89 transitions, 386 flow. Second operand has 38 states, 38 states have (on average 169.68421052631578) internal successors, (6448), 38 states have internal predecessors, (6448), 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 08:17:41,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:17:41,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 455 [2023-08-24 08:17:41,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:17:56,928 INFO L124 PetriNetUnfolderBase]: 92447/120447 cut-off events. [2023-08-24 08:17:56,928 INFO L125 PetriNetUnfolderBase]: For 150182/150182 co-relation queries the response was YES. [2023-08-24 08:17:57,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373410 conditions, 120447 events. 92447/120447 cut-off events. For 150182/150182 co-relation queries the response was YES. Maximal size of possible extension queue 2557. Compared 674321 event pairs, 6180 based on Foata normal form. 2/115989 useless extension candidates. Maximal degree in co-relation 373369. Up to 42024 conditions per place. [2023-08-24 08:17:57,510 INFO L140 encePairwiseOnDemand]: 437/455 looper letters, 750 selfloop transitions, 142 changer transitions 30/932 dead transitions. [2023-08-24 08:17:57,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 932 transitions, 5449 flow [2023-08-24 08:17:57,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-08-24 08:17:57,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2023-08-24 08:17:57,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 6984 transitions. [2023-08-24 08:17:57,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4148500148500148 [2023-08-24 08:17:57,520 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 6984 transitions. [2023-08-24 08:17:57,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 6984 transitions. [2023-08-24 08:17:57,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:17:57,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 6984 transitions. [2023-08-24 08:17:57,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 188.75675675675674) internal successors, (6984), 37 states have internal predecessors, (6984), 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 08:17:57,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 455.0) internal successors, (17290), 38 states have internal predecessors, (17290), 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 08:17:57,544 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 455.0) internal successors, (17290), 38 states have internal predecessors, (17290), 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 08:17:57,544 INFO L175 Difference]: Start difference. First operand has 94 places, 89 transitions, 386 flow. Second operand 37 states and 6984 transitions. [2023-08-24 08:17:57,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 932 transitions, 5449 flow [2023-08-24 08:17:57,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 932 transitions, 5429 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-24 08:17:57,701 INFO L231 Difference]: Finished difference. Result has 152 places, 241 transitions, 1697 flow [2023-08-24 08:17:57,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=1697, PETRI_PLACES=152, PETRI_TRANSITIONS=241} [2023-08-24 08:17:57,701 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 77 predicate places. [2023-08-24 08:17:57,701 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 241 transitions, 1697 flow [2023-08-24 08:17:57,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 169.68421052631578) internal successors, (6448), 38 states have internal predecessors, (6448), 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 08:17:57,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:17:57,703 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:17:57,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-24 08:17:57,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 08:17:57,908 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 08:17:57,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:17:57,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1899960650, now seen corresponding path program 2 times [2023-08-24 08:17:57,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:17:57,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066723294] [2023-08-24 08:17:57,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:17:57,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:17:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:17:58,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 08:17:58,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:17:58,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066723294] [2023-08-24 08:17:58,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066723294] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 08:17:58,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941201262] [2023-08-24 08:17:58,752 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 08:17:58,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 08:17:58,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 08:17:58,754 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 08:17:58,795 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 08:17:58,916 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 08:17:58,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 08:17:58,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 61 conjunts are in the unsatisfiable core [2023-08-24 08:17:58,920 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 08:17:58,939 INFO L322 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2023-08-24 08:17:58,940 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 2 case distinctions, treesize of input 12 treesize of output 27 [2023-08-24 08:17:58,971 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 08:17:58,971 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-24 08:17:59,143 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 21 treesize of output 21 [2023-08-24 08:17:59,165 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-08-24 08:17:59,220 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 08:17:59,220 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 08:17:59,408 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((v_ArrVal_576 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_576) c_~X_0~0.base) .cse0) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_576 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_576) c_~X_0~0.base) .cse0))))) is different from false [2023-08-24 08:17:59,414 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 08:17:59,414 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 32 [2023-08-24 08:17:59,418 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-24 08:17:59,425 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 08:17:59,516 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 08:17:59,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941201262] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 08:17:59,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 08:17:59,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2023-08-24 08:17:59,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457813361] [2023-08-24 08:17:59,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 08:17:59,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-24 08:17:59,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:17:59,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-24 08:17:59,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=381, Unknown=12, NotChecked=40, Total=506 [2023-08-24 08:17:59,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 455 [2023-08-24 08:17:59,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 241 transitions, 1697 flow. Second operand has 23 states, 23 states have (on average 166.8695652173913) internal successors, (3838), 23 states have internal predecessors, (3838), 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 08:17:59,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:17:59,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 455 [2023-08-24 08:17:59,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:18:28,954 INFO L124 PetriNetUnfolderBase]: 173962/226278 cut-off events. [2023-08-24 08:18:28,954 INFO L125 PetriNetUnfolderBase]: For 1182849/1182917 co-relation queries the response was YES. [2023-08-24 08:18:30,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940873 conditions, 226278 events. 173962/226278 cut-off events. For 1182849/1182917 co-relation queries the response was YES. Maximal size of possible extension queue 4730. Compared 1344050 event pairs, 42771 based on Foata normal form. 14/217928 useless extension candidates. Maximal degree in co-relation 940822. Up to 115939 conditions per place. [2023-08-24 08:18:31,046 INFO L140 encePairwiseOnDemand]: 437/455 looper letters, 980 selfloop transitions, 265 changer transitions 24/1279 dead transitions. [2023-08-24 08:18:31,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 1279 transitions, 10703 flow [2023-08-24 08:18:31,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-08-24 08:18:31,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2023-08-24 08:18:31,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 6595 transitions. [2023-08-24 08:18:31,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40262515262515264 [2023-08-24 08:18:31,055 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 6595 transitions. [2023-08-24 08:18:31,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 6595 transitions. [2023-08-24 08:18:31,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:18:31,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 6595 transitions. [2023-08-24 08:18:31,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 183.19444444444446) internal successors, (6595), 36 states have internal predecessors, (6595), 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 08:18:31,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 455.0) internal successors, (16835), 37 states have internal predecessors, (16835), 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 08:18:31,074 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 455.0) internal successors, (16835), 37 states have internal predecessors, (16835), 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 08:18:31,074 INFO L175 Difference]: Start difference. First operand has 152 places, 241 transitions, 1697 flow. Second operand 36 states and 6595 transitions. [2023-08-24 08:18:31,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 1279 transitions, 10703 flow [2023-08-24 08:18:58,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 1279 transitions, 10449 flow, removed 106 selfloop flow, removed 3 redundant places. [2023-08-24 08:18:58,223 INFO L231 Difference]: Finished difference. Result has 212 places, 519 transitions, 4891 flow [2023-08-24 08:18:58,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=1606, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=4891, PETRI_PLACES=212, PETRI_TRANSITIONS=519} [2023-08-24 08:18:58,225 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 137 predicate places. [2023-08-24 08:18:58,225 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 519 transitions, 4891 flow [2023-08-24 08:18:58,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 166.8695652173913) internal successors, (3838), 23 states have internal predecessors, (3838), 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 08:18:58,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:18:58,230 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:18:58,235 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 08:18:58,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 08:18:58,435 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 08:18:58,435 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:18:58,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1755342518, now seen corresponding path program 3 times [2023-08-24 08:18:58,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:18:58,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782343385] [2023-08-24 08:18:58,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:18:58,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:18:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:18:59,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 08:18:59,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:18:59,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782343385] [2023-08-24 08:18:59,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782343385] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 08:18:59,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757026893] [2023-08-24 08:18:59,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 08:18:59,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 08:18:59,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 08:18:59,170 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 08:18:59,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-24 08:18:59,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 08:18:59,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 08:18:59,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 79 conjunts are in the unsatisfiable core [2023-08-24 08:18:59,345 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 08:18:59,391 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-24 08:18:59,418 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 08:18:59,463 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 08:18:59,562 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 08:18:59,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 08:18:59,676 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 08:18:59,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 08:18:59,772 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 08:18:59,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 08:18:59,823 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 08:18:59,853 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-08-24 08:18:59,928 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:18:59,928 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 08:19:00,117 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |c_thread1Thread1of1ForFork5_~#t3~0.base| v_ArrVal_658) c_~X_0~0.base) .cse0) c_~s_2~0))) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |c_thread1Thread1of1ForFork5_~#t3~0.base| v_ArrVal_658) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 1))))) is different from false [2023-08-24 08:19:00,130 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |c_thread1Thread1of1ForFork5_~#t3~0.base| v_ArrVal_658) c_~X_0~0.base) .cse0))) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |c_thread1Thread1of1ForFork5_~#t3~0.base| v_ArrVal_658) c_~X_0~0.base) .cse0) (+ c_~s_6~0 1))))) is different from false [2023-08-24 08:19:00,144 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse0) (+ c_~s_6~0 1))))) (forall ((|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse0))) (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|))))) is different from false [2023-08-24 08:19:05,545 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~X_0~0.offset 4)) (.cse1 (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (and (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_655))) (<= (+ c_~s_6~0 (select (select .cse0 c_~X_0~0.base) .cse1)) (select (select (store (store (store .cse0 |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse2)))) (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|))) (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_655))) (< (select (select (store (store (store .cse3 |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse2) (+ c_~s_6~0 (select (select .cse3 c_~X_0~0.base) .cse1) 1)))))))) is different from false [2023-08-24 08:19:05,621 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_35| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_35| |c_#StackHeapBarrier|) (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_655))) (<= (select (select .cse0 c_~X_0~0.base) .cse1) (select (select (store (store (store .cse0 |v_thread4Thread1of1ForFork0_~#t6~0.base_35| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse1)))))))) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_35| Int)) (or (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_655))) (< (select (select (store (store (store .cse2 |v_thread4Thread1of1ForFork0_~#t6~0.base_35| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse1) (+ (select (select .cse2 c_~X_0~0.base) .cse1) 1)))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_35| |c_#StackHeapBarrier|))))) is different from false [2023-08-24 08:19:07,679 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_40| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_40| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_35| Int)) (or (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_40| v_ArrVal_655))) (< (select (select (store (store (store .cse0 |v_thread4Thread1of1ForFork0_~#t6~0.base_35| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse1) (+ (select (select .cse0 c_~X_0~0.base) .cse1) 1)))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_35| |c_#StackHeapBarrier|))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_40| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_35| Int)) (or (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_40| v_ArrVal_655))) (<= (select (select .cse2 c_~X_0~0.base) .cse1) (select (select (store (store (store .cse2 |v_thread4Thread1of1ForFork0_~#t6~0.base_35| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse1)))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_35| |c_#StackHeapBarrier|))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_40| |c_#StackHeapBarrier|))))) is different from false [2023-08-24 08:19:07,747 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_40| Int) (v_ArrVal_654 (Array Int Int))) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_35| Int)) (or (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_654) |v_thread4Thread1of1ForFork0_~#t5~0.base_40| v_ArrVal_655))) (< (select (select (store (store (store .cse0 |v_thread4Thread1of1ForFork0_~#t6~0.base_35| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse1) (+ (select (select .cse0 c_~X_0~0.base) .cse1) 1)))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_35| |c_#StackHeapBarrier|))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_40| |c_#StackHeapBarrier|))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_40| Int) (v_ArrVal_654 (Array Int Int))) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_35| Int)) (or (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_654) |v_thread4Thread1of1ForFork0_~#t5~0.base_40| v_ArrVal_655))) (<= (select (select .cse2 c_~X_0~0.base) .cse1) (select (select (store (store (store .cse2 |v_thread4Thread1of1ForFork0_~#t6~0.base_35| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse1)))) (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_35| |c_#StackHeapBarrier|))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_40| |c_#StackHeapBarrier|))))) is different from false [2023-08-24 08:19:19,607 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 08:19:19,607 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 55 [2023-08-24 08:19:19,696 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 692092918 treesize of output 664567798 [2023-08-24 08:19:20,360 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 563 treesize of output 535 [2023-08-24 08:19:20,379 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1126 treesize of output 1062 [2023-08-24 08:19:20,397 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1062 treesize of output 1030 [2023-08-24 08:19:20,412 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1030 treesize of output 902 [2023-08-24 08:19:20,430 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 423 treesize of output 367 [2023-08-24 08:19:20,448 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 478 treesize of output 366 [2023-08-24 08:19:21,022 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-24 08:19:21,031 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-24 08:19:21,031 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 1 [2023-08-24 08:19:21,103 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:19:21,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757026893] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 08:19:21,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 08:19:21,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 18] total 44 [2023-08-24 08:19:21,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528177633] [2023-08-24 08:19:21,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 08:19:21,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-08-24 08:19:21,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:19:21,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-08-24 08:19:21,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1302, Unknown=49, NotChecked=560, Total=2070 [2023-08-24 08:19:21,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 455 [2023-08-24 08:19:21,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 519 transitions, 4891 flow. Second operand has 46 states, 46 states have (on average 156.17391304347825) internal successors, (7184), 46 states have internal predecessors, (7184), 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 08:19:21,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:19:21,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 455 [2023-08-24 08:19:21,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:19:41,651 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_35| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_35| |c_#StackHeapBarrier|) (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_655))) (<= (select (select .cse0 c_~X_0~0.base) .cse1) (select (select (store (store (store .cse0 |v_thread4Thread1of1ForFork0_~#t6~0.base_35| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse1)))))))) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_thread4Thread1of1ForFork0_~#t5~0.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (not (= c_~X_0~0.base |c_thread1Thread1of1ForFork5_~#t2~0.base|)) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_35| Int)) (or (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_655))) (< (select (select (store (store (store .cse2 |v_thread4Thread1of1ForFork0_~#t6~0.base_35| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse1) (+ (select (select .cse2 c_~X_0~0.base) .cse1) 1)))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_35| |c_#StackHeapBarrier|))) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< c_~X_0~0.base |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork5_~#t2~0.base|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= c_~X_0~0.offset 0))) is different from false [2023-08-24 08:19:43,139 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_35| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_35| |c_#StackHeapBarrier|) (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_655))) (<= (select (select .cse0 c_~X_0~0.base) .cse1) (select (select (store (store (store .cse0 |v_thread4Thread1of1ForFork0_~#t6~0.base_35| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse1)))))))) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_thread4Thread1of1ForFork0_~#t5~0.base|) (not (= c_~X_0~0.base |c_thread1Thread1of1ForFork5_~#t2~0.base|)) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_35| Int)) (or (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_655))) (< (select (select (store (store (store .cse2 |v_thread4Thread1of1ForFork0_~#t6~0.base_35| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse1) (+ (select (select .cse2 c_~X_0~0.base) .cse1) 1)))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_35| |c_#StackHeapBarrier|))) (< c_~X_0~0.base |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork5_~#t2~0.base|) (= c_~X_0~0.offset 0))) is different from false