/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 -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 15:05:33,036 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:05:33,123 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 15:05:33,159 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:05:33,160 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:05:33,164 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:05:33,165 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:05:33,165 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:05:33,166 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:05:33,170 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:05:33,170 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:05:33,171 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:05:33,171 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:05:33,172 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:05:33,172 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:05:33,173 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:05:33,173 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:05:33,173 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:05:33,173 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:05:33,173 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:05:33,174 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:05:33,174 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:05:33,175 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:05:33,175 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:05:33,175 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:05:33,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:05:33,175 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:05:33,176 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:05:33,176 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:05:33,176 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:05:33,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:05:33,177 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:05:33,177 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 [2023-11-17 15:05:33,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:05:33,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:05:33,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:05:33,448 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:05:33,448 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:05:33,449 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 15:05:34,737 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:05:34,973 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:05:34,974 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2023-11-17 15:05:34,988 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/721dc6b15/0b9c3e91327249f5b0cadfa4e19ae20b/FLAGff2c1bd14 [2023-11-17 15:05:35,005 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/721dc6b15/0b9c3e91327249f5b0cadfa4e19ae20b [2023-11-17 15:05:35,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:05:35,008 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:05:35,010 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:05:35,011 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:05:35,015 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:05:35,016 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:05:35" (1/1) ... [2023-11-17 15:05:35,017 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@246454b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:35, skipping insertion in model container [2023-11-17 15:05:35,017 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:05:35" (1/1) ... [2023-11-17 15:05:35,055 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:05:35,200 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-17 15:05:35,323 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 15:05:35,333 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:05:35,344 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:05:35,358 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-17 15:05:35,378 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 15:05:35,379 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:05:35,411 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:05:35,411 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:05:35,411 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:05:35,419 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:05:35,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:35 WrapperNode [2023-11-17 15:05:35,419 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:05:35,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:05:35,421 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:05:35,421 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:05:35,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:35" (1/1) ... [2023-11-17 15:05:35,458 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:35" (1/1) ... [2023-11-17 15:05:35,483 INFO L138 Inliner]: procedures = 171, calls = 29, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2023-11-17 15:05:35,484 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:05:35,484 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:05:35,484 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:05:35,485 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:05:35,492 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:35" (1/1) ... [2023-11-17 15:05:35,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:35" (1/1) ... [2023-11-17 15:05:35,498 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:35" (1/1) ... [2023-11-17 15:05:35,499 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:35" (1/1) ... [2023-11-17 15:05:35,514 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:35" (1/1) ... [2023-11-17 15:05:35,517 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:35" (1/1) ... [2023-11-17 15:05:35,519 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:35" (1/1) ... [2023-11-17 15:05:35,520 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:35" (1/1) ... [2023-11-17 15:05:35,522 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:05:35,523 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:05:35,523 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:05:35,523 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:05:35,524 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:35" (1/1) ... [2023-11-17 15:05:35,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:05:35,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:05:35,558 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 15:05:35,588 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 15:05:35,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 15:05:35,594 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-17 15:05:35,594 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-17 15:05:35,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:05:35,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:05:35,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:05:35,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:05:35,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:05:35,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:05:35,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:05:35,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:05:35,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:05:35,597 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 15:05:35,701 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:05:35,703 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:05:35,851 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:05:35,954 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:05:35,954 INFO L307 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-17 15:05:35,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:05:35 BoogieIcfgContainer [2023-11-17 15:05:35,956 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:05:35,958 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:05:35,958 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:05:35,961 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:05:35,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:05:35" (1/3) ... [2023-11-17 15:05:35,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a2360dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:05:35, skipping insertion in model container [2023-11-17 15:05:35,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:35" (2/3) ... [2023-11-17 15:05:35,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a2360dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:05:35, skipping insertion in model container [2023-11-17 15:05:35,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:05:35" (3/3) ... [2023-11-17 15:05:35,974 INFO L112 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2023-11-17 15:05:36,001 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:05:36,001 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 15:05:36,001 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:05:36,094 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:05:36,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 51 transitions, 106 flow [2023-11-17 15:05:36,163 INFO L124 PetriNetUnfolderBase]: 5/62 cut-off events. [2023-11-17 15:05:36,163 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:05:36,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 62 events. 5/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 106 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 37. Up to 4 conditions per place. [2023-11-17 15:05:36,168 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 51 transitions, 106 flow [2023-11-17 15:05:36,171 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 51 transitions, 106 flow [2023-11-17 15:05:36,175 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:05:36,190 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 51 transitions, 106 flow [2023-11-17 15:05:36,192 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 51 transitions, 106 flow [2023-11-17 15:05:36,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 51 transitions, 106 flow [2023-11-17 15:05:36,227 INFO L124 PetriNetUnfolderBase]: 5/62 cut-off events. [2023-11-17 15:05:36,227 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:05:36,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 62 events. 5/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 106 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 37. Up to 4 conditions per place. [2023-11-17 15:05:36,230 INFO L119 LiptonReduction]: Number of co-enabled transitions 672 [2023-11-17 15:05:37,449 INFO L134 LiptonReduction]: Checked pairs total: 789 [2023-11-17 15:05:37,450 INFO L136 LiptonReduction]: Total number of compositions: 40 [2023-11-17 15:05:37,477 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:05:37,489 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;@f06a7fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:05:37,489 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-17 15:05:37,493 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:05:37,493 INFO L124 PetriNetUnfolderBase]: 1/12 cut-off events. [2023-11-17 15:05:37,493 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:05:37,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:05:37,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-17 15:05:37,495 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 15:05:37,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:05:37,499 INFO L85 PathProgramCache]: Analyzing trace with hash -314228031, now seen corresponding path program 1 times [2023-11-17 15:05:37,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:05:37,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255113225] [2023-11-17 15:05:37,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:05:37,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:05:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:05:37,656 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 15:05:37,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:05:37,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255113225] [2023-11-17 15:05:37,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255113225] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:05:37,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:05:37,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:05:37,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986120802] [2023-11-17 15:05:37,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:05:37,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 15:05:37,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:05:37,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 15:05:37,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 15:05:37,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 91 [2023-11-17 15:05:37,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 15 places, 15 transitions, 34 flow. Second operand has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 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 15:05:37,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:05:37,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 91 [2023-11-17 15:05:37,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:05:37,735 INFO L124 PetriNetUnfolderBase]: 18/42 cut-off events. [2023-11-17 15:05:37,735 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:05:37,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 42 events. 18/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 72 event pairs, 12 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 76. Up to 42 conditions per place. [2023-11-17 15:05:37,737 INFO L140 encePairwiseOnDemand]: 89/91 looper letters, 12 selfloop transitions, 0 changer transitions 0/13 dead transitions. [2023-11-17 15:05:37,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 15 places, 13 transitions, 54 flow [2023-11-17 15:05:37,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 15:05:37,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-17 15:05:37,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2023-11-17 15:05:37,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5494505494505495 [2023-11-17 15:05:37,751 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 100 transitions. [2023-11-17 15:05:37,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 100 transitions. [2023-11-17 15:05:37,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:05:37,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 100 transitions. [2023-11-17 15:05:37,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 50.0) internal successors, (100), 2 states have internal predecessors, (100), 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 15:05:37,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 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 15:05:37,766 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 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 15:05:37,768 INFO L175 Difference]: Start difference. First operand has 15 places, 15 transitions, 34 flow. Second operand 2 states and 100 transitions. [2023-11-17 15:05:37,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 15 places, 13 transitions, 54 flow [2023-11-17 15:05:37,772 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 15:05:37,773 INFO L231 Difference]: Finished difference. Result has 15 places, 13 transitions, 30 flow [2023-11-17 15:05:37,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, 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 15:05:37,779 INFO L281 CegarLoopForPetriNet]: 15 programPoint places, 0 predicate places. [2023-11-17 15:05:37,779 INFO L495 AbstractCegarLoop]: Abstraction has has 15 places, 13 transitions, 30 flow [2023-11-17 15:05:37,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 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 15:05:37,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:05:37,780 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-11-17 15:05:37,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:05:37,780 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 15:05:37,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:05:37,782 INFO L85 PathProgramCache]: Analyzing trace with hash -314250364, now seen corresponding path program 1 times [2023-11-17 15:05:37,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:05:37,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972811398] [2023-11-17 15:05:37,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:05:37,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:05:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:05:37,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:05:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:05:37,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:05:37,861 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:05:37,863 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-17 15:05:37,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-11-17 15:05:37,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-11-17 15:05:37,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:05:37,866 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-17 15:05:37,870 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-17 15:05:37,870 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-17 15:05:37,896 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:05:37,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 76 transitions, 162 flow [2023-11-17 15:05:37,914 INFO L124 PetriNetUnfolderBase]: 9/100 cut-off events. [2023-11-17 15:05:37,914 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 15:05:37,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 100 events. 9/100 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 249 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 63. Up to 6 conditions per place. [2023-11-17 15:05:37,915 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 76 transitions, 162 flow [2023-11-17 15:05:37,916 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 76 transitions, 162 flow [2023-11-17 15:05:37,916 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:05:37,917 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 76 transitions, 162 flow [2023-11-17 15:05:37,917 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 76 transitions, 162 flow [2023-11-17 15:05:37,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 76 transitions, 162 flow [2023-11-17 15:05:37,930 INFO L124 PetriNetUnfolderBase]: 9/100 cut-off events. [2023-11-17 15:05:37,931 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 15:05:37,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 100 events. 9/100 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 249 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 63. Up to 6 conditions per place. [2023-11-17 15:05:37,934 INFO L119 LiptonReduction]: Number of co-enabled transitions 2544 [2023-11-17 15:05:39,389 INFO L134 LiptonReduction]: Checked pairs total: 4181 [2023-11-17 15:05:39,390 INFO L136 LiptonReduction]: Total number of compositions: 53 [2023-11-17 15:05:39,392 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:05:39,393 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;@f06a7fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:05:39,393 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-17 15:05:39,395 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:05:39,395 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2023-11-17 15:05:39,395 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:05:39,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:05:39,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-17 15:05:39,396 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 15:05:39,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:05:39,396 INFO L85 PathProgramCache]: Analyzing trace with hash -84241623, now seen corresponding path program 1 times [2023-11-17 15:05:39,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:05:39,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924176265] [2023-11-17 15:05:39,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:05:39,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:05:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:05:39,442 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 15:05:39,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:05:39,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924176265] [2023-11-17 15:05:39,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924176265] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:05:39,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:05:39,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:05:39,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096917107] [2023-11-17 15:05:39,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:05:39,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 15:05:39,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:05:39,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 15:05:39,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 15:05:39,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 129 [2023-11-17 15:05:39,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 30 transitions, 70 flow. Second operand has 2 states, 2 states have (on average 65.0) internal successors, (130), 2 states have internal predecessors, (130), 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 15:05:39,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:05:39,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 129 [2023-11-17 15:05:39,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:05:39,568 INFO L124 PetriNetUnfolderBase]: 300/502 cut-off events. [2023-11-17 15:05:39,569 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-11-17 15:05:39,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1017 conditions, 502 events. 300/502 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2202 event pairs, 224 based on Foata normal form. 0/378 useless extension candidates. Maximal degree in co-relation 414. Up to 483 conditions per place. [2023-11-17 15:05:39,577 INFO L140 encePairwiseOnDemand]: 126/129 looper letters, 24 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2023-11-17 15:05:39,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 27 transitions, 112 flow [2023-11-17 15:05:39,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 15:05:39,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-17 15:05:39,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 151 transitions. [2023-11-17 15:05:39,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5852713178294574 [2023-11-17 15:05:39,583 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 151 transitions. [2023-11-17 15:05:39,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 151 transitions. [2023-11-17 15:05:39,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:05:39,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 151 transitions. [2023-11-17 15:05:39,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 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 15:05:39,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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 15:05:39,587 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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 15:05:39,587 INFO L175 Difference]: Start difference. First operand has 29 places, 30 transitions, 70 flow. Second operand 2 states and 151 transitions. [2023-11-17 15:05:39,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 27 transitions, 112 flow [2023-11-17 15:05:39,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 112 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 15:05:39,589 INFO L231 Difference]: Finished difference. Result has 29 places, 27 transitions, 64 flow [2023-11-17 15:05:39,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=29, PETRI_TRANSITIONS=27} [2023-11-17 15:05:39,590 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2023-11-17 15:05:39,590 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 64 flow [2023-11-17 15:05:39,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 65.0) internal successors, (130), 2 states have internal predecessors, (130), 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 15:05:39,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:05:39,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:05:39,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:05:39,591 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 15:05:39,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:05:39,592 INFO L85 PathProgramCache]: Analyzing trace with hash 649367823, now seen corresponding path program 1 times [2023-11-17 15:05:39,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:05:39,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164961120] [2023-11-17 15:05:39,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:05:39,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:05:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:05:40,142 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 15:05:40,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:05:40,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164961120] [2023-11-17 15:05:40,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164961120] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:05:40,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:05:40,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:05:40,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556924596] [2023-11-17 15:05:40,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:05:40,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:05:40,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:05:40,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:05:40,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:05:40,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 129 [2023-11-17 15:05:40,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 64 flow. Second operand has 8 states, 8 states have (on average 35.0) internal successors, (280), 8 states have internal predecessors, (280), 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 15:05:40,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:05:40,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 129 [2023-11-17 15:05:40,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:05:40,634 INFO L124 PetriNetUnfolderBase]: 530/861 cut-off events. [2023-11-17 15:05:40,634 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2023-11-17 15:05:40,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1754 conditions, 861 events. 530/861 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4397 event pairs, 49 based on Foata normal form. 0/640 useless extension candidates. Maximal degree in co-relation 1749. Up to 298 conditions per place. [2023-11-17 15:05:40,640 INFO L140 encePairwiseOnDemand]: 116/129 looper letters, 86 selfloop transitions, 39 changer transitions 0/128 dead transitions. [2023-11-17 15:05:40,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 128 transitions, 541 flow [2023-11-17 15:05:40,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 15:05:40,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-17 15:05:40,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 569 transitions. [2023-11-17 15:05:40,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3392963625521765 [2023-11-17 15:05:40,647 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 569 transitions. [2023-11-17 15:05:40,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 569 transitions. [2023-11-17 15:05:40,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:05:40,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 569 transitions. [2023-11-17 15:05:40,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 43.76923076923077) internal successors, (569), 13 states have internal predecessors, (569), 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 15:05:40,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 129.0) internal successors, (1806), 14 states have internal predecessors, (1806), 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 15:05:40,656 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 129.0) internal successors, (1806), 14 states have internal predecessors, (1806), 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 15:05:40,656 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 64 flow. Second operand 13 states and 569 transitions. [2023-11-17 15:05:40,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 128 transitions, 541 flow [2023-11-17 15:05:40,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 128 transitions, 541 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 15:05:40,661 INFO L231 Difference]: Finished difference. Result has 48 places, 67 transitions, 304 flow [2023-11-17 15:05:40,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=304, PETRI_PLACES=48, PETRI_TRANSITIONS=67} [2023-11-17 15:05:40,663 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 19 predicate places. [2023-11-17 15:05:40,663 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 67 transitions, 304 flow [2023-11-17 15:05:40,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 35.0) internal successors, (280), 8 states have internal predecessors, (280), 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 15:05:40,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:05:40,664 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-11-17 15:05:40,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:05:40,664 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 15:05:40,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:05:40,665 INFO L85 PathProgramCache]: Analyzing trace with hash -766873103, now seen corresponding path program 1 times [2023-11-17 15:05:40,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:05:40,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638678269] [2023-11-17 15:05:40,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:05:40,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:05:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:05:40,680 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:05:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:05:40,689 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:05:40,689 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:05:40,690 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2023-11-17 15:05:40,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-11-17 15:05:40,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-11-17 15:05:40,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-11-17 15:05:40,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:05:40,695 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-17 15:05:40,695 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-17 15:05:40,696 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-17 15:05:40,734 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:05:40,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 101 transitions, 220 flow [2023-11-17 15:05:40,753 INFO L124 PetriNetUnfolderBase]: 13/138 cut-off events. [2023-11-17 15:05:40,754 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-17 15:05:40,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 13/138 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 384 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 104. Up to 8 conditions per place. [2023-11-17 15:05:40,756 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 101 transitions, 220 flow [2023-11-17 15:05:40,757 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 101 transitions, 220 flow [2023-11-17 15:05:40,758 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:05:40,758 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 101 transitions, 220 flow [2023-11-17 15:05:40,759 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 101 transitions, 220 flow [2023-11-17 15:05:40,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 101 transitions, 220 flow [2023-11-17 15:05:40,779 INFO L124 PetriNetUnfolderBase]: 13/138 cut-off events. [2023-11-17 15:05:40,780 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-17 15:05:40,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 13/138 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 384 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 104. Up to 8 conditions per place. [2023-11-17 15:05:40,787 INFO L119 LiptonReduction]: Number of co-enabled transitions 5616 [2023-11-17 15:05:52,881 INFO L134 LiptonReduction]: Checked pairs total: 10347 [2023-11-17 15:05:52,882 INFO L136 LiptonReduction]: Total number of compositions: 69 [2023-11-17 15:05:52,884 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:05:52,884 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;@f06a7fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:05:52,885 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-17 15:05:52,886 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:05:52,887 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-11-17 15:05:52,887 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-17 15:05:52,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:05:52,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-17 15:05:52,887 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 15:05:52,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:05:52,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1411224629, now seen corresponding path program 1 times [2023-11-17 15:05:52,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:05:52,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868232452] [2023-11-17 15:05:52,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:05:52,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:05:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:05:52,901 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 15:05:52,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:05:52,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868232452] [2023-11-17 15:05:52,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868232452] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:05:52,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:05:52,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:05:52,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437379988] [2023-11-17 15:05:52,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:05:52,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 15:05:52,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:05:52,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 15:05:52,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 15:05:52,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 170 [2023-11-17 15:05:52,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 42 transitions, 102 flow. Second operand has 2 states, 2 states have (on average 84.0) internal successors, (168), 2 states have internal predecessors, (168), 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 15:05:52,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:05:52,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 170 [2023-11-17 15:05:52,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:05:53,543 INFO L124 PetriNetUnfolderBase]: 4512/6328 cut-off events. [2023-11-17 15:05:53,543 INFO L125 PetriNetUnfolderBase]: For 655/655 co-relation queries the response was YES. [2023-11-17 15:05:53,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12838 conditions, 6328 events. 4512/6328 cut-off events. For 655/655 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 32600 event pairs, 3464 based on Foata normal form. 0/4683 useless extension candidates. Maximal degree in co-relation 1023. Up to 6153 conditions per place. [2023-11-17 15:05:53,592 INFO L140 encePairwiseOnDemand]: 166/170 looper letters, 35 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2023-11-17 15:05:53,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 38 transitions, 164 flow [2023-11-17 15:05:53,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 15:05:53,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-17 15:05:53,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 201 transitions. [2023-11-17 15:05:53,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5911764705882353 [2023-11-17 15:05:53,594 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 201 transitions. [2023-11-17 15:05:53,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 201 transitions. [2023-11-17 15:05:53,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:05:53,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 201 transitions. [2023-11-17 15:05:53,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 100.5) internal successors, (201), 2 states have internal predecessors, (201), 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 15:05:53,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 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 15:05:53,595 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 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 15:05:53,596 INFO L175 Difference]: Start difference. First operand has 40 places, 42 transitions, 102 flow. Second operand 2 states and 201 transitions. [2023-11-17 15:05:53,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 38 transitions, 164 flow [2023-11-17 15:05:53,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 162 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-17 15:05:53,600 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 92 flow [2023-11-17 15:05:53,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=92, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2023-11-17 15:05:53,603 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-11-17 15:05:53,603 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 92 flow [2023-11-17 15:05:53,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 84.0) internal successors, (168), 2 states have internal predecessors, (168), 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 15:05:53,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:05:53,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:05:53,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:05:53,604 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 15:05:53,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:05:53,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1020317295, now seen corresponding path program 1 times [2023-11-17 15:05:53,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:05:53,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280997515] [2023-11-17 15:05:53,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:05:53,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:05:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:05:54,275 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 15:05:54,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:05:54,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280997515] [2023-11-17 15:05:54,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280997515] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:05:54,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:05:54,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:05:54,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555935550] [2023-11-17 15:05:54,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:05:54,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:05:54,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:05:54,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:05:54,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:05:54,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 170 [2023-11-17 15:05:54,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 92 flow. Second operand has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 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 15:05:54,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:05:54,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 170 [2023-11-17 15:05:54,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:05:55,749 INFO L124 PetriNetUnfolderBase]: 4973/6913 cut-off events. [2023-11-17 15:05:55,749 INFO L125 PetriNetUnfolderBase]: For 420/420 co-relation queries the response was YES. [2023-11-17 15:05:55,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14096 conditions, 6913 events. 4973/6913 cut-off events. For 420/420 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 36375 event pairs, 1060 based on Foata normal form. 0/5281 useless extension candidates. Maximal degree in co-relation 14090. Up to 6336 conditions per place. [2023-11-17 15:05:55,795 INFO L140 encePairwiseOnDemand]: 159/170 looper letters, 65 selfloop transitions, 14 changer transitions 0/82 dead transitions. [2023-11-17 15:05:55,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 82 transitions, 378 flow [2023-11-17 15:05:55,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:05:55,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:05:55,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 384 transitions. [2023-11-17 15:05:55,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3764705882352941 [2023-11-17 15:05:55,800 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 384 transitions. [2023-11-17 15:05:55,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 384 transitions. [2023-11-17 15:05:55,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:05:55,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 384 transitions. [2023-11-17 15:05:55,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 64.0) internal successors, (384), 6 states have internal predecessors, (384), 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 15:05:55,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 170.0) internal successors, (1190), 7 states have internal predecessors, (1190), 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 15:05:55,806 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 170.0) internal successors, (1190), 7 states have internal predecessors, (1190), 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 15:05:55,806 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 92 flow. Second operand 6 states and 384 transitions. [2023-11-17 15:05:55,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 82 transitions, 378 flow [2023-11-17 15:05:55,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 82 transitions, 378 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 15:05:55,813 INFO L231 Difference]: Finished difference. Result has 49 places, 51 transitions, 197 flow [2023-11-17 15:05:55,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=197, PETRI_PLACES=49, PETRI_TRANSITIONS=51} [2023-11-17 15:05:55,815 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2023-11-17 15:05:55,815 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 51 transitions, 197 flow [2023-11-17 15:05:55,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 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 15:05:55,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:05:55,816 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:05:55,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:05:55,817 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 15:05:55,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:05:55,817 INFO L85 PathProgramCache]: Analyzing trace with hash -790416027, now seen corresponding path program 1 times [2023-11-17 15:05:55,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:05:55,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256603209] [2023-11-17 15:05:55,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:05:55,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:05:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:05:56,329 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 15:05:56,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:05:56,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256603209] [2023-11-17 15:05:56,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256603209] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 15:05:56,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123448514] [2023-11-17 15:05:56,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:05:56,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 15:05:56,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:05:56,336 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 15:05:56,341 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 15:05:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:05:56,430 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-17 15:05:56,433 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 15:05:56,500 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 15:05:56,501 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 15:05:56,599 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 15:05:56,908 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-17 15:05:56,908 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 15:05:57,266 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-17 15:05:57,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2023-11-17 15:05:57,349 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 15:05:57,350 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 15:05:57,423 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_91 (Array Int Int))) (< (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_91) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) is different from false [2023-11-17 15:05:57,732 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 15:05:57,733 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2023-11-17 15:05:58,456 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 15:05:58,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123448514] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 15:05:58,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 15:05:58,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 19 [2023-11-17 15:05:58,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813447204] [2023-11-17 15:05:58,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 15:05:58,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-17 15:05:58,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:05:58,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-17 15:05:58,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=297, Unknown=15, NotChecked=36, Total=420 [2023-11-17 15:05:58,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 170 [2023-11-17 15:05:58,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 51 transitions, 197 flow. Second operand has 21 states, 21 states have (on average 50.285714285714285) internal successors, (1056), 21 states have internal predecessors, (1056), 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 15:05:58,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:05:58,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 170 [2023-11-17 15:05:58,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:06:44,970 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 15:06:48,079 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 15:06:51,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:06:57,839 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse13 (select .cse2 |c_~#value~0.offset|))) (let ((.cse4 (mod .cse13 4294967296)) (.cse0 (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296))) (let ((.cse3 (= .cse4 .cse0)) (.cse10 (= .cse4 4294967295)) (.cse11 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ 1 .cse13)))) (.cse12 (forall ((v_ArrVal_91 (Array Int Int))) (< .cse0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_91) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (and (not (= |c_~#value~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (<= |c_thr1Thread1of3ForFork0_~v~0#1| (+ (* (div |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296) 4294967296) 4294967294)) (or (forall ((|thr1Thread1of3ForFork0_~#casret~0#1.base| Int) (v_ArrVal_91 (Array Int Int))) (< .cse0 (mod (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ |c_thr1Thread1of3ForFork0_~v~0#1| 1))))) (store .cse1 |thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select .cse1 |thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_91) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse3)) (< .cse0 .cse4) (forall ((v_ArrVal_85 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.base| Int) (v_ArrVal_91 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_85))) (let ((.cse8 (select .cse7 |c_~#value~0.base|))) (let ((.cse9 (select .cse8 |c_~#value~0.offset|))) (let ((.cse5 (mod .cse9 4294967296))) (or (< .cse5 (mod (select (select (store (let ((.cse6 (store .cse8 |c_~#value~0.offset| (+ .cse9 1)))) (store (store |c_#memory_int| |c_~#value~0.base| .cse6) |thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select (store .cse7 |c_~#value~0.base| .cse6) |thr1Thread1of3ForFork0_~#casret~0#1.base|) 0 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_91) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= 4294967295 .cse5))))))) (or .cse10 (forall ((|thr1Thread1of3ForFork0_~#casret~0#1.base| Int) (v_ArrVal_91 (Array Int Int))) (< .cse4 (mod (select (select (store (store .cse11 |thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select .cse11 |thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_91) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.base| Int) (v_ArrVal_91 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_1 |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse0 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_91) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) .cse3) (not (= |c_~#value~0.base| |c_thr1Thread1of3ForFork0_~#casret~0#1.base|)) (or .cse10 (forall ((|thr1Thread1of3ForFork0_~#casret~0#1.base| Int) (v_ArrVal_91 (Array Int Int))) (< .cse4 (mod (select (select (store (store .cse11 |thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select .cse11 |thr1Thread1of3ForFork0_~#casret~0#1.base|) 0 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_91) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (or (= (mod (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) .cse12) .cse12))))) is different from false [2023-11-17 15:07:05,291 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_91 (Array Int Int))) (< (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_91) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (and (or (= (mod (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) .cse0) .cse0)) is different from false [2023-11-17 15:07:13,426 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 15:07:18,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:07:23,813 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 15:07:30,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:07:33,095 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 15:07:39,557 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 15:07:44,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:07:48,811 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 15:07:50,932 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 15:07:53,636 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 15:07:58,844 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 15:08:01,931 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 15:08:05,654 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 15:08:10,595 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 15:08:11,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:08:14,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:08:17,342 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 15:08:17,968 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse12 (select .cse2 |c_~#value~0.offset|))) (let ((.cse4 (mod .cse12 4294967296)) (.cse0 (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296))) (let ((.cse3 (= .cse4 .cse0)) (.cse10 (= .cse4 4294967295)) (.cse11 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ 1 .cse12))))) (and (or (forall ((|thr1Thread1of3ForFork0_~#casret~0#1.base| Int) (v_ArrVal_91 (Array Int Int))) (< .cse0 (mod (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ |c_thr1Thread1of3ForFork0_~v~0#1| 1))))) (store .cse1 |thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select .cse1 |thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_91) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse3)) (< .cse0 .cse4) (forall ((v_ArrVal_85 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.base| Int) (v_ArrVal_91 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_85))) (let ((.cse8 (select .cse7 |c_~#value~0.base|))) (let ((.cse9 (select .cse8 |c_~#value~0.offset|))) (let ((.cse5 (mod .cse9 4294967296))) (or (< .cse5 (mod (select (select (store (let ((.cse6 (store .cse8 |c_~#value~0.offset| (+ .cse9 1)))) (store (store |c_#memory_int| |c_~#value~0.base| .cse6) |thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select (store .cse7 |c_~#value~0.base| .cse6) |thr1Thread1of3ForFork0_~#casret~0#1.base|) 0 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_91) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= 4294967295 .cse5))))))) (or .cse10 (forall ((|thr1Thread1of3ForFork0_~#casret~0#1.base| Int) (v_ArrVal_91 (Array Int Int))) (< .cse4 (mod (select (select (store (store .cse11 |thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select .cse11 |thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_91) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.base| Int) (v_ArrVal_91 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_1 |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse0 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_91) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) .cse3) (or .cse10 (forall ((|thr1Thread1of3ForFork0_~#casret~0#1.base| Int) (v_ArrVal_91 (Array Int Int))) (< .cse4 (mod (select (select (store (store .cse11 |thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select .cse11 |thr1Thread1of3ForFork0_~#casret~0#1.base|) 0 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_91) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (or (= (mod (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (forall ((v_ArrVal_91 (Array Int Int))) (< .cse0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_91) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))) is different from false [2023-11-17 15:08:18,495 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse12 (select .cse2 |c_~#value~0.offset|))) (let ((.cse4 (mod .cse12 4294967296)) (.cse0 (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296))) (let ((.cse3 (= .cse4 .cse0)) (.cse10 (= .cse4 4294967295)) (.cse11 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ 1 .cse12))))) (and (or (forall ((|thr1Thread1of3ForFork0_~#casret~0#1.base| Int) (v_ArrVal_91 (Array Int Int))) (< .cse0 (mod (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ |c_thr1Thread1of3ForFork0_~v~0#1| 1))))) (store .cse1 |thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select .cse1 |thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_91) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse3)) (< .cse0 .cse4) (forall ((v_ArrVal_85 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.base| Int) (v_ArrVal_91 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_85))) (let ((.cse8 (select .cse7 |c_~#value~0.base|))) (let ((.cse9 (select .cse8 |c_~#value~0.offset|))) (let ((.cse5 (mod .cse9 4294967296))) (or (< .cse5 (mod (select (select (store (let ((.cse6 (store .cse8 |c_~#value~0.offset| (+ .cse9 1)))) (store (store |c_#memory_int| |c_~#value~0.base| .cse6) |thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select (store .cse7 |c_~#value~0.base| .cse6) |thr1Thread1of3ForFork0_~#casret~0#1.base|) 0 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_91) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= 4294967295 .cse5))))))) (or .cse10 (forall ((|thr1Thread1of3ForFork0_~#casret~0#1.base| Int) (v_ArrVal_91 (Array Int Int))) (< .cse4 (mod (select (select (store (store .cse11 |thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select .cse11 |thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_91) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.base| Int) (v_ArrVal_91 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_1 |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse0 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_91) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) .cse3) (or .cse10 (forall ((|thr1Thread1of3ForFork0_~#casret~0#1.base| Int) (v_ArrVal_91 (Array Int Int))) (< .cse4 (mod (select (select (store (store .cse11 |thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select .cse11 |thr1Thread1of3ForFork0_~#casret~0#1.base|) 0 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_91) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))) is different from false [2023-11-17 15:08:20,814 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 15:08:24,796 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 15:08:27,645 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 15:08:29,963 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 15:08:31,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:08:34,561 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 15:08:37,130 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 15:08:38,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:08:40,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:08:50,706 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 15:08:59,405 INFO L124 PetriNetUnfolderBase]: 20123/28764 cut-off events. [2023-11-17 15:08:59,405 INFO L125 PetriNetUnfolderBase]: For 24357/24367 co-relation queries the response was YES. [2023-11-17 15:08:59,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75803 conditions, 28764 events. 20123/28764 cut-off events. For 24357/24367 co-relation queries the response was YES. Maximal size of possible extension queue 1910. Compared 193471 event pairs, 261 based on Foata normal form. 823/25944 useless extension candidates. Maximal degree in co-relation 75792. Up to 7300 conditions per place. [2023-11-17 15:08:59,693 INFO L140 encePairwiseOnDemand]: 136/170 looper letters, 1111 selfloop transitions, 570 changer transitions 0/1684 dead transitions. [2023-11-17 15:08:59,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 1684 transitions, 8895 flow [2023-11-17 15:08:59,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-11-17 15:08:59,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2023-11-17 15:08:59,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 5630 transitions. [2023-11-17 15:08:59,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4139705882352941 [2023-11-17 15:08:59,718 INFO L72 ComplementDD]: Start complementDD. Operand 80 states and 5630 transitions. [2023-11-17 15:08:59,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 5630 transitions. [2023-11-17 15:08:59,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:08:59,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 80 states and 5630 transitions. [2023-11-17 15:08:59,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 81 states, 80 states have (on average 70.375) internal successors, (5630), 80 states have internal predecessors, (5630), 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 15:08:59,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 81 states, 81 states have (on average 170.0) internal successors, (13770), 81 states have internal predecessors, (13770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:08:59,765 INFO L81 ComplementDD]: Finished complementDD. Result has 81 states, 81 states have (on average 170.0) internal successors, (13770), 81 states have internal predecessors, (13770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:08:59,765 INFO L175 Difference]: Start difference. First operand has 49 places, 51 transitions, 197 flow. Second operand 80 states and 5630 transitions. [2023-11-17 15:08:59,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 1684 transitions, 8895 flow [2023-11-17 15:08:59,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 1684 transitions, 8895 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 15:08:59,845 INFO L231 Difference]: Finished difference. Result has 195 places, 658 transitions, 5840 flow [2023-11-17 15:08:59,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=4, PETRI_DIFFERENCE_SUBTRAHEND_STATES=80, PETRI_FLOW=5840, PETRI_PLACES=195, PETRI_TRANSITIONS=658} [2023-11-17 15:08:59,848 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 155 predicate places. [2023-11-17 15:08:59,848 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 658 transitions, 5840 flow [2023-11-17 15:08:59,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 50.285714285714285) internal successors, (1056), 21 states have internal predecessors, (1056), 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 15:08:59,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:08:59,849 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:08:59,864 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 15:09:00,057 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 15:09:00,057 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 15:09:00,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:09:00,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1475578449, now seen corresponding path program 1 times [2023-11-17 15:09:00,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:09:00,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017443044] [2023-11-17 15:09:00,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:09:00,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:09:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:09:00,537 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 15:09:00,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:09:00,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017443044] [2023-11-17 15:09:00,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017443044] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 15:09:00,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388989282] [2023-11-17 15:09:00,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:09:00,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 15:09:00,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:09:00,539 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 15:09:00,542 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 15:09:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:09:00,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-17 15:09:00,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 15:09:00,692 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-17 15:09:00,693 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 19 treesize of output 16 [2023-11-17 15:09:00,769 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 15:09:00,848 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 15:09:00,930 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 15:09:00,930 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 15:09:01,050 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 35 treesize of output 18 [2023-11-17 15:09:01,202 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 15:09:01,202 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 15:09:01,453 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 15:09:01,454 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2023-11-17 15:09:04,387 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 15:09:04,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388989282] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 15:09:04,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 15:09:04,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2023-11-17 15:09:04,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563684621] [2023-11-17 15:09:04,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 15:09:04,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-17 15:09:04,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:09:04,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-17 15:09:04,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=295, Unknown=2, NotChecked=0, Total=380 [2023-11-17 15:09:04,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 170 [2023-11-17 15:09:04,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 658 transitions, 5840 flow. Second operand has 20 states, 20 states have (on average 50.5) internal successors, (1010), 20 states have internal predecessors, (1010), 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 15:09:04,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:09:04,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 170 [2023-11-17 15:09:04,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:09:06,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:09:38,283 INFO L124 PetriNetUnfolderBase]: 43527/62892 cut-off events. [2023-11-17 15:09:38,283 INFO L125 PetriNetUnfolderBase]: For 5223573/5226485 co-relation queries the response was YES. [2023-11-17 15:09:38,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626242 conditions, 62892 events. 43527/62892 cut-off events. For 5223573/5226485 co-relation queries the response was YES. Maximal size of possible extension queue 3765. Compared 463084 event pairs, 1846 based on Foata normal form. 123/58020 useless extension candidates. Maximal degree in co-relation 626164. Up to 27620 conditions per place. [2023-11-17 15:09:39,661 INFO L140 encePairwiseOnDemand]: 147/170 looper letters, 2005 selfloop transitions, 2549 changer transitions 0/4557 dead transitions. [2023-11-17 15:09:39,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 4557 transitions, 56177 flow [2023-11-17 15:09:39,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-11-17 15:09:39,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2023-11-17 15:09:39,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 3621 transitions. [2023-11-17 15:09:39,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39444444444444443 [2023-11-17 15:09:39,669 INFO L72 ComplementDD]: Start complementDD. Operand 54 states and 3621 transitions. [2023-11-17 15:09:39,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 3621 transitions. [2023-11-17 15:09:39,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:09:39,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 54 states and 3621 transitions. [2023-11-17 15:09:39,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 55 states, 54 states have (on average 67.05555555555556) internal successors, (3621), 54 states have internal predecessors, (3621), 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 15:09:39,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 55 states, 55 states have (on average 170.0) internal successors, (9350), 55 states have internal predecessors, (9350), 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 15:09:39,691 INFO L81 ComplementDD]: Finished complementDD. Result has 55 states, 55 states have (on average 170.0) internal successors, (9350), 55 states have internal predecessors, (9350), 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 15:09:39,691 INFO L175 Difference]: Start difference. First operand has 195 places, 658 transitions, 5840 flow. Second operand 54 states and 3621 transitions. [2023-11-17 15:09:39,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 4557 transitions, 56177 flow [2023-11-17 15:10:05,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 4557 transitions, 47787 flow, removed 4171 selfloop flow, removed 5 redundant places. [2023-11-17 15:10:05,665 INFO L231 Difference]: Finished difference. Result has 285 places, 3259 transitions, 38595 flow [2023-11-17 15:10:05,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=4430, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=658, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=429, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=38595, PETRI_PLACES=285, PETRI_TRANSITIONS=3259} [2023-11-17 15:10:05,666 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 245 predicate places. [2023-11-17 15:10:05,667 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 3259 transitions, 38595 flow [2023-11-17 15:10:05,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 50.5) internal successors, (1010), 20 states have internal predecessors, (1010), 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 15:10:05,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:10:05,667 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2023-11-17 15:10:05,679 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 15:10:05,874 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 15:10:05,874 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 15:10:05,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:10:05,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1336135339, now seen corresponding path program 1 times [2023-11-17 15:10:05,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:10:05,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840402288] [2023-11-17 15:10:05,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:10:05,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:10:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:10:05,886 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:10:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:10:05,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:10:05,904 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:10:05,904 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-11-17 15:10:05,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-17 15:10:05,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-11-17 15:10:05,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-11-17 15:10:05,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-17 15:10:05,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 15:10:05,905 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-17 15:10:05,906 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-17 15:10:05,906 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-17 15:10:05,933 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:10:05,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 126 transitions, 280 flow [2023-11-17 15:10:05,958 INFO L124 PetriNetUnfolderBase]: 17/176 cut-off events. [2023-11-17 15:10:05,958 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-17 15:10:05,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 176 events. 17/176 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 518 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 146. Up to 10 conditions per place. [2023-11-17 15:10:05,959 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 126 transitions, 280 flow [2023-11-17 15:10:05,961 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 126 transitions, 280 flow [2023-11-17 15:10:05,961 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:10:05,961 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 126 transitions, 280 flow [2023-11-17 15:10:05,961 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 126 transitions, 280 flow [2023-11-17 15:10:05,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 126 transitions, 280 flow [2023-11-17 15:10:05,979 INFO L124 PetriNetUnfolderBase]: 17/176 cut-off events. [2023-11-17 15:10:05,979 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-17 15:10:05,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 176 events. 17/176 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 518 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 146. Up to 10 conditions per place. [2023-11-17 15:10:05,986 INFO L119 LiptonReduction]: Number of co-enabled transitions 9888 [2023-11-17 15:10:24,750 INFO L134 LiptonReduction]: Checked pairs total: 16621 [2023-11-17 15:10:24,750 INFO L136 LiptonReduction]: Total number of compositions: 85 [2023-11-17 15:10:24,752 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:10:24,752 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;@f06a7fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:10:24,752 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-17 15:10:24,754 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:10:24,754 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2023-11-17 15:10:24,754 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:10:24,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:10:24,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-17 15:10:24,754 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 15:10:24,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:10:24,755 INFO L85 PathProgramCache]: Analyzing trace with hash -195679101, now seen corresponding path program 1 times [2023-11-17 15:10:24,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:10:24,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441096925] [2023-11-17 15:10:24,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:10:24,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:10:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:10:24,766 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 15:10:24,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:10:24,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441096925] [2023-11-17 15:10:24,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441096925] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:10:24,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:10:24,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:10:24,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767133373] [2023-11-17 15:10:24,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:10:24,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 15:10:24,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:10:24,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 15:10:24,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 15:10:24,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 211 [2023-11-17 15:10:24,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 54 transitions, 136 flow. Second operand has 2 states, 2 states have (on average 103.0) internal successors, (206), 2 states have internal predecessors, (206), 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 15:10:24,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:10:24,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 211 [2023-11-17 15:10:24,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:10:28,666 INFO L124 PetriNetUnfolderBase]: 57000/73342 cut-off events. [2023-11-17 15:10:28,666 INFO L125 PetriNetUnfolderBase]: For 10483/10483 co-relation queries the response was YES. [2023-11-17 15:10:28,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149108 conditions, 73342 events. 57000/73342 cut-off events. For 10483/10483 co-relation queries the response was YES. Maximal size of possible extension queue 3012. Compared 408517 event pairs, 44288 based on Foata normal form. 0/53634 useless extension candidates. Maximal degree in co-relation 12924. Up to 71763 conditions per place. [2023-11-17 15:10:29,147 INFO L140 encePairwiseOnDemand]: 206/211 looper letters, 46 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2023-11-17 15:10:29,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 218 flow [2023-11-17 15:10:29,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 15:10:29,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-17 15:10:29,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 251 transitions. [2023-11-17 15:10:29,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5947867298578199 [2023-11-17 15:10:29,148 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 251 transitions. [2023-11-17 15:10:29,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 251 transitions. [2023-11-17 15:10:29,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:10:29,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 251 transitions. [2023-11-17 15:10:29,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 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 15:10:29,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 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 15:10:29,150 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 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 15:10:29,150 INFO L175 Difference]: Start difference. First operand has 51 places, 54 transitions, 136 flow. Second operand 2 states and 251 transitions. [2023-11-17 15:10:29,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 218 flow [2023-11-17 15:10:29,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 49 transitions, 212 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-11-17 15:10:29,153 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 120 flow [2023-11-17 15:10:29,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=120, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2023-11-17 15:10:29,154 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2023-11-17 15:10:29,154 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 120 flow [2023-11-17 15:10:29,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 103.0) internal successors, (206), 2 states have internal predecessors, (206), 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 15:10:29,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:10:29,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:10:29,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 15:10:29,155 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 15:10:29,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:10:29,155 INFO L85 PathProgramCache]: Analyzing trace with hash 933564640, now seen corresponding path program 1 times [2023-11-17 15:10:29,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:10:29,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390908517] [2023-11-17 15:10:29,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:10:29,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:10:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:10:29,520 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 15:10:29,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:10:29,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390908517] [2023-11-17 15:10:29,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390908517] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:10:29,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:10:29,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:10:29,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674963331] [2023-11-17 15:10:29,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:10:29,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:10:29,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:10:29,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:10:29,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:10:29,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 211 [2023-11-17 15:10:29,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 120 flow. Second operand has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 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 15:10:29,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:10:29,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 211 [2023-11-17 15:10:29,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:10:40,865 INFO L124 PetriNetUnfolderBase]: 107310/135795 cut-off events. [2023-11-17 15:10:40,866 INFO L125 PetriNetUnfolderBase]: For 5611/5611 co-relation queries the response was YES. [2023-11-17 15:10:41,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275474 conditions, 135795 events. 107310/135795 cut-off events. For 5611/5611 co-relation queries the response was YES. Maximal size of possible extension queue 5308. Compared 808352 event pairs, 7409 based on Foata normal form. 0/98419 useless extension candidates. Maximal degree in co-relation 275467. Up to 35034 conditions per place. [2023-11-17 15:10:41,562 INFO L140 encePairwiseOnDemand]: 192/211 looper letters, 371 selfloop transitions, 78 changer transitions 0/452 dead transitions. [2023-11-17 15:10:41,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 452 transitions, 1959 flow [2023-11-17 15:10:41,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 15:10:41,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-17 15:10:41,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1283 transitions. [2023-11-17 15:10:41,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46773605541378055 [2023-11-17 15:10:41,564 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1283 transitions. [2023-11-17 15:10:41,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1283 transitions. [2023-11-17 15:10:41,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:10:41,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1283 transitions. [2023-11-17 15:10:41,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 98.6923076923077) internal successors, (1283), 13 states have internal predecessors, (1283), 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 15:10:41,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 211.0) internal successors, (2954), 14 states have internal predecessors, (2954), 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 15:10:41,571 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 211.0) internal successors, (2954), 14 states have internal predecessors, (2954), 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 15:10:41,571 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 120 flow. Second operand 13 states and 1283 transitions. [2023-11-17 15:10:41,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 452 transitions, 1959 flow [2023-11-17 15:10:41,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 452 transitions, 1959 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 15:10:41,588 INFO L231 Difference]: Finished difference. Result has 72 places, 130 transitions, 696 flow [2023-11-17 15:10:41,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=696, PETRI_PLACES=72, PETRI_TRANSITIONS=130} [2023-11-17 15:10:41,588 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 21 predicate places. [2023-11-17 15:10:41,589 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 130 transitions, 696 flow [2023-11-17 15:10:41,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 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 15:10:41,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:10:41,589 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:10:41,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 15:10:41,589 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 15:10:41,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:10:41,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1727804134, now seen corresponding path program 1 times [2023-11-17 15:10:41,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:10:41,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020993245] [2023-11-17 15:10:41,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:10:41,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:10:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:10:42,325 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 15:10:42,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:10:42,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020993245] [2023-11-17 15:10:42,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020993245] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 15:10:42,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743434444] [2023-11-17 15:10:42,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:10:42,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 15:10:42,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:10:42,329 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 15:10:42,332 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 15:10:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:10:42,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-17 15:10:42,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 15:10:42,468 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-17 15:10:42,468 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 15:10:42,542 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 15:10:42,628 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-17 15:10:42,628 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 15:10:42,804 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 15:10:42,946 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 15:10:43,081 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 15:10:43,082 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 15:10:43,286 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_188 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_188))) (or (< (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse0 |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0)))) is different from false [2023-11-17 15:10:43,423 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 15:10:43,423 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2023-11-17 15:10:44,295 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 15:10:44,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743434444] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 15:10:44,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 15:10:44,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 19 [2023-11-17 15:10:44,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233000874] [2023-11-17 15:10:44,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 15:10:44,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-17 15:10:44,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:10:44,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-17 15:10:44,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=281, Unknown=14, NotChecked=36, Total=420 [2023-11-17 15:10:44,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 211 [2023-11-17 15:10:44,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 130 transitions, 696 flow. Second operand has 21 states, 21 states have (on average 65.28571428571429) internal successors, (1371), 21 states have internal predecessors, (1371), 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 15:10:44,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:10:44,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 211 [2023-11-17 15:10:44,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:10:56,877 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 15:11:00,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:11:04,176 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 15:11:10,390 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 15:11:12,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-17 15:11:13,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:11:15,626 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 15:11:17,635 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 15:11:27,939 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 15:11:30,891 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 15:11:40,540 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 15:11:42,770 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 15:11:54,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:12:17,071 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 15:12:20,242 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 15:12:22,341 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 15:12:23,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:12:30,303 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 15:12:32,314 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 15:12:34,324 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 15:12:36,337 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 15:12:39,136 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 15:12:41,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:12:43,258 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 15:12:46,100 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 15:13:12,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:13:14,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:13:17,164 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 15:13:23,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-17 15:13:25,223 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 15:13:27,768 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 15:13:30,535 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 15:13:34,422 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 15:13:37,171 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 15:13:39,184 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 15:13:50,003 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 15:13:54,372 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 15:13:56,745 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 15:13:58,991 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 15:14:06,681 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 15:14:09,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:14:11,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:14:22,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 15:14:24,236 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 15:14:27,340 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 15:14:29,704 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 15:14:31,886 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 15:14:34,952 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] Received shutdown request... [2023-11-17 15:14:39,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-17 15:14:39,018 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-17 15:14:39,025 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 15:14:39,033 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 15:14:39,033 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 15:14:39,218 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 15:14:39,219 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 44 known predicates. [2023-11-17 15:14:39,219 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-17 15:14:39,219 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-17 15:14:39,219 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-11-17 15:14:39,219 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-11-17 15:14:39,219 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-17 15:14:39,219 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-17 15:14:39,222 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances [2023-11-17 15:14:39,223 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:14:39,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:14:39 BasicIcfg [2023-11-17 15:14:39,227 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:14:39,227 INFO L158 Benchmark]: Toolchain (without parser) took 544219.49ms. Allocated memory was 261.1MB in the beginning and 6.3GB in the end (delta: 6.0GB). Free memory was 213.0MB in the beginning and 4.1GB in the end (delta: -3.9GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2023-11-17 15:14:39,227 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 181.4MB. Free memory was 137.6MB in the beginning and 137.4MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:14:39,228 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.38ms. Allocated memory is still 261.1MB. Free memory was 213.0MB in the beginning and 193.1MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-11-17 15:14:39,228 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.17ms. Allocated memory is still 261.1MB. Free memory was 193.1MB in the beginning and 191.4MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-17 15:14:39,228 INFO L158 Benchmark]: Boogie Preprocessor took 38.14ms. Allocated memory is still 261.1MB. Free memory was 191.4MB in the beginning and 189.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:14:39,228 INFO L158 Benchmark]: RCFGBuilder took 432.95ms. Allocated memory is still 261.1MB. Free memory was 189.6MB in the beginning and 170.0MB in the end (delta: 19.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-11-17 15:14:39,228 INFO L158 Benchmark]: TraceAbstraction took 543269.05ms. Allocated memory was 261.1MB in the beginning and 6.3GB in the end (delta: 6.0GB). Free memory was 169.4MB in the beginning and 4.1GB in the end (delta: -3.9GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2023-11-17 15:14:39,230 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 181.4MB. Free memory was 137.6MB in the beginning and 137.4MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 409.38ms. Allocated memory is still 261.1MB. Free memory was 213.0MB in the beginning and 193.1MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.17ms. Allocated memory is still 261.1MB. Free memory was 193.1MB in the beginning and 191.4MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.14ms. Allocated memory is still 261.1MB. Free memory was 191.4MB in the beginning and 189.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 432.95ms. Allocated memory is still 261.1MB. Free memory was 189.6MB in the beginning and 170.0MB in the end (delta: 19.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 543269.05ms. Allocated memory was 261.1MB in the beginning and 6.3GB in the end (delta: 6.0GB). Free memory was 169.4MB in the beginning and 4.1GB in the end (delta: -3.9GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 50 PlacesBefore, 15 PlacesAfterwards, 51 TransitionsBefore, 15 TransitionsAfterwards, 672 CoEnabledTransitionPairs, 5 FixpointIterations, 11 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 40 TotalNumberOfCompositions, 789 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 550, independent: 503, independent conditional: 0, independent unconditional: 503, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 410, independent: 394, independent conditional: 0, independent unconditional: 394, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 410, independent: 387, independent conditional: 0, independent unconditional: 387, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 117, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 550, independent: 109, independent conditional: 0, independent unconditional: 109, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 410, unknown conditional: 0, unknown unconditional: 410] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 16, Positive conditional cache size: 0, Positive unconditional cache size: 16, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 74 PlacesBefore, 29 PlacesAfterwards, 76 TransitionsBefore, 30 TransitionsAfterwards, 2544 CoEnabledTransitionPairs, 4 FixpointIterations, 11 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 53 TotalNumberOfCompositions, 4181 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2534, independent: 2428, independent conditional: 0, independent unconditional: 2428, dependent: 106, dependent conditional: 0, dependent unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1721, independent: 1671, independent conditional: 0, independent unconditional: 1671, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1721, independent: 1652, independent conditional: 0, independent unconditional: 1652, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 69, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 147, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 126, dependent conditional: 0, dependent unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2534, independent: 757, independent conditional: 0, independent unconditional: 757, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 1721, unknown conditional: 0, unknown unconditional: 1721] , Statistics on independence cache: Total cache size (in pairs): 201, Positive cache size: 180, Positive conditional cache size: 0, Positive unconditional cache size: 180, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.1s, 98 PlacesBefore, 40 PlacesAfterwards, 101 TransitionsBefore, 42 TransitionsAfterwards, 5616 CoEnabledTransitionPairs, 5 FixpointIterations, 11 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 69 TotalNumberOfCompositions, 10347 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5222, independent: 5039, independent conditional: 0, independent unconditional: 5039, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 46, unknown conditional: 0, unknown unconditional: 46] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3484, independent: 3427, independent conditional: 0, independent unconditional: 3427, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3484, independent: 3373, independent conditional: 0, independent unconditional: 3373, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 111, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8920, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 298, dependent conditional: 0, dependent unconditional: 298, unknown: 8571, unknown conditional: 0, unknown unconditional: 8571] ], Cache Queries: [ total: 5222, independent: 1612, independent conditional: 0, independent unconditional: 1612, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 3525, unknown conditional: 0, unknown unconditional: 3525] , Statistics on independence cache: Total cache size (in pairs): 273, Positive cache size: 251, Positive conditional cache size: 0, Positive unconditional cache size: 251, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 5, Unknown conditional cache size: 0, Unknown unconditional cache size: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.8s, 122 PlacesBefore, 51 PlacesAfterwards, 126 TransitionsBefore, 54 TransitionsAfterwards, 9888 CoEnabledTransitionPairs, 4 FixpointIterations, 11 TrivialSequentialCompositions, 66 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 85 TotalNumberOfCompositions, 16621 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8050, independent: 7854, independent conditional: 0, independent unconditional: 7854, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 30, unknown conditional: 0, unknown unconditional: 30] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5917, independent: 5843, independent conditional: 0, independent unconditional: 5843, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5917, independent: 5810, independent conditional: 0, independent unconditional: 5810, dependent: 107, dependent conditional: 0, dependent unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 107, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13405, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 431, dependent conditional: 0, dependent unconditional: 431, unknown: 12950, unknown conditional: 0, unknown unconditional: 12950] ], Cache Queries: [ total: 8050, independent: 2011, independent conditional: 0, independent unconditional: 2011, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 5941, unknown conditional: 0, unknown unconditional: 5941] , Statistics on independence cache: Total cache size (in pairs): 441, Positive cache size: 411, Positive conditional cache size: 0, Positive unconditional cache size: 411, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Unknown cache size: 6, Unknown conditional cache size: 0, Unknown unconditional cache size: 6 - TimeoutResultAtElement [Line: 730]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 44 known predicates. - TimeoutResultAtElement [Line: 736]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 44 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 70 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.7s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12 IncrementalHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 0 mSDtfsCounter, 12 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 5 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 92 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.8s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 130 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 275 IncrementalHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 0 mSDtfsCounter, 275 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=2, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 100 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 114 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 265.2s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 244.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.1s, HoareTripleCheckerStatistics: 515 mSolverCounterUnknown, 2952 SdHoareTripleChecker+Valid, 117.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2952 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 114.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2655 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 319 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4828 IncrementalHoareTripleChecker+Invalid, 8317 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 319 mSolverCounterUnsat, 0 mSDtfsCounter, 4828 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 19 SyntacticMatches, 11 SemanticMatches, 159 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 4471 ImplicationChecksByTransitivity, 85.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38595occurred in iteration=4, InterpolantAutomatonStates: 142, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 75 NumberOfCodeBlocks, 75 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 75 ConstructedInterpolants, 22 QuantifiedInterpolants, 2201 SizeOfPredicates, 10 NumberOfNonLiveVariables, 202 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 3/9 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances CFG has 6 procedures, 136 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 273.3s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 251.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 18.8s, HoareTripleCheckerStatistics: 520 mSolverCounterUnknown, 728 SdHoareTripleChecker+Valid, 130.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 728 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 128.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 465 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2210 IncrementalHoareTripleChecker+Invalid, 3303 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 0 mSDtfsCounter, 2210 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 520 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 105.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=696occurred in iteration=2, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 42 ConstructedInterpolants, 9 QuantifiedInterpolants, 1430 SizeOfPredicates, 5 NumberOfNonLiveVariables, 97 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown