/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/ldv-races/race-3_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:20:26,265 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:20:26,351 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:20:26,397 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:20:26,398 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:20:26,398 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:20:26,399 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:20:26,399 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:20:26,400 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:20:26,403 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:20:26,404 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:20:26,405 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:20:26,405 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:20:26,406 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:20:26,406 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:20:26,407 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:20:26,407 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:20:26,407 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:20:26,407 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:20:26,407 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:20:26,407 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:20:26,408 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:20:26,409 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:20:26,409 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:20:26,409 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:20:26,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:20:26,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:20:26,411 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:20:26,411 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:20:26,411 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:20:26,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:20:26,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:20:26,412 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:20:26,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:20:26,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:20:26,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:20:26,697 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:20:26,699 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:20:26,700 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2023-11-17 15:20:27,846 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:20:28,198 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:20:28,199 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2023-11-17 15:20:28,223 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/489f12cd6/0e4ec0942b0949ae8ed00c8230b4fb08/FLAGcce4bc6de [2023-11-17 15:20:28,239 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/489f12cd6/0e4ec0942b0949ae8ed00c8230b4fb08 [2023-11-17 15:20:28,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:20:28,245 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:20:28,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:20:28,248 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:20:28,252 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:20:28,253 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:20:28" (1/1) ... [2023-11-17 15:20:28,254 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d970268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:20:28, skipping insertion in model container [2023-11-17 15:20:28,254 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:20:28" (1/1) ... [2023-11-17 15:20:28,310 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:20:28,427 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-17 15:20:28,864 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i[75009,75022] [2023-11-17 15:20:28,900 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:20:28,911 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:20:28,923 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-17 15:20:28,951 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i[75009,75022] [2023-11-17 15:20:28,963 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:20:29,041 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:20:29,042 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:20:29,042 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:20:29,049 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:20:29,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:20:29 WrapperNode [2023-11-17 15:20:29,049 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:20:29,050 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:20:29,050 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:20:29,051 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:20:29,057 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:20:29" (1/1) ... [2023-11-17 15:20:29,080 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:20:29" (1/1) ... [2023-11-17 15:20:29,111 INFO L138 Inliner]: procedures = 468, calls = 52, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 135 [2023-11-17 15:20:29,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:20:29,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:20:29,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:20:29,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:20:29,125 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:20:29" (1/1) ... [2023-11-17 15:20:29,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:20:29" (1/1) ... [2023-11-17 15:20:29,129 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:20:29" (1/1) ... [2023-11-17 15:20:29,129 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:20:29" (1/1) ... [2023-11-17 15:20:29,141 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:20:29" (1/1) ... [2023-11-17 15:20:29,143 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:20:29" (1/1) ... [2023-11-17 15:20:29,147 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:20:29" (1/1) ... [2023-11-17 15:20:29,150 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:20:29" (1/1) ... [2023-11-17 15:20:29,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:20:29,157 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:20:29,157 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:20:29,157 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:20:29,158 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:20:29" (1/1) ... [2023-11-17 15:20:29,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:20:29,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:20:29,192 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:20:29,198 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:20:29,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:20:29,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:20:29,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:20:29,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 15:20:29,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:20:29,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-17 15:20:29,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:20:29,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:20:29,225 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2023-11-17 15:20:29,225 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2023-11-17 15:20:29,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:20:29,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:20:29,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:20:29,226 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:20:29,471 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:20:29,473 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:20:29,680 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:20:29,705 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:20:29,705 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:20:29,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:20:29 BoogieIcfgContainer [2023-11-17 15:20:29,707 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:20:29,708 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:20:29,708 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:20:29,712 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:20:29,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:20:28" (1/3) ... [2023-11-17 15:20:29,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e36d380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:20:29, skipping insertion in model container [2023-11-17 15:20:29,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:20:29" (2/3) ... [2023-11-17 15:20:29,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e36d380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:20:29, skipping insertion in model container [2023-11-17 15:20:29,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:20:29" (3/3) ... [2023-11-17 15:20:29,714 INFO L112 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2023-11-17 15:20:29,731 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:20:29,731 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-17 15:20:29,731 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:20:29,791 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-17 15:20:29,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 188 transitions, 390 flow [2023-11-17 15:20:29,925 INFO L124 PetriNetUnfolderBase]: 10/234 cut-off events. [2023-11-17 15:20:29,926 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 15:20:29,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 234 events. 10/234 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 376 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 135. Up to 4 conditions per place. [2023-11-17 15:20:29,931 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 188 transitions, 390 flow [2023-11-17 15:20:29,935 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 172 transitions, 356 flow [2023-11-17 15:20:29,941 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:20:29,963 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 172 transitions, 356 flow [2023-11-17 15:20:29,969 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 172 transitions, 356 flow [2023-11-17 15:20:29,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 172 transitions, 356 flow [2023-11-17 15:20:30,015 INFO L124 PetriNetUnfolderBase]: 7/207 cut-off events. [2023-11-17 15:20:30,016 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 15:20:30,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 207 events. 7/207 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 308 event pairs, 0 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 121. Up to 4 conditions per place. [2023-11-17 15:20:30,023 INFO L119 LiptonReduction]: Number of co-enabled transitions 2376 [2023-11-17 15:21:26,167 INFO L134 LiptonReduction]: Checked pairs total: 3774 [2023-11-17 15:21:26,167 INFO L136 LiptonReduction]: Total number of compositions: 193 [2023-11-17 15:21:26,183 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:21:26,190 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;@6f0f9f08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:21:26,190 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-17 15:21:26,191 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:21:26,191 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-17 15:21:26,191 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:21:26,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:21:26,192 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-17 15:21:26,193 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 15:21:26,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:21:26,197 INFO L85 PathProgramCache]: Analyzing trace with hash 664, now seen corresponding path program 1 times [2023-11-17 15:21:26,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:21:26,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066168652] [2023-11-17 15:21:26,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:21:26,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:21:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:21:26,436 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:21:26,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:21:26,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066168652] [2023-11-17 15:21:26,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066168652] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:21:26,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:21:26,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-17 15:21:26,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352509564] [2023-11-17 15:21:26,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:21:26,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 15:21:26,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:21:26,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 15:21:26,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 15:21:26,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 381 [2023-11-17 15:21:26,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 68 flow. Second operand has 2 states, 2 states have (on average 166.5) internal successors, (333), 2 states have internal predecessors, (333), 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:21:26,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:21:26,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 381 [2023-11-17 15:21:26,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:21:26,644 INFO L124 PetriNetUnfolderBase]: 169/320 cut-off events. [2023-11-17 15:21:26,645 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-17 15:21:26,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 320 events. 169/320 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1274 event pairs, 168 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 572. Up to 312 conditions per place. [2023-11-17 15:21:26,651 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 24 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2023-11-17 15:21:26,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 25 transitions, 110 flow [2023-11-17 15:21:26,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 15:21:26,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-17 15:21:26,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 359 transitions. [2023-11-17 15:21:26,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47112860892388453 [2023-11-17 15:21:26,674 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 359 transitions. [2023-11-17 15:21:26,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 359 transitions. [2023-11-17 15:21:26,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:21:26,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 359 transitions. [2023-11-17 15:21:26,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 179.5) internal successors, (359), 2 states have internal predecessors, (359), 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:21:26,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 381.0) internal successors, (1143), 3 states have internal predecessors, (1143), 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:21:26,693 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 381.0) internal successors, (1143), 3 states have internal predecessors, (1143), 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:21:26,694 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 68 flow. Second operand 2 states and 359 transitions. [2023-11-17 15:21:26,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 25 transitions, 110 flow [2023-11-17 15:21:26,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 15:21:26,701 INFO L231 Difference]: Finished difference. Result has 27 places, 25 transitions, 54 flow [2023-11-17 15:21:26,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=27, PETRI_TRANSITIONS=25} [2023-11-17 15:21:26,708 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -5 predicate places. [2023-11-17 15:21:26,708 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 25 transitions, 54 flow [2023-11-17 15:21:26,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 166.5) internal successors, (333), 2 states have internal predecessors, (333), 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:21:26,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:21:26,709 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-17 15:21:26,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:21:26,710 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 15:21:26,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:21:26,711 INFO L85 PathProgramCache]: Analyzing trace with hash 20443403, now seen corresponding path program 1 times [2023-11-17 15:21:26,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:21:26,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62079011] [2023-11-17 15:21:26,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:21:26,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:21:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:21:27,107 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:21:27,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:21:27,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62079011] [2023-11-17 15:21:27,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62079011] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:21:27,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:21:27,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:21:27,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731371993] [2023-11-17 15:21:27,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:21:27,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:21:27,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:21:27,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:21:27,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:21:27,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 381 [2023-11-17 15:21:27,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 25 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 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:21:27,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:21:27,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 381 [2023-11-17 15:21:27,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:21:27,258 INFO L124 PetriNetUnfolderBase]: 264/481 cut-off events. [2023-11-17 15:21:27,258 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 15:21:27,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 970 conditions, 481 events. 264/481 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2015 event pairs, 122 based on Foata normal form. 0/446 useless extension candidates. Maximal degree in co-relation 967. Up to 366 conditions per place. [2023-11-17 15:21:27,261 INFO L140 encePairwiseOnDemand]: 373/381 looper letters, 27 selfloop transitions, 7 changer transitions 0/34 dead transitions. [2023-11-17 15:21:27,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 34 transitions, 140 flow [2023-11-17 15:21:27,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:21:27,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:21:27,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2023-11-17 15:21:27,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39282589676290464 [2023-11-17 15:21:27,264 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2023-11-17 15:21:27,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2023-11-17 15:21:27,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:21:27,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2023-11-17 15:21:27,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 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:21:27,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 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:21:27,269 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 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:21:27,269 INFO L175 Difference]: Start difference. First operand has 27 places, 25 transitions, 54 flow. Second operand 3 states and 449 transitions. [2023-11-17 15:21:27,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 34 transitions, 140 flow [2023-11-17 15:21:27,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 34 transitions, 140 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 15:21:27,271 INFO L231 Difference]: Finished difference. Result has 31 places, 30 transitions, 104 flow [2023-11-17 15:21:27,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=31, PETRI_TRANSITIONS=30} [2023-11-17 15:21:27,272 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2023-11-17 15:21:27,272 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 30 transitions, 104 flow [2023-11-17 15:21:27,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 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:21:27,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:21:27,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-17 15:21:27,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:21:27,273 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 15:21:27,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:21:27,274 INFO L85 PathProgramCache]: Analyzing trace with hash 633746121, now seen corresponding path program 1 times [2023-11-17 15:21:27,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:21:27,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391787597] [2023-11-17 15:21:27,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:21:27,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:21:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:21:27,468 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:21:27,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:21:27,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391787597] [2023-11-17 15:21:27,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391787597] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:21:27,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:21:27,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:21:27,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197839391] [2023-11-17 15:21:27,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:21:27,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:21:27,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:21:27,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:21:27,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:21:27,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 381 [2023-11-17 15:21:27,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 30 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 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:21:27,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:21:27,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 381 [2023-11-17 15:21:27,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:21:27,618 INFO L124 PetriNetUnfolderBase]: 313/573 cut-off events. [2023-11-17 15:21:27,618 INFO L125 PetriNetUnfolderBase]: For 244/244 co-relation queries the response was YES. [2023-11-17 15:21:27,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1607 conditions, 573 events. 313/573 cut-off events. For 244/244 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2580 event pairs, 151 based on Foata normal form. 17/588 useless extension candidates. Maximal degree in co-relation 1602. Up to 462 conditions per place. [2023-11-17 15:21:27,623 INFO L140 encePairwiseOnDemand]: 374/381 looper letters, 31 selfloop transitions, 9 changer transitions 2/42 dead transitions. [2023-11-17 15:21:27,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 42 transitions, 242 flow [2023-11-17 15:21:27,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:21:27,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:21:27,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions. [2023-11-17 15:21:27,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39195100612423445 [2023-11-17 15:21:27,625 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 448 transitions. [2023-11-17 15:21:27,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 448 transitions. [2023-11-17 15:21:27,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:21:27,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 448 transitions. [2023-11-17 15:21:27,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 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:21:27,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 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:21:27,629 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 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:21:27,630 INFO L175 Difference]: Start difference. First operand has 31 places, 30 transitions, 104 flow. Second operand 3 states and 448 transitions. [2023-11-17 15:21:27,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 42 transitions, 242 flow [2023-11-17 15:21:27,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 42 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:21:27,633 INFO L231 Difference]: Finished difference. Result has 32 places, 36 transitions, 161 flow [2023-11-17 15:21:27,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=32, PETRI_TRANSITIONS=36} [2023-11-17 15:21:27,634 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2023-11-17 15:21:27,635 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 36 transitions, 161 flow [2023-11-17 15:21:27,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 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:21:27,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:21:27,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:21:27,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:21:27,635 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 15:21:27,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:21:27,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1046626372, now seen corresponding path program 1 times [2023-11-17 15:21:27,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:21:27,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415229364] [2023-11-17 15:21:27,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:21:27,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:21:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:21:27,707 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:21:27,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:21:27,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415229364] [2023-11-17 15:21:27,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415229364] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:21:27,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:21:27,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:21:27,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735525572] [2023-11-17 15:21:27,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:21:27,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:21:27,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:21:27,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:21:27,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:21:27,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 381 [2023-11-17 15:21:27,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 36 transitions, 161 flow. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 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:21:27,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:21:27,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 381 [2023-11-17 15:21:27,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:21:27,788 INFO L124 PetriNetUnfolderBase]: 72/144 cut-off events. [2023-11-17 15:21:27,788 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2023-11-17 15:21:27,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 144 events. 72/144 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 407 event pairs, 15 based on Foata normal form. 16/159 useless extension candidates. Maximal degree in co-relation 409. Up to 104 conditions per place. [2023-11-17 15:21:27,789 INFO L140 encePairwiseOnDemand]: 379/381 looper letters, 23 selfloop transitions, 1 changer transitions 0/24 dead transitions. [2023-11-17 15:21:27,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 24 transitions, 132 flow [2023-11-17 15:21:27,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:21:27,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:21:27,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2023-11-17 15:21:27,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43919510061242345 [2023-11-17 15:21:27,792 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 502 transitions. [2023-11-17 15:21:27,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions. [2023-11-17 15:21:27,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:21:27,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions. [2023-11-17 15:21:27,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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:21:27,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 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:21:27,797 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 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:21:27,797 INFO L175 Difference]: Start difference. First operand has 32 places, 36 transitions, 161 flow. Second operand 3 states and 502 transitions. [2023-11-17 15:21:27,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 24 transitions, 132 flow [2023-11-17 15:21:27,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 24 transitions, 116 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-11-17 15:21:27,798 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 50 flow [2023-11-17 15:21:27,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2023-11-17 15:21:27,799 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -6 predicate places. [2023-11-17 15:21:27,800 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 50 flow [2023-11-17 15:21:27,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 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:21:27,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:21:27,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:21:27,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:21:27,801 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 15:21:27,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:21:27,801 INFO L85 PathProgramCache]: Analyzing trace with hash 397428345, now seen corresponding path program 1 times [2023-11-17 15:21:27,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:21:27,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639127471] [2023-11-17 15:21:27,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:21:27,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:21:27,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:21:28,573 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:21:28,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:21:28,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639127471] [2023-11-17 15:21:28,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639127471] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:21:28,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:21:28,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:21:28,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887872095] [2023-11-17 15:21:28,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:21:28,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:21:28,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:21:28,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:21:28,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:21:28,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 381 [2023-11-17 15:21:28,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 18 transitions, 50 flow. Second operand has 8 states, 8 states have (on average 122.125) internal successors, (977), 8 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:21:28,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:21:28,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 381 [2023-11-17 15:21:28,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:21:28,995 INFO L124 PetriNetUnfolderBase]: 107/228 cut-off events. [2023-11-17 15:21:28,995 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2023-11-17 15:21:28,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 228 events. 107/228 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 816 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 577. Up to 95 conditions per place. [2023-11-17 15:21:28,997 INFO L140 encePairwiseOnDemand]: 373/381 looper letters, 47 selfloop transitions, 19 changer transitions 0/66 dead transitions. [2023-11-17 15:21:28,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 66 transitions, 320 flow [2023-11-17 15:21:28,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 15:21:28,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 15:21:29,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1267 transitions. [2023-11-17 15:21:29,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3325459317585302 [2023-11-17 15:21:29,002 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1267 transitions. [2023-11-17 15:21:29,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1267 transitions. [2023-11-17 15:21:29,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:21:29,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1267 transitions. [2023-11-17 15:21:29,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 126.7) internal successors, (1267), 10 states have internal predecessors, (1267), 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:21:29,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 381.0) internal successors, (4191), 11 states have internal predecessors, (4191), 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:21:29,013 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 381.0) internal successors, (4191), 11 states have internal predecessors, (4191), 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:21:29,013 INFO L175 Difference]: Start difference. First operand has 26 places, 18 transitions, 50 flow. Second operand 10 states and 1267 transitions. [2023-11-17 15:21:29,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 66 transitions, 320 flow [2023-11-17 15:21:29,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 66 transitions, 315 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:21:29,015 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 150 flow [2023-11-17 15:21:29,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=150, PETRI_PLACES=36, PETRI_TRANSITIONS=33} [2023-11-17 15:21:29,016 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2023-11-17 15:21:29,016 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 150 flow [2023-11-17 15:21:29,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 122.125) internal successors, (977), 8 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:21:29,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:21:29,017 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:21:29,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:21:29,017 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 15:21:29,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:21:29,018 INFO L85 PathProgramCache]: Analyzing trace with hash -841677787, now seen corresponding path program 2 times [2023-11-17 15:21:29,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:21:29,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958711666] [2023-11-17 15:21:29,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:21:29,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:21:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:21:29,588 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:21:29,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:21:29,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958711666] [2023-11-17 15:21:29,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958711666] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:21:29,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:21:29,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:21:29,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740271075] [2023-11-17 15:21:29,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:21:29,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:21:29,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:21:29,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:21:29,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:21:29,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 381 [2023-11-17 15:21:29,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 150 flow. Second operand has 7 states, 7 states have (on average 122.42857142857143) internal successors, (857), 7 states have internal predecessors, (857), 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:21:29,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:21:29,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 381 [2023-11-17 15:21:29,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:21:29,910 INFO L124 PetriNetUnfolderBase]: 152/367 cut-off events. [2023-11-17 15:21:29,910 INFO L125 PetriNetUnfolderBase]: For 253/253 co-relation queries the response was YES. [2023-11-17 15:21:29,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1063 conditions, 367 events. 152/367 cut-off events. For 253/253 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1752 event pairs, 50 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 1055. Up to 135 conditions per place. [2023-11-17 15:21:29,913 INFO L140 encePairwiseOnDemand]: 373/381 looper letters, 50 selfloop transitions, 30 changer transitions 0/80 dead transitions. [2023-11-17 15:21:29,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 80 transitions, 497 flow [2023-11-17 15:21:29,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:21:29,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:21:29,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1021 transitions. [2023-11-17 15:21:29,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3349737532808399 [2023-11-17 15:21:29,916 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1021 transitions. [2023-11-17 15:21:29,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1021 transitions. [2023-11-17 15:21:29,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:21:29,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1021 transitions. [2023-11-17 15:21:29,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 127.625) internal successors, (1021), 8 states have internal predecessors, (1021), 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:21:29,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 381.0) internal successors, (3429), 9 states have internal predecessors, (3429), 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:21:29,923 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 381.0) internal successors, (3429), 9 states have internal predecessors, (3429), 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:21:29,923 INFO L175 Difference]: Start difference. First operand has 36 places, 33 transitions, 150 flow. Second operand 8 states and 1021 transitions. [2023-11-17 15:21:29,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 80 transitions, 497 flow [2023-11-17 15:21:29,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 80 transitions, 480 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-17 15:21:29,926 INFO L231 Difference]: Finished difference. Result has 46 places, 50 transitions, 337 flow [2023-11-17 15:21:29,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=337, PETRI_PLACES=46, PETRI_TRANSITIONS=50} [2023-11-17 15:21:29,927 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2023-11-17 15:21:29,927 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 50 transitions, 337 flow [2023-11-17 15:21:29,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.42857142857143) internal successors, (857), 7 states have internal predecessors, (857), 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:21:29,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:21:29,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:21:29,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:21:29,928 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 15:21:29,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:21:29,929 INFO L85 PathProgramCache]: Analyzing trace with hash -567185130, now seen corresponding path program 1 times [2023-11-17 15:21:29,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:21:29,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877736016] [2023-11-17 15:21:29,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:21:29,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:21:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:21:31,417 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:21:31,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:21:31,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877736016] [2023-11-17 15:21:31,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877736016] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:21:31,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:21:31,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-17 15:21:31,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722052781] [2023-11-17 15:21:31,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:21:31,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-17 15:21:31,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:21:31,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-17 15:21:31,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-17 15:21:31,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 381 [2023-11-17 15:21:31,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 50 transitions, 337 flow. Second operand has 11 states, 11 states have (on average 120.54545454545455) internal successors, (1326), 11 states have internal predecessors, (1326), 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:21:31,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:21:31,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 381 [2023-11-17 15:21:31,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:21:32,140 INFO L124 PetriNetUnfolderBase]: 191/472 cut-off events. [2023-11-17 15:21:32,140 INFO L125 PetriNetUnfolderBase]: For 948/948 co-relation queries the response was YES. [2023-11-17 15:21:32,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1637 conditions, 472 events. 191/472 cut-off events. For 948/948 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2571 event pairs, 22 based on Foata normal form. 3/473 useless extension candidates. Maximal degree in co-relation 1625. Up to 224 conditions per place. [2023-11-17 15:21:32,144 INFO L140 encePairwiseOnDemand]: 370/381 looper letters, 81 selfloop transitions, 23 changer transitions 19/123 dead transitions. [2023-11-17 15:21:32,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 123 transitions, 1023 flow [2023-11-17 15:21:32,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 15:21:32,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 15:21:32,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1259 transitions. [2023-11-17 15:21:32,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3304461942257218 [2023-11-17 15:21:32,148 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1259 transitions. [2023-11-17 15:21:32,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1259 transitions. [2023-11-17 15:21:32,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:21:32,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1259 transitions. [2023-11-17 15:21:32,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 125.9) internal successors, (1259), 10 states have internal predecessors, (1259), 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:21:32,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 381.0) internal successors, (4191), 11 states have internal predecessors, (4191), 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:21:32,156 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 381.0) internal successors, (4191), 11 states have internal predecessors, (4191), 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:21:32,157 INFO L175 Difference]: Start difference. First operand has 46 places, 50 transitions, 337 flow. Second operand 10 states and 1259 transitions. [2023-11-17 15:21:32,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 123 transitions, 1023 flow [2023-11-17 15:21:32,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 123 transitions, 1010 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-11-17 15:21:32,163 INFO L231 Difference]: Finished difference. Result has 61 places, 68 transitions, 573 flow [2023-11-17 15:21:32,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=573, PETRI_PLACES=61, PETRI_TRANSITIONS=68} [2023-11-17 15:21:32,164 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 29 predicate places. [2023-11-17 15:21:32,164 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 68 transitions, 573 flow [2023-11-17 15:21:32,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 120.54545454545455) internal successors, (1326), 11 states have internal predecessors, (1326), 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:21:32,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:21:32,165 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:21:32,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:21:32,165 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 15:21:32,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:21:32,166 INFO L85 PathProgramCache]: Analyzing trace with hash 963300630, now seen corresponding path program 2 times [2023-11-17 15:21:32,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:21:32,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881664865] [2023-11-17 15:21:32,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:21:32,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:21:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:21:33,436 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:21:33,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:21:33,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881664865] [2023-11-17 15:21:33,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881664865] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:21:33,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:21:33,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-17 15:21:33,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381304859] [2023-11-17 15:21:33,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:21:33,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-17 15:21:33,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:21:33,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-17 15:21:33,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-17 15:21:33,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 381 [2023-11-17 15:21:33,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 68 transitions, 573 flow. Second operand has 11 states, 11 states have (on average 120.54545454545455) internal successors, (1326), 11 states have internal predecessors, (1326), 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:21:33,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:21:33,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 381 [2023-11-17 15:21:33,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:21:34,134 INFO L124 PetriNetUnfolderBase]: 209/514 cut-off events. [2023-11-17 15:21:34,135 INFO L125 PetriNetUnfolderBase]: For 1779/1779 co-relation queries the response was YES. [2023-11-17 15:21:34,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2274 conditions, 514 events. 209/514 cut-off events. For 1779/1779 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2835 event pairs, 47 based on Foata normal form. 3/515 useless extension candidates. Maximal degree in co-relation 2255. Up to 320 conditions per place. [2023-11-17 15:21:34,140 INFO L140 encePairwiseOnDemand]: 372/381 looper letters, 72 selfloop transitions, 27 changer transitions 18/117 dead transitions. [2023-11-17 15:21:34,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 117 transitions, 1159 flow [2023-11-17 15:21:34,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 15:21:34,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 15:21:34,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1253 transitions. [2023-11-17 15:21:34,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32887139107611546 [2023-11-17 15:21:34,146 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1253 transitions. [2023-11-17 15:21:34,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1253 transitions. [2023-11-17 15:21:34,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:21:34,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1253 transitions. [2023-11-17 15:21:34,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 125.3) internal successors, (1253), 10 states have internal predecessors, (1253), 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:21:34,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 381.0) internal successors, (4191), 11 states have internal predecessors, (4191), 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:21:34,158 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 381.0) internal successors, (4191), 11 states have internal predecessors, (4191), 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:21:34,158 INFO L175 Difference]: Start difference. First operand has 61 places, 68 transitions, 573 flow. Second operand 10 states and 1253 transitions. [2023-11-17 15:21:34,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 117 transitions, 1159 flow [2023-11-17 15:21:34,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 117 transitions, 1101 flow, removed 28 selfloop flow, removed 3 redundant places. [2023-11-17 15:21:34,171 INFO L231 Difference]: Finished difference. Result has 70 places, 79 transitions, 757 flow [2023-11-17 15:21:34,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=757, PETRI_PLACES=70, PETRI_TRANSITIONS=79} [2023-11-17 15:21:34,173 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 38 predicate places. [2023-11-17 15:21:34,174 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 79 transitions, 757 flow [2023-11-17 15:21:34,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 120.54545454545455) internal successors, (1326), 11 states have internal predecessors, (1326), 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:21:34,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:21:34,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:21:34,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 15:21:34,175 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 15:21:34,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:21:34,176 INFO L85 PathProgramCache]: Analyzing trace with hash 2029848952, now seen corresponding path program 3 times [2023-11-17 15:21:34,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:21:34,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427200858] [2023-11-17 15:21:34,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:21:34,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:21:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:21:35,394 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:21:35,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:21:35,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427200858] [2023-11-17 15:21:35,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427200858] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:21:35,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:21:35,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-17 15:21:35,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966793398] [2023-11-17 15:21:35,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:21:35,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-17 15:21:35,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:21:35,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-17 15:21:35,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-17 15:21:35,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 381 [2023-11-17 15:21:35,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 79 transitions, 757 flow. Second operand has 11 states, 11 states have (on average 120.54545454545455) internal successors, (1326), 11 states have internal predecessors, (1326), 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:21:35,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:21:35,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 381 [2023-11-17 15:21:35,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:21:36,115 INFO L124 PetriNetUnfolderBase]: 194/488 cut-off events. [2023-11-17 15:21:36,115 INFO L125 PetriNetUnfolderBase]: For 2277/2277 co-relation queries the response was YES. [2023-11-17 15:21:36,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2372 conditions, 488 events. 194/488 cut-off events. For 2277/2277 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2682 event pairs, 25 based on Foata normal form. 3/489 useless extension candidates. Maximal degree in co-relation 2349. Up to 221 conditions per place. [2023-11-17 15:21:36,120 INFO L140 encePairwiseOnDemand]: 370/381 looper letters, 83 selfloop transitions, 36 changer transitions 18/137 dead transitions. [2023-11-17 15:21:36,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 137 transitions, 1428 flow [2023-11-17 15:21:36,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 15:21:36,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-17 15:21:36,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1506 transitions. [2023-11-17 15:21:36,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3293963254593176 [2023-11-17 15:21:36,126 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1506 transitions. [2023-11-17 15:21:36,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1506 transitions. [2023-11-17 15:21:36,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:21:36,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1506 transitions. [2023-11-17 15:21:36,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 125.5) internal successors, (1506), 12 states have internal predecessors, (1506), 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:21:36,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 381.0) internal successors, (4953), 13 states have internal predecessors, (4953), 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:21:36,137 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 381.0) internal successors, (4953), 13 states have internal predecessors, (4953), 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:21:36,137 INFO L175 Difference]: Start difference. First operand has 70 places, 79 transitions, 757 flow. Second operand 12 states and 1506 transitions. [2023-11-17 15:21:36,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 137 transitions, 1428 flow [2023-11-17 15:21:36,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 137 transitions, 1343 flow, removed 31 selfloop flow, removed 5 redundant places. [2023-11-17 15:21:36,154 INFO L231 Difference]: Finished difference. Result has 79 places, 85 transitions, 888 flow [2023-11-17 15:21:36,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=888, PETRI_PLACES=79, PETRI_TRANSITIONS=85} [2023-11-17 15:21:36,156 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 47 predicate places. [2023-11-17 15:21:36,156 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 85 transitions, 888 flow [2023-11-17 15:21:36,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 120.54545454545455) internal successors, (1326), 11 states have internal predecessors, (1326), 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:21:36,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:21:36,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:21:36,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 15:21:36,160 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 15:21:36,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:21:36,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2006450158, now seen corresponding path program 4 times [2023-11-17 15:21:36,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:21:36,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451191117] [2023-11-17 15:21:36,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:21:36,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:21:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:21:36,199 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:21:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:21:36,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:21:36,262 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:21:36,263 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2023-11-17 15:21:36,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2023-11-17 15:21:36,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2023-11-17 15:21:36,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2023-11-17 15:21:36,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2023-11-17 15:21:36,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2023-11-17 15:21:36,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2023-11-17 15:21:36,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2023-11-17 15:21:36,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 15:21:36,268 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1] [2023-11-17 15:21:36,273 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:21:36,273 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:21:36,315 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated [2023-11-17 15:21:36,316 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated [2023-11-17 15:21:36,317 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated [2023-11-17 15:21:36,317 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet17 [2023-11-17 15:21:36,318 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated [2023-11-17 15:21:36,318 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated [2023-11-17 15:21:36,318 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated [2023-11-17 15:21:36,319 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet19 [2023-11-17 15:21:36,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:21:36 BasicIcfg [2023-11-17 15:21:36,330 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:21:36,331 INFO L158 Benchmark]: Toolchain (without parser) took 68086.19ms. Allocated memory was 237.0MB in the beginning and 342.9MB in the end (delta: 105.9MB). Free memory was 183.8MB in the beginning and 171.0MB in the end (delta: 12.9MB). Peak memory consumption was 120.3MB. Max. memory is 8.0GB. [2023-11-17 15:21:36,331 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 184.5MB. Free memory is still 132.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:21:36,331 INFO L158 Benchmark]: CACSL2BoogieTranslator took 802.07ms. Allocated memory is still 237.0MB. Free memory was 183.8MB in the beginning and 194.8MB in the end (delta: -11.0MB). Peak memory consumption was 57.2MB. Max. memory is 8.0GB. [2023-11-17 15:21:36,332 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.74ms. Allocated memory is still 237.0MB. Free memory was 194.8MB in the beginning and 191.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-11-17 15:21:36,332 INFO L158 Benchmark]: Boogie Preprocessor took 38.42ms. Allocated memory is still 237.0MB. Free memory was 191.1MB in the beginning and 188.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:21:36,332 INFO L158 Benchmark]: RCFGBuilder took 549.78ms. Allocated memory is still 237.0MB. Free memory was 188.5MB in the beginning and 162.8MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-11-17 15:21:36,332 INFO L158 Benchmark]: TraceAbstraction took 66622.15ms. Allocated memory was 237.0MB in the beginning and 342.9MB in the end (delta: 105.9MB). Free memory was 162.3MB in the beginning and 171.0MB in the end (delta: -8.7MB). Peak memory consumption was 97.8MB. Max. memory is 8.0GB. [2023-11-17 15:21:36,334 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 184.5MB. Free memory is still 132.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 802.07ms. Allocated memory is still 237.0MB. Free memory was 183.8MB in the beginning and 194.8MB in the end (delta: -11.0MB). Peak memory consumption was 57.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.74ms. Allocated memory is still 237.0MB. Free memory was 194.8MB in the beginning and 191.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.42ms. Allocated memory is still 237.0MB. Free memory was 191.1MB in the beginning and 188.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 549.78ms. Allocated memory is still 237.0MB. Free memory was 188.5MB in the beginning and 162.8MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 66622.15ms. Allocated memory was 237.0MB in the beginning and 342.9MB in the end (delta: 105.9MB). Free memory was 162.3MB in the beginning and 171.0MB in the end (delta: -8.7MB). Peak memory consumption was 97.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet17 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet19 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 56.2s, 172 PlacesBefore, 32 PlacesAfterwards, 172 TransitionsBefore, 28 TransitionsAfterwards, 2376 CoEnabledTransitionPairs, 7 FixpointIterations, 105 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 16 TrivialYvCompositions, 15 ConcurrentYvCompositions, 4 ChoiceCompositions, 193 TotalNumberOfCompositions, 3774 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1986, independent: 1848, independent conditional: 0, independent unconditional: 1848, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 53, unknown conditional: 0, unknown unconditional: 53] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1610, independent: 1561, independent conditional: 0, independent unconditional: 1561, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 20, unknown conditional: 0, unknown unconditional: 20] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1610, independent: 1561, independent conditional: 0, independent unconditional: 1561, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 49, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 20, unknown conditional: 0, unknown unconditional: 20] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43621, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 601, dependent conditional: 0, dependent unconditional: 601, unknown: 43020, unknown conditional: 0, unknown unconditional: 43020] ], Cache Queries: [ total: 1986, independent: 287, independent conditional: 0, independent unconditional: 287, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 1643, unknown conditional: 0, unknown unconditional: 1643] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 5, Unknown conditional cache size: 0, Unknown unconditional cache size: 5 - CounterExampleResult [Line: 1675]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1676] 0 pthread_t t1,t2; [L1688] 0 struct device *my_dev; [L1733] CALL, EXPR 0 my_drv_init() [L1727] 0 return 0; [L1733] RET, EXPR 0 my_drv_init() [L1733] 0 int ret = my_drv_init(); [L1734] COND TRUE 0 ret==0 [L1735] 0 int probe_ret; [L1736] 0 struct my_data data; [L1737] CALL, EXPR 0 my_drv_probe(&data) [L1705] 0 data->shared.a = 0 [L1706] 0 data->shared.b = 0 [L1707] EXPR 0 data->shared.a [L1707] CALL 0 ldv_assert(data->shared.a==0) [L1675] COND FALSE 0 !(!expression) [L1707] RET 0 ldv_assert(data->shared.a==0) [L1708] EXPR 0 data->shared.b [L1708] CALL 0 ldv_assert(data->shared.b==0) [L1675] COND FALSE 0 !(!expression) [L1708] RET 0 ldv_assert(data->shared.b==0) [L1709] 0 int res = __VERIFIER_nondet_int(); [L1710] COND FALSE 0 !(\read(res)) [L1712] 0 my_dev = &data->dev [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, data={6:0}, data={6:0}, my_dev={6:24}, res=0, t1={3:0}, t2={4:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, data={6:0}, data={6:0}, my_dev={6:24}, res=0, t1={3:0}, t2={4:0}] [L1715] 0 return 0; [L1737] RET, EXPR 0 my_drv_probe(&data) [L1737] 0 probe_ret = my_drv_probe(&data) [L1690] 2 struct my_data *data; [L1691] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L1691] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} [L1691] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} [L1691] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1693] 2 data->shared.a = 1 VAL [arg={0:0}, arg={0:0}, data={6:0}, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1696] EXPR 2 data->shared.b [L1696] 2 int lb = data->shared.b; [L1738] COND TRUE 0 probe_ret==0 [L1739] CALL 0 my_drv_disconnect(&data) [L1721] 0 void *status; [L1722] 0 \read(t1) VAL [arg={0:0}, arg={0:0}, data={6:0}, data={6:0}, data={6:0}, lb=0, my_dev={6:24}, status={5:0}, t1={3:0}, t2={4:0}] [L1690] 1 struct my_data *data; [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L1691] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} [L1691] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} [L1691] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1693] 1 data->shared.a = 1 VAL [arg={0:0}, arg={0:0}, data={6:0}, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1696] EXPR 1 data->shared.b [L1696] 1 int lb = data->shared.b; [L1699] 1 data->shared.b = lb + 1 [L1701] 1 return 0; [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, arg={0:0}, arg={0:0}, data={6:0}, data={6:0}, data={6:0}, lb=0, my_dev={6:24}, status={5:0}, t1={3:0}, t2={4:0}] [L1699] 2 data->shared.b = lb + 1 [L1701] 2 return 0; [L1723] 0 \read(t2) VAL [\result={0:0}, arg={0:0}, arg={0:0}, data={6:0}, data={6:0}, data={6:0}, lb=0, my_dev={6:24}, status={5:0}, t1={3:0}, t2={4:0}] [L1723] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, arg={0:0}, arg={0:0}, data={6:0}, data={6:0}, data={6:0}, lb=0, my_dev={6:24}, status={5:0}, t1={3:0}, t2={4:0}] [L1739] RET 0 my_drv_disconnect(&data) [L1740] EXPR 0 data.shared.a [L1740] CALL 0 ldv_assert(data.shared.a==1) [L1675] COND FALSE 0 !(!expression) [L1740] RET 0 ldv_assert(data.shared.a==1) [L1741] EXPR 0 data.shared.b [L1741] CALL 0 ldv_assert(data.shared.b==2) [L1675] COND TRUE 0 !expression [L1675] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, arg={0:0}, arg={0:0}, data={6:0}, expression=0, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] - UnprovableResult [Line: 1675]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 195 locations, 8 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: 66.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 56.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 201 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 201 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1627 IncrementalHoareTripleChecker+Invalid, 1730 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 1 mSDtfsCounter, 1627 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=888occurred in iteration=9, InterpolantAutomatonStates: 61, 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.3s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 1776 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 RESULT: Ultimate proved your program to be incorrect! [2023-11-17 15:21:36,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...