/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -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-SemanticLbe.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:17:44,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:17:44,373 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-SemanticLbe.epf [2023-11-17 11:17:44,395 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:17:44,395 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:17:44,396 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:17:44,396 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:17:44,397 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:17:44,397 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:17:44,397 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:17:44,398 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:17:44,398 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:17:44,398 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:17:44,399 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:17:44,399 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:17:44,399 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:17:44,400 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:17:44,400 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:17:44,400 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:17:44,401 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:17:44,401 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:17:44,401 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:17:44,402 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:17:44,402 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:17:44,402 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:17:44,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:17:44,403 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:17:44,403 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:17:44,404 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:17:44,404 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:17:44,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:17:44,405 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:17:44,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 11:17:44,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:17:44,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:17:44,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:17:44,670 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:17:44,670 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:17:44,671 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2023-11-17 11:17:45,933 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:17:46,156 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:17:46,157 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2023-11-17 11:17:46,176 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a4a77a22/9baf3a18f3424144837809be05cdf226/FLAGc447c9417 [2023-11-17 11:17:46,189 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a4a77a22/9baf3a18f3424144837809be05cdf226 [2023-11-17 11:17:46,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:17:46,192 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:17:46,193 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:17:46,193 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:17:46,197 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:17:46,198 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:17:46" (1/1) ... [2023-11-17 11:17:46,200 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9ca1482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:17:46, skipping insertion in model container [2023-11-17 11:17:46,200 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:17:46" (1/1) ... [2023-11-17 11:17:46,254 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:17:46,399 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-17 11:17:46,524 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i[30873,30886] [2023-11-17 11:17:46,531 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:17:46,541 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:17:46,565 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-17 11:17:46,585 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i[30873,30886] [2023-11-17 11:17:46,587 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:17:46,614 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:17:46,614 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:17:46,614 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:17:46,621 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:17:46,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:17:46 WrapperNode [2023-11-17 11:17:46,623 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:17:46,624 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:17:46,624 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:17:46,625 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:17:46,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:17:46" (1/1) ... [2023-11-17 11:17:46,659 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:17:46" (1/1) ... [2023-11-17 11:17:46,680 INFO L138 Inliner]: procedures = 171, calls = 29, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2023-11-17 11:17:46,680 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:17:46,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:17:46,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:17:46,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:17:46,688 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:17:46" (1/1) ... [2023-11-17 11:17:46,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:17:46" (1/1) ... [2023-11-17 11:17:46,691 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:17:46" (1/1) ... [2023-11-17 11:17:46,691 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:17:46" (1/1) ... [2023-11-17 11:17:46,695 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:17:46" (1/1) ... [2023-11-17 11:17:46,701 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:17:46" (1/1) ... [2023-11-17 11:17:46,714 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:17:46" (1/1) ... [2023-11-17 11:17:46,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:17:46" (1/1) ... [2023-11-17 11:17:46,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:17:46,718 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:17:46,718 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:17:46,718 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:17:46,719 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:17:46" (1/1) ... [2023-11-17 11:17:46,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:17:46,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:17:46,751 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-11-17 11:17:46,777 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-11-17 11:17:46,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 11:17:46,787 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-17 11:17:46,787 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-17 11:17:46,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:17:46,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 11:17:46,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:17:46,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:17:46,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:17:46,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:17:46,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 11:17:46,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:17:46,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:17:46,790 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 11:17:46,936 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:17:46,945 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:17:47,095 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:17:47,243 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:17:47,244 INFO L307 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-17 11:17:47,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:17:47 BoogieIcfgContainer [2023-11-17 11:17:47,245 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:17:47,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:17:47,247 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:17:47,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:17:47,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:17:46" (1/3) ... [2023-11-17 11:17:47,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f01cab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:17:47, skipping insertion in model container [2023-11-17 11:17:47,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:17:46" (2/3) ... [2023-11-17 11:17:47,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f01cab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:17:47, skipping insertion in model container [2023-11-17 11:17:47,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:17:47" (3/3) ... [2023-11-17 11:17:47,253 INFO L112 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2023-11-17 11:17:47,272 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:17:47,272 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 11:17:47,273 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:17:47,331 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:17:47,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 19 transitions, 42 flow [2023-11-17 11:17:47,399 INFO L124 PetriNetUnfolderBase]: 3/21 cut-off events. [2023-11-17 11:17:47,400 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:17:47,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 21 events. 3/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 42 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 16. Up to 2 conditions per place. [2023-11-17 11:17:47,403 INFO L82 GeneralOperation]: Start removeDead. Operand has 19 places, 19 transitions, 42 flow [2023-11-17 11:17:47,406 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 19 transitions, 42 flow [2023-11-17 11:17:47,409 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:17:47,422 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 19 transitions, 42 flow [2023-11-17 11:17:47,425 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 19 places, 19 transitions, 42 flow [2023-11-17 11:17:47,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 19 transitions, 42 flow [2023-11-17 11:17:47,442 INFO L124 PetriNetUnfolderBase]: 3/21 cut-off events. [2023-11-17 11:17:47,442 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:17:47,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 21 events. 3/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 42 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 16. Up to 2 conditions per place. [2023-11-17 11:17:47,447 INFO L119 LiptonReduction]: Number of co-enabled transitions 104 [2023-11-17 11:17:48,027 INFO L134 LiptonReduction]: Checked pairs total: 196 [2023-11-17 11:17:48,028 INFO L136 LiptonReduction]: Total number of compositions: 7 [2023-11-17 11:17:48,052 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:17:48,058 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=LoopHeads, 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;@165b37ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:17:48,058 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-17 11:17:48,064 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:17:48,064 INFO L124 PetriNetUnfolderBase]: 1/12 cut-off events. [2023-11-17 11:17:48,064 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:17:48,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:17:48,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-17 11:17:48,066 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 11:17:48,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:17:48,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1940293997, now seen corresponding path program 1 times [2023-11-17 11:17:48,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:17:48,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139991501] [2023-11-17 11:17:48,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:17:48,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:17:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:17:48,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:17:48,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:17:48,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139991501] [2023-11-17 11:17:48,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139991501] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:17:48,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:17:48,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:17:48,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041294488] [2023-11-17 11:17:48,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:17:48,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 11:17:48,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:17:48,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 11:17:48,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 11:17:48,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2023-11-17 11:17:48,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 15 places, 15 transitions, 34 flow. Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-11-17 11:17:48,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:17:48,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2023-11-17 11:17:48,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:17:48,341 INFO L124 PetriNetUnfolderBase]: 18/43 cut-off events. [2023-11-17 11:17:48,341 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:17:48,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 43 events. 18/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 84 event pairs, 12 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 76. Up to 42 conditions per place. [2023-11-17 11:17:48,344 INFO L140 encePairwiseOnDemand]: 24/26 looper letters, 12 selfloop transitions, 0 changer transitions 0/13 dead transitions. [2023-11-17 11:17:48,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 15 places, 13 transitions, 54 flow [2023-11-17 11:17:48,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 11:17:48,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-17 11:17:48,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 20 transitions. [2023-11-17 11:17:48,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2023-11-17 11:17:48,356 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 20 transitions. [2023-11-17 11:17:48,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 20 transitions. [2023-11-17 11:17:48,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:17:48,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 20 transitions. [2023-11-17 11:17:48,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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-11-17 11:17:48,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-11-17 11:17:48,365 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-11-17 11:17:48,366 INFO L175 Difference]: Start difference. First operand has 15 places, 15 transitions, 34 flow. Second operand 2 states and 20 transitions. [2023-11-17 11:17:48,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 15 places, 13 transitions, 54 flow [2023-11-17 11:17:48,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 15 places, 13 transitions, 54 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 11:17:48,372 INFO L231 Difference]: Finished difference. Result has 15 places, 13 transitions, 30 flow [2023-11-17 11:17:48,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=30, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=30, PETRI_PLACES=15, PETRI_TRANSITIONS=13} [2023-11-17 11:17:48,380 INFO L281 CegarLoopForPetriNet]: 15 programPoint places, 0 predicate places. [2023-11-17 11:17:48,381 INFO L495 AbstractCegarLoop]: Abstraction has has 15 places, 13 transitions, 30 flow [2023-11-17 11:17:48,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-11-17 11:17:48,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:17:48,381 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-11-17 11:17:48,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:17:48,382 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 11:17:48,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:17:48,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1940283994, now seen corresponding path program 1 times [2023-11-17 11:17:48,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:17:48,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331442620] [2023-11-17 11:17:48,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:17:48,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:17:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:17:48,420 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:17:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:17:48,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:17:48,467 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:17:48,469 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-17 11:17:48,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-11-17 11:17:48,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-11-17 11:17:48,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:17:48,472 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-17 11:17:48,475 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-17 11:17:48,476 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-17 11:17:48,503 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:17:48,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 33 transitions, 76 flow [2023-11-17 11:17:48,520 INFO L124 PetriNetUnfolderBase]: 6/38 cut-off events. [2023-11-17 11:17:48,520 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 11:17:48,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 38 events. 6/38 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 86 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 29. Up to 3 conditions per place. [2023-11-17 11:17:48,522 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 33 transitions, 76 flow [2023-11-17 11:17:48,525 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 33 transitions, 76 flow [2023-11-17 11:17:48,526 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:17:48,526 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 33 transitions, 76 flow [2023-11-17 11:17:48,526 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 33 transitions, 76 flow [2023-11-17 11:17:48,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 33 transitions, 76 flow [2023-11-17 11:17:48,540 INFO L124 PetriNetUnfolderBase]: 6/38 cut-off events. [2023-11-17 11:17:48,540 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 11:17:48,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 38 events. 6/38 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 86 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 29. Up to 3 conditions per place. [2023-11-17 11:17:48,543 INFO L119 LiptonReduction]: Number of co-enabled transitions 572 [2023-11-17 11:17:49,066 INFO L134 LiptonReduction]: Checked pairs total: 907 [2023-11-17 11:17:49,067 INFO L136 LiptonReduction]: Total number of compositions: 10 [2023-11-17 11:17:49,070 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:17:49,072 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=LoopHeads, 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;@165b37ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:17:49,072 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-17 11:17:49,075 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:17:49,075 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2023-11-17 11:17:49,075 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-17 11:17:49,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:17:49,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-17 11:17:49,076 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-17 11:17:49,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:17:49,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1170934867, now seen corresponding path program 1 times [2023-11-17 11:17:49,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:17:49,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531629513] [2023-11-17 11:17:49,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:17:49,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:17:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:17:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:17:49,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:17:49,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531629513] [2023-11-17 11:17:49,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531629513] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:17:49,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:17:49,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:17:49,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796251803] [2023-11-17 11:17:49,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:17:49,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 11:17:49,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:17:49,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 11:17:49,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 11:17:49,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 43 [2023-11-17 11:17:49,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 27 transitions, 64 flow. Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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-11-17 11:17:49,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:17:49,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 43 [2023-11-17 11:17:49,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:17:49,229 INFO L124 PetriNetUnfolderBase]: 396/617 cut-off events. [2023-11-17 11:17:49,230 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-11-17 11:17:49,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1261 conditions, 617 events. 396/617 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2054 event pairs, 294 based on Foata normal form. 0/464 useless extension candidates. Maximal degree in co-relation 852. Up to 615 conditions per place. [2023-11-17 11:17:49,236 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 23 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2023-11-17 11:17:49,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 24 transitions, 104 flow [2023-11-17 11:17:49,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 11:17:49,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-17 11:17:49,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2023-11-17 11:17:49,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4186046511627907 [2023-11-17 11:17:49,238 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 36 transitions. [2023-11-17 11:17:49,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 36 transitions. [2023-11-17 11:17:49,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:17:49,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 36 transitions. [2023-11-17 11:17:49,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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-11-17 11:17:49,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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-11-17 11:17:49,241 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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-11-17 11:17:49,241 INFO L175 Difference]: Start difference. First operand has 26 places, 27 transitions, 64 flow. Second operand 2 states and 36 transitions. [2023-11-17 11:17:49,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 24 transitions, 104 flow [2023-11-17 11:17:49,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 24 transitions, 104 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 11:17:49,243 INFO L231 Difference]: Finished difference. Result has 26 places, 24 transitions, 58 flow [2023-11-17 11:17:49,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=26, PETRI_TRANSITIONS=24} [2023-11-17 11:17:49,244 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 0 predicate places. [2023-11-17 11:17:49,244 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 24 transitions, 58 flow [2023-11-17 11:17:49,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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-11-17 11:17:49,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:17:49,245 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:17:49,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:17:49,245 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-17 11:17:49,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:17:49,245 INFO L85 PathProgramCache]: Analyzing trace with hash 13074919, now seen corresponding path program 1 times [2023-11-17 11:17:49,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:17:49,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669984380] [2023-11-17 11:17:49,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:17:49,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:17:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:17:49,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:17:49,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:17:49,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669984380] [2023-11-17 11:17:49,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669984380] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:17:49,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:17:49,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:17:49,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512772151] [2023-11-17 11:17:49,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:17:49,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:17:49,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:17:49,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:17:49,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:17:49,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 43 [2023-11-17 11:17:49,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 24 transitions, 58 flow. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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-11-17 11:17:49,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:17:49,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 43 [2023-11-17 11:17:49,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:17:50,311 INFO L124 PetriNetUnfolderBase]: 634/1004 cut-off events. [2023-11-17 11:17:50,312 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-11-17 11:17:50,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2047 conditions, 1004 events. 634/1004 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4212 event pairs, 82 based on Foata normal form. 0/774 useless extension candidates. Maximal degree in co-relation 2042. Up to 408 conditions per place. [2023-11-17 11:17:50,319 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 77 selfloop transitions, 31 changer transitions 0/109 dead transitions. [2023-11-17 11:17:50,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 109 transitions, 464 flow [2023-11-17 11:17:50,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-17 11:17:50,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-17 11:17:50,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2023-11-17 11:17:50,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3023255813953488 [2023-11-17 11:17:50,322 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 143 transitions. [2023-11-17 11:17:50,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 143 transitions. [2023-11-17 11:17:50,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:17:50,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 143 transitions. [2023-11-17 11:17:50,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 13.0) internal successors, (143), 11 states have internal predecessors, (143), 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-11-17 11:17:50,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 43.0) internal successors, (516), 12 states have internal predecessors, (516), 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-11-17 11:17:50,325 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 43.0) internal successors, (516), 12 states have internal predecessors, (516), 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-11-17 11:17:50,325 INFO L175 Difference]: Start difference. First operand has 26 places, 24 transitions, 58 flow. Second operand 11 states and 143 transitions. [2023-11-17 11:17:50,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 109 transitions, 464 flow [2023-11-17 11:17:50,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 109 transitions, 464 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 11:17:50,328 INFO L231 Difference]: Finished difference. Result has 42 places, 53 transitions, 244 flow [2023-11-17 11:17:50,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=244, PETRI_PLACES=42, PETRI_TRANSITIONS=53} [2023-11-17 11:17:50,329 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2023-11-17 11:17:50,330 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 53 transitions, 244 flow [2023-11-17 11:17:50,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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-11-17 11:17:50,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:17:50,330 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2023-11-17 11:17:50,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:17:50,330 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-17 11:17:50,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:17:50,331 INFO L85 PathProgramCache]: Analyzing trace with hash -278155743, now seen corresponding path program 1 times [2023-11-17 11:17:50,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:17:50,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774695245] [2023-11-17 11:17:50,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:17:50,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:17:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:17:50,341 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:17:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:17:50,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:17:50,350 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:17:50,350 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2023-11-17 11:17:50,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-11-17 11:17:50,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-11-17 11:17:50,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-11-17 11:17:50,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:17:50,351 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-17 11:17:50,352 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-17 11:17:50,352 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-17 11:17:50,377 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:17:50,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 47 transitions, 112 flow [2023-11-17 11:17:50,384 INFO L124 PetriNetUnfolderBase]: 9/55 cut-off events. [2023-11-17 11:17:50,384 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-17 11:17:50,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 55 events. 9/55 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 144 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. [2023-11-17 11:17:50,385 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 47 transitions, 112 flow [2023-11-17 11:17:50,385 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 47 transitions, 112 flow [2023-11-17 11:17:50,385 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:17:50,386 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 47 transitions, 112 flow [2023-11-17 11:17:50,386 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 47 transitions, 112 flow [2023-11-17 11:17:50,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 47 transitions, 112 flow [2023-11-17 11:17:50,390 INFO L124 PetriNetUnfolderBase]: 9/55 cut-off events. [2023-11-17 11:17:50,390 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-17 11:17:50,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 55 events. 9/55 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 144 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. [2023-11-17 11:17:50,392 INFO L119 LiptonReduction]: Number of co-enabled transitions 1404 [2023-11-17 11:17:50,835 INFO L134 LiptonReduction]: Checked pairs total: 2680 [2023-11-17 11:17:50,835 INFO L136 LiptonReduction]: Total number of compositions: 15 [2023-11-17 11:17:50,837 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:17:50,838 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=LoopHeads, 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;@165b37ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:17:50,838 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-17 11:17:50,839 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:17:50,840 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2023-11-17 11:17:50,840 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-17 11:17:50,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:17:50,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-17 11:17:50,840 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-17 11:17:50,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:17:50,841 INFO L85 PathProgramCache]: Analyzing trace with hash 515709408, now seen corresponding path program 1 times [2023-11-17 11:17:50,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:17:50,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258252841] [2023-11-17 11:17:50,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:17:50,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:17:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:17:50,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:17:50,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:17:50,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258252841] [2023-11-17 11:17:50,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258252841] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:17:50,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:17:50,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:17:50,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183043073] [2023-11-17 11:17:50,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:17:50,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 11:17:50,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:17:50,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 11:17:50,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 11:17:50,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 62 [2023-11-17 11:17:50,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 41 transitions, 100 flow. Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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-11-17 11:17:50,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:17:50,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 62 [2023-11-17 11:17:50,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:17:51,598 INFO L124 PetriNetUnfolderBase]: 7132/9627 cut-off events. [2023-11-17 11:17:51,598 INFO L125 PetriNetUnfolderBase]: For 605/605 co-relation queries the response was YES. [2023-11-17 11:17:51,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19576 conditions, 9627 events. 7132/9627 cut-off events. For 605/605 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 42370 event pairs, 5560 based on Foata normal form. 0/7269 useless extension candidates. Maximal degree in co-relation 1567. Up to 9592 conditions per place. [2023-11-17 11:17:51,713 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 36 selfloop transitions, 0 changer transitions 0/37 dead transitions. [2023-11-17 11:17:51,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 37 transitions, 164 flow [2023-11-17 11:17:51,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 11:17:51,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-17 11:17:51,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2023-11-17 11:17:51,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43548387096774194 [2023-11-17 11:17:51,715 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 54 transitions. [2023-11-17 11:17:51,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 54 transitions. [2023-11-17 11:17:51,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:17:51,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 54 transitions. [2023-11-17 11:17:51,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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-11-17 11:17:51,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 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-11-17 11:17:51,716 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 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-11-17 11:17:51,716 INFO L175 Difference]: Start difference. First operand has 39 places, 41 transitions, 100 flow. Second operand 2 states and 54 transitions. [2023-11-17 11:17:51,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 37 transitions, 164 flow [2023-11-17 11:17:51,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 37 transitions, 162 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-17 11:17:51,719 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 90 flow [2023-11-17 11:17:51,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=90, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2023-11-17 11:17:51,720 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 0 predicate places. [2023-11-17 11:17:51,720 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 90 flow [2023-11-17 11:17:51,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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-11-17 11:17:51,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:17:51,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:17:51,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:17:51,721 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-17 11:17:51,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:17:51,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1676441088, now seen corresponding path program 1 times [2023-11-17 11:17:51,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:17:51,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175591297] [2023-11-17 11:17:51,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:17:51,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:17:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:17:51,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:17:52,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:17:52,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175591297] [2023-11-17 11:17:52,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175591297] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:17:52,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:17:52,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 11:17:52,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530583868] [2023-11-17 11:17:52,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:17:52,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 11:17:52,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:17:52,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 11:17:52,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-17 11:17:52,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 62 [2023-11-17 11:17:52,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 90 flow. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 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-11-17 11:17:52,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:17:52,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 62 [2023-11-17 11:17:52,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:17:53,935 INFO L124 PetriNetUnfolderBase]: 13023/17544 cut-off events. [2023-11-17 11:17:53,935 INFO L125 PetriNetUnfolderBase]: For 607/607 co-relation queries the response was YES. [2023-11-17 11:17:53,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35511 conditions, 17544 events. 13023/17544 cut-off events. For 607/607 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 88735 event pairs, 1145 based on Foata normal form. 0/13059 useless extension candidates. Maximal degree in co-relation 35505. Up to 5241 conditions per place. [2023-11-17 11:17:54,066 INFO L140 encePairwiseOnDemand]: 46/62 looper letters, 269 selfloop transitions, 60 changer transitions 0/330 dead transitions. [2023-11-17 11:17:54,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 330 transitions, 1414 flow [2023-11-17 11:17:54,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 11:17:54,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-17 11:17:54,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 383 transitions. [2023-11-17 11:17:54,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47518610421836227 [2023-11-17 11:17:54,069 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 383 transitions. [2023-11-17 11:17:54,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 383 transitions. [2023-11-17 11:17:54,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:17:54,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 383 transitions. [2023-11-17 11:17:54,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 29.46153846153846) internal successors, (383), 13 states have internal predecessors, (383), 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-11-17 11:17:54,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 62.0) internal successors, (868), 14 states have internal predecessors, (868), 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-11-17 11:17:54,074 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 62.0) internal successors, (868), 14 states have internal predecessors, (868), 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-11-17 11:17:54,074 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 90 flow. Second operand 13 states and 383 transitions. [2023-11-17 11:17:54,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 330 transitions, 1414 flow [2023-11-17 11:17:54,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 330 transitions, 1414 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 11:17:54,080 INFO L231 Difference]: Finished difference. Result has 60 places, 100 transitions, 531 flow [2023-11-17 11:17:54,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=531, PETRI_PLACES=60, PETRI_TRANSITIONS=100} [2023-11-17 11:17:54,081 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 21 predicate places. [2023-11-17 11:17:54,081 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 100 transitions, 531 flow [2023-11-17 11:17:54,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 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-11-17 11:17:54,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:17:54,081 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:17:54,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 11:17:54,082 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-17 11:17:54,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:17:54,083 INFO L85 PathProgramCache]: Analyzing trace with hash 614433760, now seen corresponding path program 1 times [2023-11-17 11:17:54,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:17:54,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359446085] [2023-11-17 11:17:54,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:17:54,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:17:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:17:54,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:17:54,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:17:54,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359446085] [2023-11-17 11:17:54,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359446085] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:17:54,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830363913] [2023-11-17 11:17:54,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:17:54,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:17:54,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:17:54,626 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-11-17 11:17:54,648 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-11-17 11:17:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:17:54,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-17 11:17:54,749 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:17:54,813 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-17 11:17:54,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-17 11:17:54,834 INFO L378 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 11 [2023-11-17 11:17:54,885 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-17 11:17:54,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-17 11:17:54,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2023-11-17 11:17:55,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-11-17 11:17:55,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:17:55,084 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:17:55,144 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_92 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_92))) (or (< (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296) (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse0 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)))) is different from false [2023-11-17 11:17:55,216 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:17:55,218 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2023-11-17 11:17:55,244 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#value~0.base|)) (.cse1 (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296))) (let ((.cse2 (= (mod (select .cse5 |c_~#value~0.offset|) 4294967296) .cse1))) (and (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_92 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse0 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_92))) (or (= (mod (select (select .cse0 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse1 (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) .cse2) (or (forall ((v_ArrVal_92 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse3 (store (let ((.cse4 (store |c_#memory_int| |c_~#value~0.base| (store .cse5 |c_~#value~0.offset| |c_thr1Thread1of3ForFork0_~vn~0#1|)))) (store .cse4 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select .cse4 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_92))) (or (< .cse1 (mod (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse3 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)))) (not .cse2))))) is different from false [2023-11-17 11:17:55,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-17 11:17:55,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830363913] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:17:55,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:17:55,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 18 [2023-11-17 11:17:55,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306305545] [2023-11-17 11:17:55,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:17:55,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-17 11:17:55,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:17:55,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-17 11:17:55,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=229, Unknown=6, NotChecked=66, Total=380 [2023-11-17 11:17:55,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 62 [2023-11-17 11:17:55,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 100 transitions, 531 flow. Second operand has 20 states, 20 states have (on average 5.3) internal successors, (106), 20 states have internal predecessors, (106), 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-11-17 11:17:55,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:17:55,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 62 [2023-11-17 11:17:55,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:18:00,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 11:18:02,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 11:18:05,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 11:18:05,839 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse11 (select .cse10 |c_~#value~0.offset|))) (let ((.cse5 (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296)) (.cse2 (mod .cse11 4294967296))) (let ((.cse3 (store |c_#memory_int| |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| (+ 1 .cse11)))) (.cse0 (= .cse2 4294967295)) (.cse6 (= .cse2 .cse5))) (and (or .cse0 (forall ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_153| Int) (v_ArrVal_92 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse1 (store (store .cse3 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_153| (store (select .cse3 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_153|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_92))) (or (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_153|) 0)) (= (mod (select (select .cse1 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_153|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse2 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_92 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse4 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_92))) (or (= (mod (select (select .cse4 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse5 (mod (select (select .cse4 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) .cse6) (or (forall ((v_ArrVal_92 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse7 (store (store .cse3 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select .cse3 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_92))) (or (= (mod (select (select .cse7 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse2 (mod (select (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) .cse0) (or (forall ((v_ArrVal_92 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse8 (store (let ((.cse9 (store |c_#memory_int| |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| |c_thr1Thread1of3ForFork0_~vn~0#1|)))) (store .cse9 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select .cse9 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_92))) (or (< .cse5 (mod (select (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse8 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)))) (not .cse6))))))) is different from false [2023-11-17 11:18:10,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 11:18:12,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 11:18:17,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 11:18:20,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 11:18:22,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 11:18:27,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 11:18:30,404 INFO L124 PetriNetUnfolderBase]: 35219/48374 cut-off events. [2023-11-17 11:18:30,404 INFO L125 PetriNetUnfolderBase]: For 110347/110347 co-relation queries the response was YES. [2023-11-17 11:18:30,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161147 conditions, 48374 events. 35219/48374 cut-off events. For 110347/110347 co-relation queries the response was YES. Maximal size of possible extension queue 2007. Compared 293378 event pairs, 1140 based on Foata normal form. 506/41292 useless extension candidates. Maximal degree in co-relation 161131. Up to 21256 conditions per place. [2023-11-17 11:18:30,978 INFO L140 encePairwiseOnDemand]: 27/62 looper letters, 471 selfloop transitions, 362 changer transitions 0/834 dead transitions. [2023-11-17 11:18:30,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 834 transitions, 5984 flow [2023-11-17 11:18:30,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-17 11:18:30,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-11-17 11:18:30,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 755 transitions. [2023-11-17 11:18:30,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41991101223581756 [2023-11-17 11:18:30,984 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 755 transitions. [2023-11-17 11:18:30,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 755 transitions. [2023-11-17 11:18:30,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:18:30,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 755 transitions. [2023-11-17 11:18:30,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 26.03448275862069) internal successors, (755), 29 states have internal predecessors, (755), 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-11-17 11:18:30,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 62.0) internal successors, (1860), 30 states have internal predecessors, (1860), 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-11-17 11:18:30,992 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 62.0) internal successors, (1860), 30 states have internal predecessors, (1860), 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-11-17 11:18:30,992 INFO L175 Difference]: Start difference. First operand has 60 places, 100 transitions, 531 flow. Second operand 29 states and 755 transitions. [2023-11-17 11:18:30,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 834 transitions, 5984 flow [2023-11-17 11:18:31,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 834 transitions, 5984 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 11:18:31,283 INFO L231 Difference]: Finished difference. Result has 103 places, 487 transitions, 4598 flow [2023-11-17 11:18:31,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=4598, PETRI_PLACES=103, PETRI_TRANSITIONS=487} [2023-11-17 11:18:31,285 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 64 predicate places. [2023-11-17 11:18:31,285 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 487 transitions, 4598 flow [2023-11-17 11:18:31,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.3) internal successors, (106), 20 states have internal predecessors, (106), 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-11-17 11:18:31,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:18:31,286 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:18:31,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-17 11:18:31,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:18:31,492 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-17 11:18:31,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:18:31,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1046722228, now seen corresponding path program 1 times [2023-11-17 11:18:31,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:18:31,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328827703] [2023-11-17 11:18:31,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:18:31,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:18:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:18:31,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 11:18:31,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:18:31,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328827703] [2023-11-17 11:18:31,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328827703] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:18:31,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551928086] [2023-11-17 11:18:31,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:18:31,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:18:31,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:18:31,843 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-11-17 11:18:31,845 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-11-17 11:18:31,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:18:31,931 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-17 11:18:31,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:18:31,946 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 11:18:31,947 INFO L378 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-11-17 11:18:31,974 INFO L378 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 11 [2023-11-17 11:18:32,005 INFO L378 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 11 [2023-11-17 11:18:32,107 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-17 11:18:32,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 18 [2023-11-17 11:18:32,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 11:18:32,175 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:18:32,286 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:18:32,287 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2023-11-17 11:18:32,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 11:18:32,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551928086] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:18:32,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:18:32,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2023-11-17 11:18:32,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686451364] [2023-11-17 11:18:32,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:18:32,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-17 11:18:32,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:18:32,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-17 11:18:32,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=281, Unknown=1, NotChecked=0, Total=342 [2023-11-17 11:18:32,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 62 [2023-11-17 11:18:32,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 487 transitions, 4598 flow. Second operand has 19 states, 19 states have (on average 5.684210526315789) internal successors, (108), 19 states have internal predecessors, (108), 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-11-17 11:18:32,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:18:32,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 62 [2023-11-17 11:18:32,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:18:40,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 11:18:43,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 11:18:49,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 11:19:03,593 INFO L124 PetriNetUnfolderBase]: 69182/94683 cut-off events. [2023-11-17 11:19:03,594 INFO L125 PetriNetUnfolderBase]: For 571619/571619 co-relation queries the response was YES. [2023-11-17 11:19:04,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588008 conditions, 94683 events. 69182/94683 cut-off events. For 571619/571619 co-relation queries the response was YES. Maximal size of possible extension queue 4167. Compared 621637 event pairs, 4522 based on Foata normal form. 0/78883 useless extension candidates. Maximal degree in co-relation 587976. Up to 47875 conditions per place. [2023-11-17 11:19:04,944 INFO L140 encePairwiseOnDemand]: 44/62 looper letters, 1974 selfloop transitions, 1271 changer transitions 0/3246 dead transitions. [2023-11-17 11:19:04,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 3246 transitions, 37016 flow [2023-11-17 11:19:04,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-17 11:19:04,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2023-11-17 11:19:04,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 1162 transitions. [2023-11-17 11:19:04,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42595307917888564 [2023-11-17 11:19:04,950 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 1162 transitions. [2023-11-17 11:19:04,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 1162 transitions. [2023-11-17 11:19:04,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:19:04,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 1162 transitions. [2023-11-17 11:19:04,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 26.40909090909091) internal successors, (1162), 44 states have internal predecessors, (1162), 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-11-17 11:19:04,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 62.0) internal successors, (2790), 45 states have internal predecessors, (2790), 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-11-17 11:19:04,959 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 62.0) internal successors, (2790), 45 states have internal predecessors, (2790), 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-11-17 11:19:04,959 INFO L175 Difference]: Start difference. First operand has 103 places, 487 transitions, 4598 flow. Second operand 44 states and 1162 transitions. [2023-11-17 11:19:04,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 3246 transitions, 37016 flow [2023-11-17 11:19:10,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 3246 transitions, 33748 flow, removed 1634 selfloop flow, removed 0 redundant places. [2023-11-17 11:19:10,888 INFO L231 Difference]: Finished difference. Result has 181 places, 1726 transitions, 20691 flow [2023-11-17 11:19:10,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=3851, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=222, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=20691, PETRI_PLACES=181, PETRI_TRANSITIONS=1726} [2023-11-17 11:19:10,889 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 142 predicate places. [2023-11-17 11:19:10,889 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 1726 transitions, 20691 flow [2023-11-17 11:19:10,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.684210526315789) internal successors, (108), 19 states have internal predecessors, (108), 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-11-17 11:19:10,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:19:10,890 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2023-11-17 11:19:10,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-17 11:19:11,096 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,SelfDestructingSolverStorable8 [2023-11-17 11:19:11,097 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-17 11:19:11,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:19:11,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1296813497, now seen corresponding path program 1 times [2023-11-17 11:19:11,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:19:11,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166529229] [2023-11-17 11:19:11,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:19:11,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:19:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:19:11,107 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:19:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:19:11,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:19:11,116 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:19:11,117 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-11-17 11:19:11,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-17 11:19:11,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-11-17 11:19:11,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-11-17 11:19:11,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-17 11:19:11,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 11:19:11,117 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-17 11:19:11,118 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-17 11:19:11,118 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-17 11:19:11,150 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:19:11,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 61 transitions, 150 flow [2023-11-17 11:19:11,164 INFO L124 PetriNetUnfolderBase]: 12/72 cut-off events. [2023-11-17 11:19:11,164 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-17 11:19:11,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 72 events. 12/72 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 196 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 67. Up to 5 conditions per place. [2023-11-17 11:19:11,165 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 61 transitions, 150 flow [2023-11-17 11:19:11,166 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 61 transitions, 150 flow [2023-11-17 11:19:11,166 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:19:11,166 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 61 transitions, 150 flow [2023-11-17 11:19:11,167 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 61 transitions, 150 flow [2023-11-17 11:19:11,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 61 transitions, 150 flow [2023-11-17 11:19:11,175 INFO L124 PetriNetUnfolderBase]: 12/72 cut-off events. [2023-11-17 11:19:11,175 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-17 11:19:11,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 72 events. 12/72 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 196 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 67. Up to 5 conditions per place. [2023-11-17 11:19:11,177 INFO L119 LiptonReduction]: Number of co-enabled transitions 2600 [2023-11-17 11:19:11,849 INFO L134 LiptonReduction]: Checked pairs total: 4387 [2023-11-17 11:19:11,850 INFO L136 LiptonReduction]: Total number of compositions: 20 [2023-11-17 11:19:11,851 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:19:11,852 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=LoopHeads, 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;@165b37ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:19:11,852 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-17 11:19:11,853 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:19:11,853 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2023-11-17 11:19:11,853 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-17 11:19:11,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:19:11,854 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-17 11:19:11,854 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-17 11:19:11,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:19:11,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1530515040, now seen corresponding path program 1 times [2023-11-17 11:19:11,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:19:11,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458737190] [2023-11-17 11:19:11,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:19:11,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:19:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:19:11,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:19:11,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:19:11,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458737190] [2023-11-17 11:19:11,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458737190] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:19:11,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:19:11,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:19:11,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464976415] [2023-11-17 11:19:11,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:19:11,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 11:19:11,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:19:11,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 11:19:11,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 11:19:11,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 81 [2023-11-17 11:19:11,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 51 transitions, 130 flow. Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-11-17 11:19:11,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:19:11,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 81 [2023-11-17 11:19:11,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:19:17,264 INFO L124 PetriNetUnfolderBase]: 71446/89457 cut-off events. [2023-11-17 11:19:17,264 INFO L125 PetriNetUnfolderBase]: For 8291/8291 co-relation queries the response was YES. [2023-11-17 11:19:17,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182270 conditions, 89457 events. 71446/89457 cut-off events. For 8291/8291 co-relation queries the response was YES. Maximal size of possible extension queue 1909. Compared 420952 event pairs, 55294 based on Foata normal form. 0/65229 useless extension candidates. Maximal degree in co-relation 17645. Up to 89215 conditions per place. [2023-11-17 11:19:17,821 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 45 selfloop transitions, 0 changer transitions 0/46 dead transitions. [2023-11-17 11:19:17,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 210 flow [2023-11-17 11:19:17,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 11:19:17,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-17 11:19:17,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2023-11-17 11:19:17,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41975308641975306 [2023-11-17 11:19:17,824 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 68 transitions. [2023-11-17 11:19:17,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 68 transitions. [2023-11-17 11:19:17,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:19:17,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 68 transitions. [2023-11-17 11:19:17,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 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-11-17 11:19:17,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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-11-17 11:19:17,829 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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-11-17 11:19:17,829 INFO L175 Difference]: Start difference. First operand has 48 places, 51 transitions, 130 flow. Second operand 2 states and 68 transitions. [2023-11-17 11:19:17,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 210 flow [2023-11-17 11:19:17,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 204 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-11-17 11:19:17,832 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 114 flow [2023-11-17 11:19:17,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=114, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2023-11-17 11:19:17,834 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2023-11-17 11:19:17,835 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 114 flow [2023-11-17 11:19:17,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-11-17 11:19:17,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:19:17,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:19:17,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 11:19:17,835 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-17 11:19:17,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:19:17,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1945225925, now seen corresponding path program 1 times [2023-11-17 11:19:17,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:19:17,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244340350] [2023-11-17 11:19:17,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:19:17,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:19:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:19:18,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:19:18,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:19:18,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244340350] [2023-11-17 11:19:18,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244340350] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:19:18,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:19:18,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 11:19:18,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019215243] [2023-11-17 11:19:18,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:19:18,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 11:19:18,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:19:18,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 11:19:18,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-17 11:19:18,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 81 [2023-11-17 11:19:18,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 114 flow. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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-11-17 11:19:18,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:19:18,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 81 [2023-11-17 11:19:18,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:19:28,340 INFO L124 PetriNetUnfolderBase]: 135430/169439 cut-off events. [2023-11-17 11:19:28,340 INFO L125 PetriNetUnfolderBase]: For 5039/5039 co-relation queries the response was YES. [2023-11-17 11:19:28,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342748 conditions, 169439 events. 135430/169439 cut-off events. For 5039/5039 co-relation queries the response was YES. Maximal size of possible extension queue 3711. Compared 893729 event pairs, 9325 based on Foata normal form. 0/122195 useless extension candidates. Maximal degree in co-relation 342741. Up to 41817 conditions per place. [2023-11-17 11:19:29,466 INFO L140 encePairwiseOnDemand]: 62/81 looper letters, 359 selfloop transitions, 78 changer transitions 0/438 dead transitions. [2023-11-17 11:19:29,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 438 transitions, 1907 flow [2023-11-17 11:19:29,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 11:19:29,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-17 11:19:29,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 504 transitions. [2023-11-17 11:19:29,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47863247863247865 [2023-11-17 11:19:29,468 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 504 transitions. [2023-11-17 11:19:29,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 504 transitions. [2023-11-17 11:19:29,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:19:29,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 504 transitions. [2023-11-17 11:19:29,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 38.76923076923077) internal successors, (504), 13 states have internal predecessors, (504), 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-11-17 11:19:29,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 81.0) internal successors, (1134), 14 states have internal predecessors, (1134), 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-11-17 11:19:29,472 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 81.0) internal successors, (1134), 14 states have internal predecessors, (1134), 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-11-17 11:19:29,472 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 114 flow. Second operand 13 states and 504 transitions. [2023-11-17 11:19:29,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 438 transitions, 1907 flow [2023-11-17 11:19:29,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 438 transitions, 1907 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 11:19:29,483 INFO L231 Difference]: Finished difference. Result has 69 places, 127 transitions, 690 flow [2023-11-17 11:19:29,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=690, PETRI_PLACES=69, PETRI_TRANSITIONS=127} [2023-11-17 11:19:29,484 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 21 predicate places. [2023-11-17 11:19:29,484 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 127 transitions, 690 flow [2023-11-17 11:19:29,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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-11-17 11:19:29,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:19:29,485 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:19:29,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 11:19:29,485 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-17 11:19:29,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:19:29,485 INFO L85 PathProgramCache]: Analyzing trace with hash 490815487, now seen corresponding path program 1 times [2023-11-17 11:19:29,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:19:29,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441018288] [2023-11-17 11:19:29,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:19:29,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:19:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:19:29,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:19:29,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:19:29,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441018288] [2023-11-17 11:19:29,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441018288] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:19:29,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265592463] [2023-11-17 11:19:29,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:19:29,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:19:29,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:19:29,895 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-11-17 11:19:29,898 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-11-17 11:19:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:19:29,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-17 11:19:29,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:19:30,016 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-17 11:19:30,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-17 11:19:30,034 INFO L378 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 11 [2023-11-17 11:19:30,072 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-17 11:19:30,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-17 11:19:30,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2023-11-17 11:19:30,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-11-17 11:19:30,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:19:30,235 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:19:30,279 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_190 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_190))) (or (= (mod (select (select .cse0 |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) is different from false [2023-11-17 11:19:30,483 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:19:30,484 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2023-11-17 11:19:30,499 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296)) (.cse3 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse4 (= .cse0 (mod (select .cse3 |c_~#value~0.offset|) 4294967296)))) (and (or (forall ((v_ArrVal_190 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.offset| Int)) (let ((.cse1 (store (let ((.cse2 (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| |c_thr1Thread1of4ForFork0_~vn~0#1|)))) (store .cse2 |c_thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse2 |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_190))) (or (< .cse0 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse1 |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0)))) (not .cse4)) (or .cse4 (forall ((v_DerPreprocessor_3 (Array Int Int)) (v_ArrVal_190 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.offset| Int)) (let ((.cse5 (store (store |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_190))) (or (= (mod (select (select .cse5 |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse0 (mod (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))) is different from false [2023-11-17 11:19:30,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-17 11:19:30,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265592463] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:19:30,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:19:30,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 18 [2023-11-17 11:19:30,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900694254] [2023-11-17 11:19:30,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:19:30,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-17 11:19:30,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:19:30,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-17 11:19:30,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=230, Unknown=4, NotChecked=66, Total=380 [2023-11-17 11:19:30,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 81 [2023-11-17 11:19:30,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 127 transitions, 690 flow. Second operand has 20 states, 20 states have (on average 6.3) internal successors, (126), 20 states have internal predecessors, (126), 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-11-17 11:19:30,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:19:30,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 81 [2023-11-17 11:19:30,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:19:34,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 11:19:37,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 11:19:41,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 11:19:42,785 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse4 (select .cse3 |c_~#value~0.offset|))) (let ((.cse5 (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296)) (.cse0 (mod .cse4 4294967296))) (let ((.cse8 (= .cse5 .cse0))) (and (or (= .cse0 4294967295) (forall ((v_ArrVal_190 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.offset| Int)) (let ((.cse1 (store (let ((.cse2 (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| (+ 1 .cse4))))) (store .cse2 |c_thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse2 |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_190))) (or (= (mod (select (select .cse1 |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse0 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (or (forall ((v_ArrVal_190 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.offset| Int)) (let ((.cse6 (store (let ((.cse7 (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| |c_thr1Thread1of4ForFork0_~vn~0#1|)))) (store .cse7 |c_thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse7 |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_190))) (or (< .cse5 (mod (select (select .cse6 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse6 |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0)))) (not .cse8)) (or .cse8 (forall ((v_DerPreprocessor_3 (Array Int Int)) (v_ArrVal_190 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.offset| Int)) (let ((.cse9 (store (store |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_190))) (or (= (mod (select (select .cse9 |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse5 (mod (select (select .cse9 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))))) is different from false [2023-11-17 11:19:45,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 11:19:48,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-17 11:19:55,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 11:20:01,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 11:20:05,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 11:20:11,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 11:20:13,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 11:20:15,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 11:20:19,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 11:20:44,643 INFO L124 PetriNetUnfolderBase]: 302354/382159 cut-off events. [2023-11-17 11:20:44,643 INFO L125 PetriNetUnfolderBase]: For 1054444/1054444 co-relation queries the response was YES. [2023-11-17 11:20:46,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1315733 conditions, 382159 events. 302354/382159 cut-off events. For 1054444/1054444 co-relation queries the response was YES. Maximal size of possible extension queue 9611. Compared 2249223 event pairs, 10915 based on Foata normal form. 1945/330322 useless extension candidates. Maximal degree in co-relation 1315716. Up to 197853 conditions per place. [2023-11-17 11:20:48,185 INFO L140 encePairwiseOnDemand]: 38/81 looper letters, 656 selfloop transitions, 491 changer transitions 0/1148 dead transitions. [2023-11-17 11:20:48,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 1148 transitions, 8423 flow [2023-11-17 11:20:48,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-17 11:20:48,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-11-17 11:20:48,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1031 transitions. [2023-11-17 11:20:48,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4242798353909465 [2023-11-17 11:20:48,189 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 1031 transitions. [2023-11-17 11:20:48,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 1031 transitions. [2023-11-17 11:20:48,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:20:48,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 1031 transitions. [2023-11-17 11:20:48,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 34.36666666666667) internal successors, (1031), 30 states have internal predecessors, (1031), 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-11-17 11:20:48,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 81.0) internal successors, (2511), 31 states have internal predecessors, (2511), 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-11-17 11:20:48,195 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 81.0) internal successors, (2511), 31 states have internal predecessors, (2511), 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-11-17 11:20:48,196 INFO L175 Difference]: Start difference. First operand has 69 places, 127 transitions, 690 flow. Second operand 30 states and 1031 transitions. [2023-11-17 11:20:48,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 1148 transitions, 8423 flow [2023-11-17 11:20:54,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 1148 transitions, 8423 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 11:20:54,483 INFO L231 Difference]: Finished difference. Result has 111 places, 646 transitions, 6226 flow [2023-11-17 11:20:54,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=6226, PETRI_PLACES=111, PETRI_TRANSITIONS=646} [2023-11-17 11:20:54,483 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 63 predicate places. [2023-11-17 11:20:54,483 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 646 transitions, 6226 flow [2023-11-17 11:20:54,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.3) internal successors, (126), 20 states have internal predecessors, (126), 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-11-17 11:20:54,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:20:54,484 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:20:54,493 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-11-17 11:20:54,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:20:54,696 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-17 11:20:54,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:20:54,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1408811386, now seen corresponding path program 1 times [2023-11-17 11:20:54,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:20:54,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744397724] [2023-11-17 11:20:54,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:20:54,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:20:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:20:54,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 11:20:54,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:20:54,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744397724] [2023-11-17 11:20:54,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744397724] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:20:54,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898255403] [2023-11-17 11:20:54,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:20:54,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:20:54,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:20:54,998 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-11-17 11:20:55,000 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-11-17 11:20:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:20:55,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-17 11:20:55,104 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:20:55,120 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 11:20:55,121 INFO L378 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-11-17 11:20:55,158 INFO L378 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 11 [2023-11-17 11:20:55,184 INFO L378 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 11 [2023-11-17 11:20:55,278 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-17 11:20:55,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 18 [2023-11-17 11:20:55,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 11:20:55,337 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:20:55,433 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:20:55,434 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2023-11-17 11:20:55,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 11:20:55,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898255403] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:20:55,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:20:55,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2023-11-17 11:20:55,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646466721] [2023-11-17 11:20:55,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:20:55,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-17 11:20:55,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:20:55,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-17 11:20:55,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=297, Unknown=1, NotChecked=0, Total=380 [2023-11-17 11:20:55,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 81 [2023-11-17 11:20:55,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 646 transitions, 6226 flow. Second operand has 20 states, 20 states have (on average 6.65) internal successors, (133), 20 states have internal predecessors, (133), 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-11-17 11:20:55,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:20:55,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 81 [2023-11-17 11:20:55,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:21:00,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 11:21:00,710 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse7 (select .cse6 |c_~#value~0.offset|))) (let ((.cse1 (mod .cse7 4294967296)) (.cse4 (mod |c_thr1Thread2of4ForFork0_~v~0#1| 4294967296))) (let ((.cse3 (= .cse1 .cse4)) (.cse0 (= .cse1 4294967295)) (.cse2 (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| (+ 1 .cse7))))) (and (or .cse0 (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int)) (< .cse1 (mod (select (select (store .cse2 |thr1Thread2of4ForFork0_~#casret~0#1.base| (store (select .cse2 |thr1Thread2of4ForFork0_~#casret~0#1.base|) |c_thr1Thread2of4ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (or .cse3 (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_4 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_4 |c_thr1Thread2of4ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse4 (mod (select (select (store |c_#memory_int| |thr1Thread2of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_4) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (or (= |c_thr1Thread2of4ForFork0_~#casret~0#1.offset| |c_~#value~0.offset|) (not (= |c_~#value~0.base| |c_thr1Thread2of4ForFork0_~#casret~0#1.base|))) (or (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int)) (< .cse4 (mod (select (select (let ((.cse5 (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| |c_thr1Thread2of4ForFork0_~vn~0#1|)))) (store .cse5 |thr1Thread2of4ForFork0_~#casret~0#1.base| (store (select .cse5 |thr1Thread2of4ForFork0_~#casret~0#1.base|) |c_thr1Thread2of4ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse3)) (= |c_thr1Thread2of4ForFork0_~vn~0#1| 1) (= |c_thr1Thread2of4ForFork0_~v~0#1| 0) (or .cse0 (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int)) (< .cse1 (mod (select (select (store .cse2 |thr1Thread2of4ForFork0_~#casret~0#1.base| (store (select .cse2 |thr1Thread2of4ForFork0_~#casret~0#1.base|) 0 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))) is different from false [2023-11-17 11:21:03,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 11:21:05,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 11:21:08,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]