/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-2_3-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:30:25,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:30:25,562 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 11:30:25,588 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:30:25,588 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:30:25,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:30:25,589 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:30:25,589 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:30:25,589 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:30:25,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:30:25,590 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:30:25,590 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:30:25,590 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:30:25,591 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:30:25,591 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:30:25,591 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:30:25,591 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:30:25,591 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:30:25,592 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:30:25,592 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:30:25,592 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:30:25,598 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:30:25,599 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:30:25,599 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:30:25,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:30:25,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:30:25,605 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:30:25,605 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:30:25,605 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:30:25,605 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:30:25,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:30:25,606 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:30:25,606 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 11:30:25,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:30:25,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:30:25,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:30:25,786 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:30:25,786 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:30:25,787 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_3-container_of.i [2023-11-17 11:30:26,690 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:30:26,957 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:30:26,958 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_3-container_of.i [2023-11-17 11:30:26,979 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5668c4195/4660ea3522dd44678ec90d15ae8811fd/FLAG3581a790b [2023-11-17 11:30:26,989 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5668c4195/4660ea3522dd44678ec90d15ae8811fd [2023-11-17 11:30:26,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:30:26,992 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:30:26,994 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:30:26,994 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:30:26,997 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:30:26,997 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:30:26" (1/1) ... [2023-11-17 11:30:26,998 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2676c0f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:26, skipping insertion in model container [2023-11-17 11:30:26,998 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:30:26" (1/1) ... [2023-11-17 11:30:27,055 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:30:27,160 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-17 11:30:27,444 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-2_3-container_of.i[75002,75015] [2023-11-17 11:30:27,475 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:30:27,482 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:30:27,497 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-17 11:30:27,531 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-2_3-container_of.i[75002,75015] [2023-11-17 11:30:27,545 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:30:27,614 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:30:27,614 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:30:27,614 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:30:27,620 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:30:27,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:27 WrapperNode [2023-11-17 11:30:27,622 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:30:27,622 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:30:27,623 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:30:27,623 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:30:27,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:27" (1/1) ... [2023-11-17 11:30:27,657 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:27" (1/1) ... [2023-11-17 11:30:27,687 INFO L138 Inliner]: procedures = 470, calls = 64, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 144 [2023-11-17 11:30:27,688 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:30:27,688 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:30:27,688 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:30:27,688 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:30:27,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:27" (1/1) ... [2023-11-17 11:30:27,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:27" (1/1) ... [2023-11-17 11:30:27,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:27" (1/1) ... [2023-11-17 11:30:27,715 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:27" (1/1) ... [2023-11-17 11:30:27,728 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:27" (1/1) ... [2023-11-17 11:30:27,729 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:27" (1/1) ... [2023-11-17 11:30:27,732 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:27" (1/1) ... [2023-11-17 11:30:27,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:27" (1/1) ... [2023-11-17 11:30:27,737 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:30:27,738 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:30:27,738 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:30:27,738 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:30:27,739 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:27" (1/1) ... [2023-11-17 11:30:27,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:30:27,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:30:27,775 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 11:30:27,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 11:30:27,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 11:30:27,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:30:27,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 11:30:27,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 11:30:27,798 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-17 11:30:27,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:30:27,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-17 11:30:27,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:30:27,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:30:27,798 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2023-11-17 11:30:27,798 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2023-11-17 11:30:27,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:30:27,798 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-17 11:30:27,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:30:27,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:30:27,800 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 11:30:28,033 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:30:28,034 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:30:28,269 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:30:28,402 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:30:28,402 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 11:30:28,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:30:28 BoogieIcfgContainer [2023-11-17 11:30:28,404 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:30:28,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:30:28,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:30:28,408 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:30:28,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:30:26" (1/3) ... [2023-11-17 11:30:28,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7faa4f85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:30:28, skipping insertion in model container [2023-11-17 11:30:28,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:27" (2/3) ... [2023-11-17 11:30:28,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7faa4f85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:30:28, skipping insertion in model container [2023-11-17 11:30:28,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:30:28" (3/3) ... [2023-11-17 11:30:28,410 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_3-container_of.i [2023-11-17 11:30:28,421 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:30:28,421 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-17 11:30:28,421 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:30:28,450 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-17 11:30:28,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 65 transitions, 144 flow [2023-11-17 11:30:28,512 INFO L124 PetriNetUnfolderBase]: 10/78 cut-off events. [2023-11-17 11:30:28,512 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 11:30:28,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 78 events. 10/78 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 161 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. [2023-11-17 11:30:28,516 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 65 transitions, 144 flow [2023-11-17 11:30:28,520 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 58 transitions, 128 flow [2023-11-17 11:30:28,524 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:30:28,535 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 58 transitions, 128 flow [2023-11-17 11:30:28,538 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 58 transitions, 128 flow [2023-11-17 11:30:28,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 58 transitions, 128 flow [2023-11-17 11:30:28,557 INFO L124 PetriNetUnfolderBase]: 7/69 cut-off events. [2023-11-17 11:30:28,557 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 11:30:28,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 69 events. 7/69 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 140 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 41. Up to 4 conditions per place. [2023-11-17 11:30:28,559 INFO L119 LiptonReduction]: Number of co-enabled transitions 864 [2023-11-17 11:31:07,475 INFO L134 LiptonReduction]: Checked pairs total: 2731 [2023-11-17 11:31:07,475 INFO L136 LiptonReduction]: Total number of compositions: 43 [2023-11-17 11:31:07,492 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:31:07,499 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;@522a1cab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:31:07,499 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-17 11:31:07,502 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:31:07,502 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-11-17 11:31:07,502 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:31:07,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:31:07,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-17 11:31:07,503 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 11:31:07,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:31:07,507 INFO L85 PathProgramCache]: Analyzing trace with hash 535552, now seen corresponding path program 1 times [2023-11-17 11:31:07,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:31:07,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091727527] [2023-11-17 11:31:07,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:31:07,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:31:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:31:07,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:31:07,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:31:07,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091727527] [2023-11-17 11:31:07,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091727527] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:31:07,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:31:07,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:31:07,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159023473] [2023-11-17 11:31:07,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:31:07,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:31:07,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:31:07,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:31:07,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:31:07,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 108 [2023-11-17 11:31:07,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:31:07,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:31:07,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 108 [2023-11-17 11:31:07,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:31:08,218 INFO L124 PetriNetUnfolderBase]: 586/978 cut-off events. [2023-11-17 11:31:08,218 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-17 11:31:08,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1981 conditions, 978 events. 586/978 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4263 event pairs, 525 based on Foata normal form. 0/866 useless extension candidates. Maximal degree in co-relation 1904. Up to 881 conditions per place. [2023-11-17 11:31:08,228 INFO L140 encePairwiseOnDemand]: 103/108 looper letters, 37 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2023-11-17 11:31:08,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 40 transitions, 172 flow [2023-11-17 11:31:08,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:31:08,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:31:08,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2023-11-17 11:31:08,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.23148148148148148 [2023-11-17 11:31:08,240 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 75 transitions. [2023-11-17 11:31:08,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 75 transitions. [2023-11-17 11:31:08,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:31:08,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 75 transitions. [2023-11-17 11:31:08,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:31:08,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:31:08,249 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:31:08,250 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 76 flow. Second operand 3 states and 75 transitions. [2023-11-17 11:31:08,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 40 transitions, 172 flow [2023-11-17 11:31:08,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 164 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 11:31:08,255 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 70 flow [2023-11-17 11:31:08,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2023-11-17 11:31:08,259 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2023-11-17 11:31:08,259 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 70 flow [2023-11-17 11:31:08,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:31:08,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:31:08,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-17 11:31:08,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:31:08,260 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 11:31:08,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:31:08,266 INFO L85 PathProgramCache]: Analyzing trace with hash 535577, now seen corresponding path program 1 times [2023-11-17 11:31:08,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:31:08,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860229822] [2023-11-17 11:31:08,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:31:08,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:31:08,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:31:08,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:31:08,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:31:08,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860229822] [2023-11-17 11:31:08,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860229822] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:31:08,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:31:08,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:31:08,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556979000] [2023-11-17 11:31:08,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:31:08,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:31:08,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:31:08,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:31:08,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:31:08,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 108 [2023-11-17 11:31:08,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:31:08,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:31:08,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 108 [2023-11-17 11:31:08,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:31:08,527 INFO L124 PetriNetUnfolderBase]: 598/1017 cut-off events. [2023-11-17 11:31:08,527 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2023-11-17 11:31:08,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2114 conditions, 1017 events. 598/1017 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4531 event pairs, 529 based on Foata normal form. 37/980 useless extension candidates. Maximal degree in co-relation 1573. Up to 944 conditions per place. [2023-11-17 11:31:08,531 INFO L140 encePairwiseOnDemand]: 101/108 looper letters, 33 selfloop transitions, 5 changer transitions 2/40 dead transitions. [2023-11-17 11:31:08,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 40 transitions, 170 flow [2023-11-17 11:31:08,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:31:08,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:31:08,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2023-11-17 11:31:08,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30246913580246915 [2023-11-17 11:31:08,533 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 98 transitions. [2023-11-17 11:31:08,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 98 transitions. [2023-11-17 11:31:08,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:31:08,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 98 transitions. [2023-11-17 11:31:08,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:31:08,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:31:08,535 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:31:08,535 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 70 flow. Second operand 3 states and 98 transitions. [2023-11-17 11:31:08,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 40 transitions, 170 flow [2023-11-17 11:31:08,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:31:08,544 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 93 flow [2023-11-17 11:31:08,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2023-11-17 11:31:08,545 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2023-11-17 11:31:08,545 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 93 flow [2023-11-17 11:31:08,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:31:08,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:31:08,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:31:08,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:31:08,546 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 11:31:08,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:31:08,546 INFO L85 PathProgramCache]: Analyzing trace with hash -683674772, now seen corresponding path program 1 times [2023-11-17 11:31:08,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:31:08,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826408118] [2023-11-17 11:31:08,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:31:08,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:31:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:31:08,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:31:08,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:31:08,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826408118] [2023-11-17 11:31:08,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826408118] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:31:08,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:31:08,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:31:08,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139698624] [2023-11-17 11:31:08,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:31:08,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:31:08,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:31:08,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:31:08,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:31:08,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 108 [2023-11-17 11:31:08,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:31:08,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:31:08,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 108 [2023-11-17 11:31:08,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:31:08,845 INFO L124 PetriNetUnfolderBase]: 797/1337 cut-off events. [2023-11-17 11:31:08,846 INFO L125 PetriNetUnfolderBase]: For 292/292 co-relation queries the response was YES. [2023-11-17 11:31:08,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3117 conditions, 1337 events. 797/1337 cut-off events. For 292/292 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6443 event pairs, 401 based on Foata normal form. 0/1236 useless extension candidates. Maximal degree in co-relation 2493. Up to 1018 conditions per place. [2023-11-17 11:31:08,852 INFO L140 encePairwiseOnDemand]: 100/108 looper letters, 39 selfloop transitions, 7 changer transitions 0/46 dead transitions. [2023-11-17 11:31:08,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 46 transitions, 221 flow [2023-11-17 11:31:08,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:31:08,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:31:08,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2023-11-17 11:31:08,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30864197530864196 [2023-11-17 11:31:08,856 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 100 transitions. [2023-11-17 11:31:08,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 100 transitions. [2023-11-17 11:31:08,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:31:08,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 100 transitions. [2023-11-17 11:31:08,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:31:08,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:31:08,859 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:31:08,859 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 93 flow. Second operand 3 states and 100 transitions. [2023-11-17 11:31:08,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 46 transitions, 221 flow [2023-11-17 11:31:08,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:31:08,861 INFO L231 Difference]: Finished difference. Result has 37 places, 38 transitions, 150 flow [2023-11-17 11:31:08,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=37, PETRI_TRANSITIONS=38} [2023-11-17 11:31:08,863 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2023-11-17 11:31:08,863 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 38 transitions, 150 flow [2023-11-17 11:31:08,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:31:08,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:31:08,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:31:08,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:31:08,864 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 11:31:08,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:31:08,864 INFO L85 PathProgramCache]: Analyzing trace with hash 280918963, now seen corresponding path program 1 times [2023-11-17 11:31:08,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:31:08,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931000289] [2023-11-17 11:31:08,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:31:08,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:31:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:31:08,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:31:08,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:31:08,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931000289] [2023-11-17 11:31:08,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931000289] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:31:08,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:31:08,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:31:08,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124364433] [2023-11-17 11:31:08,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:31:08,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:31:08,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:31:08,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:31:08,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:31:08,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 108 [2023-11-17 11:31:08,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 38 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:31:08,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:31:08,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 108 [2023-11-17 11:31:08,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:31:09,192 INFO L124 PetriNetUnfolderBase]: 945/1577 cut-off events. [2023-11-17 11:31:09,192 INFO L125 PetriNetUnfolderBase]: For 1160/1160 co-relation queries the response was YES. [2023-11-17 11:31:09,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4582 conditions, 1577 events. 945/1577 cut-off events. For 1160/1160 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7830 event pairs, 517 based on Foata normal form. 36/1612 useless extension candidates. Maximal degree in co-relation 470. Up to 1274 conditions per place. [2023-11-17 11:31:09,200 INFO L140 encePairwiseOnDemand]: 101/108 looper letters, 45 selfloop transitions, 10 changer transitions 0/55 dead transitions. [2023-11-17 11:31:09,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 55 transitions, 344 flow [2023-11-17 11:31:09,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:31:09,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:31:09,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2023-11-17 11:31:09,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3055555555555556 [2023-11-17 11:31:09,201 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 99 transitions. [2023-11-17 11:31:09,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 99 transitions. [2023-11-17 11:31:09,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:31:09,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 99 transitions. [2023-11-17 11:31:09,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:31:09,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:31:09,204 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:31:09,204 INFO L175 Difference]: Start difference. First operand has 37 places, 38 transitions, 150 flow. Second operand 3 states and 99 transitions. [2023-11-17 11:31:09,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 55 transitions, 344 flow [2023-11-17 11:31:09,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 55 transitions, 302 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-11-17 11:31:09,208 INFO L231 Difference]: Finished difference. Result has 38 places, 47 transitions, 222 flow [2023-11-17 11:31:09,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=38, PETRI_TRANSITIONS=47} [2023-11-17 11:31:09,210 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2023-11-17 11:31:09,210 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 47 transitions, 222 flow [2023-11-17 11:31:09,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:31:09,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:31:09,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:31:09,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:31:09,210 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 11:31:09,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:31:09,211 INFO L85 PathProgramCache]: Analyzing trace with hash 986785015, now seen corresponding path program 1 times [2023-11-17 11:31:09,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:31:09,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943216213] [2023-11-17 11:31:09,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:31:09,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:31:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:31:09,239 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:31:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:31:09,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:31:09,273 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:31:09,273 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2023-11-17 11:31:09,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2023-11-17 11:31:09,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2023-11-17 11:31:09,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2023-11-17 11:31:09,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2023-11-17 11:31:09,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2023-11-17 11:31:09,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2023-11-17 11:31:09,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2023-11-17 11:31:09,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:31:09,275 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-17 11:31:09,278 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:31:09,279 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:31:09,291 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated [2023-11-17 11:31:09,292 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated [2023-11-17 11:31:09,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:31:09 BasicIcfg [2023-11-17 11:31:09,296 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:31:09,297 INFO L158 Benchmark]: Toolchain (without parser) took 42304.99ms. Allocated memory was 297.8MB in the beginning and 357.6MB in the end (delta: 59.8MB). Free memory was 256.7MB in the beginning and 264.6MB in the end (delta: -7.9MB). Peak memory consumption was 52.9MB. Max. memory is 8.0GB. [2023-11-17 11:31:09,297 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 176.2MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:31:09,297 INFO L158 Benchmark]: CACSL2BoogieTranslator took 628.29ms. Allocated memory is still 297.8MB. Free memory was 256.7MB in the beginning and 201.1MB in the end (delta: 55.6MB). Peak memory consumption was 55.6MB. Max. memory is 8.0GB. [2023-11-17 11:31:09,298 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.09ms. Allocated memory is still 297.8MB. Free memory was 201.1MB in the beginning and 198.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 11:31:09,298 INFO L158 Benchmark]: Boogie Preprocessor took 49.41ms. Allocated memory is still 297.8MB. Free memory was 198.0MB in the beginning and 194.8MB in the end (delta: 3.2MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 11:31:09,298 INFO L158 Benchmark]: RCFGBuilder took 665.72ms. Allocated memory is still 297.8MB. Free memory was 194.8MB in the beginning and 225.5MB in the end (delta: -30.7MB). Peak memory consumption was 18.0MB. Max. memory is 8.0GB. [2023-11-17 11:31:09,299 INFO L158 Benchmark]: TraceAbstraction took 40890.85ms. Allocated memory was 297.8MB in the beginning and 357.6MB in the end (delta: 59.8MB). Free memory was 224.5MB in the beginning and 264.6MB in the end (delta: -40.1MB). Peak memory consumption was 20.2MB. Max. memory is 8.0GB. [2023-11-17 11:31:09,300 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.11ms. Allocated memory is still 176.2MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 628.29ms. Allocated memory is still 297.8MB. Free memory was 256.7MB in the beginning and 201.1MB in the end (delta: 55.6MB). Peak memory consumption was 55.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.09ms. Allocated memory is still 297.8MB. Free memory was 201.1MB in the beginning and 198.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.41ms. Allocated memory is still 297.8MB. Free memory was 198.0MB in the beginning and 194.8MB in the end (delta: 3.2MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 665.72ms. Allocated memory is still 297.8MB. Free memory was 194.8MB in the beginning and 225.5MB in the end (delta: -30.7MB). Peak memory consumption was 18.0MB. Max. memory is 8.0GB. * TraceAbstraction took 40890.85ms. Allocated memory was 297.8MB in the beginning and 357.6MB in the end (delta: 59.8MB). Free memory was 224.5MB in the beginning and 264.6MB in the end (delta: -40.1MB). Peak memory consumption was 20.2MB. 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 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: 38.9s, 58 PlacesBefore, 36 PlacesAfterwards, 58 TransitionsBefore, 32 TransitionsAfterwards, 864 CoEnabledTransitionPairs, 4 FixpointIterations, 13 TrivialSequentialCompositions, 15 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 8 ConcurrentYvCompositions, 4 ChoiceCompositions, 43 TotalNumberOfCompositions, 2731 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 988, independent: 857, independent conditional: 0, independent unconditional: 857, dependent: 106, dependent conditional: 0, dependent unconditional: 106, unknown: 25, unknown conditional: 0, unknown unconditional: 25] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 541, independent: 486, independent conditional: 0, independent unconditional: 486, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 541, independent: 475, independent conditional: 0, independent unconditional: 475, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 66, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , SemanticIndependenceRelation.Query Time [ms]: [ total: 33443, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 971, dependent conditional: 0, dependent unconditional: 971, unknown: 32381, unknown conditional: 0, unknown unconditional: 32381] ], Cache Queries: [ total: 988, independent: 371, independent conditional: 0, independent unconditional: 371, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 551, unknown conditional: 0, unknown unconditional: 551] , Statistics on independence cache: Total cache size (in pairs): 110, Positive cache size: 85, Positive conditional cache size: 0, Positive unconditional cache size: 85, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, 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; [L1745] CALL, EXPR 0 my_drv_init() [L1739] 0 return 0; [L1745] RET, EXPR 0 my_drv_init() [L1745] 0 int ret = my_drv_init(); [L1746] COND TRUE 0 ret==0 [L1747] 0 int probe_ret; [L1748] 0 struct my_data data; [L1749] CALL 0 my_drv_probe(&data) [L1706] 0 struct device *d = &data->dev; [L1708] 0 data->shared.a = 0 [L1709] 0 data->shared.b = 0 [L1710] 0 int res = __VERIFIER_nondet_int(); [L1711] COND FALSE 0 !(\read(res)) [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={5:24}, d={5:24}, data={5:0}, data={5:0}, res=0, t1={3:0}, t2={4:0}] [L1689] 1 struct device *dev = (struct device*)arg; [L1690] 1 struct my_data *data; [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L1691] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} [L1691] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} [L1691] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [arg={5:24}, arg={5:24}, d={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, res=0, t1={3:0}, t2={4:0}] [L1716] 0 data->shared.a = 3 VAL [arg={5:24}, arg={5:24}, d={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, res=0, t1={3:0}, t2={4:0}] [L1694] 1 data->shared.a = 1 VAL [arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1={3:0}, t2={4:0}] [L1719] 0 data->shared.b = 3 VAL [arg={5:24}, arg={5:24}, d={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, res=0, t1={3:0}, t2={4:0}] [L1722] EXPR 0 data->shared.a [L1722] CALL 0 ldv_assert(data->shared.a==3) [L1675] COND TRUE 0 !expression [L1675] 0 reach_error() VAL [\old(expression)=0, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, expression=0, 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: 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 68 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: 40.8s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 39.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 277 IncrementalHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 0 mSDtfsCounter, 277 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=4, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 62 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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 11:31:09,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...