/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_11-equ_nr.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:12:16,244 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:12:16,331 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-NoLbe.epf [2023-12-05 21:12:16,364 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:12:16,365 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:12:16,365 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:12:16,366 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:12:16,366 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:12:16,366 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:12:16,370 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:12:16,370 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:12:16,371 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:12:16,371 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:12:16,372 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:12:16,372 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:12:16,372 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:12:16,373 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:12:16,373 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:12:16,373 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:12:16,373 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:12:16,373 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:12:16,374 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:12:16,374 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:12:16,374 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:12:16,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:12:16,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:12:16,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:12:16,376 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:12:16,376 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:12:16,377 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:12:16,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:12:16,378 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:12:16,378 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:12:16,378 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.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-12-05 21:12:16,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:12:16,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:12:16,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:12:16,620 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:12:16,620 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:12:16,622 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_11-equ_nr.i [2023-12-05 21:12:17,820 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:12:18,105 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:12:18,105 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_11-equ_nr.i [2023-12-05 21:12:18,123 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb5669c54/ee924350a98242cb82a6b4dbff2beb71/FLAGbe8257159 [2023-12-05 21:12:18,139 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb5669c54/ee924350a98242cb82a6b4dbff2beb71 [2023-12-05 21:12:18,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:12:18,143 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:12:18,146 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:12:18,146 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:12:18,151 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:12:18,152 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:12:18" (1/1) ... [2023-12-05 21:12:18,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6935e384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:18, skipping insertion in model container [2023-12-05 21:12:18,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:12:18" (1/1) ... [2023-12-05 21:12:18,208 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:12:18,655 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:12:18,670 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:12:18,723 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:12:18,786 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:12:18,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:18 WrapperNode [2023-12-05 21:12:18,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:12:18,789 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:12:18,789 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:12:18,789 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:12:18,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:18" (1/1) ... [2023-12-05 21:12:18,821 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:18" (1/1) ... [2023-12-05 21:12:18,850 INFO L138 Inliner]: procedures = 266, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 67 [2023-12-05 21:12:18,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:12:18,851 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:12:18,851 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:12:18,852 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:12:18,861 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:18" (1/1) ... [2023-12-05 21:12:18,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:18" (1/1) ... [2023-12-05 21:12:18,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:18" (1/1) ... [2023-12-05 21:12:18,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:18" (1/1) ... [2023-12-05 21:12:18,883 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:18" (1/1) ... [2023-12-05 21:12:18,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:18" (1/1) ... [2023-12-05 21:12:18,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:18" (1/1) ... [2023-12-05 21:12:18,887 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:18" (1/1) ... [2023-12-05 21:12:18,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:12:18,907 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:12:18,907 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:12:18,908 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:12:18,908 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:18" (1/1) ... [2023-12-05 21:12:18,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:12:18,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:12:18,943 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-12-05 21:12:18,994 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-12-05 21:12:19,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:12:19,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:12:19,013 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-05 21:12:19,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:12:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-05 21:12:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:12:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-12-05 21:12:19,014 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-12-05 21:12:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:12:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:12:19,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:12:19,015 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:12:19,141 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:12:19,143 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:12:19,378 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:12:19,396 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:12:19,397 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:12:19,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:12:19 BoogieIcfgContainer [2023-12-05 21:12:19,398 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:12:19,400 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:12:19,400 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:12:19,403 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:12:19,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:12:18" (1/3) ... [2023-12-05 21:12:19,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60db36e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:12:19, skipping insertion in model container [2023-12-05 21:12:19,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:12:18" (2/3) ... [2023-12-05 21:12:19,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60db36e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:12:19, skipping insertion in model container [2023-12-05 21:12:19,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:12:19" (3/3) ... [2023-12-05 21:12:19,406 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_11-equ_nr.i [2023-12-05 21:12:19,420 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:12:19,420 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-12-05 21:12:19,420 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:12:19,463 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:12:19,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 81 transitions, 166 flow [2023-12-05 21:12:19,563 INFO L124 PetriNetUnfolderBase]: 1/83 cut-off events. [2023-12-05 21:12:19,564 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:12:19,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 83 events. 1/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-12-05 21:12:19,567 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 81 transitions, 166 flow [2023-12-05 21:12:19,573 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 78 transitions, 159 flow [2023-12-05 21:12:19,590 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:12:19,600 INFO L362 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=true, 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;@57ba5374, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:12:19,600 INFO L363 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-12-05 21:12:19,618 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:12:19,618 INFO L124 PetriNetUnfolderBase]: 1/50 cut-off events. [2023-12-05 21:12:19,619 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:12:19,619 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:19,620 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:12:19,620 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-12-05 21:12:19,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:19,626 INFO L85 PathProgramCache]: Analyzing trace with hash -2059098200, now seen corresponding path program 1 times [2023-12-05 21:12:19,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:19,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729889783] [2023-12-05 21:12:19,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:19,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:20,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:20,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:20,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729889783] [2023-12-05 21:12:20,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729889783] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:20,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:20,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:12:20,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364823144] [2023-12-05 21:12:20,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:20,066 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:12:20,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:20,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:12:20,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:12:20,102 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 81 [2023-12-05 21:12:20,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 78 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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-12-05 21:12:20,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:20,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 81 [2023-12-05 21:12:20,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:20,213 INFO L124 PetriNetUnfolderBase]: 29/164 cut-off events. [2023-12-05 21:12:20,213 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:12:20,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 164 events. 29/164 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 462 event pairs, 16 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 179. Up to 44 conditions per place. [2023-12-05 21:12:20,216 INFO L140 encePairwiseOnDemand]: 78/81 looper letters, 19 selfloop transitions, 2 changer transitions 2/81 dead transitions. [2023-12-05 21:12:20,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 81 transitions, 211 flow [2023-12-05 21:12:20,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:12:20,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:12:20,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 207 transitions. [2023-12-05 21:12:20,232 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8518518518518519 [2023-12-05 21:12:20,232 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 207 transitions. [2023-12-05 21:12:20,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 207 transitions. [2023-12-05 21:12:20,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:20,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 207 transitions. [2023-12-05 21:12:20,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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-12-05 21:12:20,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 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-12-05 21:12:20,247 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 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-12-05 21:12:20,251 INFO L308 CegarLoopForPetriNet]: 81 programPoint places, 1 predicate places. [2023-12-05 21:12:20,251 INFO L500 AbstractCegarLoop]: Abstraction has has 82 places, 81 transitions, 211 flow [2023-12-05 21:12:20,252 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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-12-05 21:12:20,252 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:20,252 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:12:20,252 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:12:20,252 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-12-05 21:12:20,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:20,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1933066091, now seen corresponding path program 1 times [2023-12-05 21:12:20,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:20,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127224763] [2023-12-05 21:12:20,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:20,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:20,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:20,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:20,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127224763] [2023-12-05 21:12:20,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127224763] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:20,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:20,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:12:20,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654651972] [2023-12-05 21:12:20,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:20,414 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:12:20,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:20,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:12:20,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:12:20,416 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 81 [2023-12-05 21:12:20,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 81 transitions, 211 flow. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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-12-05 21:12:20,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:20,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 81 [2023-12-05 21:12:20,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:20,476 INFO L124 PetriNetUnfolderBase]: 39/190 cut-off events. [2023-12-05 21:12:20,476 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-12-05 21:12:20,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 190 events. 39/190 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 647 event pairs, 24 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 293. Up to 60 conditions per place. [2023-12-05 21:12:20,478 INFO L140 encePairwiseOnDemand]: 78/81 looper letters, 18 selfloop transitions, 2 changer transitions 4/84 dead transitions. [2023-12-05 21:12:20,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 84 transitions, 269 flow [2023-12-05 21:12:20,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:12:20,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:12:20,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2023-12-05 21:12:20,480 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8559670781893004 [2023-12-05 21:12:20,480 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 208 transitions. [2023-12-05 21:12:20,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 208 transitions. [2023-12-05 21:12:20,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:20,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 208 transitions. [2023-12-05 21:12:20,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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-12-05 21:12:20,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 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-12-05 21:12:20,483 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 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-12-05 21:12:20,484 INFO L308 CegarLoopForPetriNet]: 81 programPoint places, 2 predicate places. [2023-12-05 21:12:20,484 INFO L500 AbstractCegarLoop]: Abstraction has has 83 places, 84 transitions, 269 flow [2023-12-05 21:12:20,484 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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-12-05 21:12:20,484 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:20,484 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:12:20,485 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:12:20,485 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-12-05 21:12:20,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:20,485 INFO L85 PathProgramCache]: Analyzing trace with hash 625749, now seen corresponding path program 1 times [2023-12-05 21:12:20,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:20,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884709027] [2023-12-05 21:12:20,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:20,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:20,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:20,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:20,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884709027] [2023-12-05 21:12:20,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884709027] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:20,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:20,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:12:20,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197227973] [2023-12-05 21:12:20,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:20,814 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:12:20,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:20,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:12:20,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:12:20,816 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 81 [2023-12-05 21:12:20,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 84 transitions, 269 flow. Second operand has 6 states, 6 states have (on average 57.166666666666664) internal successors, (343), 6 states have internal predecessors, (343), 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-12-05 21:12:20,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:20,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 81 [2023-12-05 21:12:20,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:20,879 INFO L124 PetriNetUnfolderBase]: 33/171 cut-off events. [2023-12-05 21:12:20,879 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-12-05 21:12:20,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 171 events. 33/171 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 525 event pairs, 20 based on Foata normal form. 9/179 useless extension candidates. Maximal degree in co-relation 309. Up to 71 conditions per place. [2023-12-05 21:12:20,881 INFO L140 encePairwiseOnDemand]: 77/81 looper letters, 25 selfloop transitions, 3 changer transitions 4/82 dead transitions. [2023-12-05 21:12:20,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 82 transitions, 325 flow [2023-12-05 21:12:20,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-05 21:12:20,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-05 21:12:20,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 296 transitions. [2023-12-05 21:12:20,885 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7308641975308642 [2023-12-05 21:12:20,885 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 296 transitions. [2023-12-05 21:12:20,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 296 transitions. [2023-12-05 21:12:20,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:20,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 296 transitions. [2023-12-05 21:12:20,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 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-12-05 21:12:20,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 81.0) internal successors, (486), 6 states have internal predecessors, (486), 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-12-05 21:12:20,889 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 81.0) internal successors, (486), 6 states have internal predecessors, (486), 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-12-05 21:12:20,890 INFO L308 CegarLoopForPetriNet]: 81 programPoint places, 5 predicate places. [2023-12-05 21:12:20,890 INFO L500 AbstractCegarLoop]: Abstraction has has 86 places, 82 transitions, 325 flow [2023-12-05 21:12:20,891 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 57.166666666666664) internal successors, (343), 6 states have internal predecessors, (343), 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-12-05 21:12:20,891 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:20,891 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:12:20,891 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:12:20,892 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-12-05 21:12:20,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:20,893 INFO L85 PathProgramCache]: Analyzing trace with hash 625748, now seen corresponding path program 1 times [2023-12-05 21:12:20,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:20,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563287581] [2023-12-05 21:12:20,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:20,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:21,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:21,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:21,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563287581] [2023-12-05 21:12:21,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563287581] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:21,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:21,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:12:21,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469021304] [2023-12-05 21:12:21,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:21,102 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:12:21,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:21,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:12:21,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:12:21,105 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 81 [2023-12-05 21:12:21,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 82 transitions, 325 flow. Second operand has 6 states, 6 states have (on average 55.333333333333336) internal successors, (332), 6 states have internal predecessors, (332), 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-12-05 21:12:21,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:21,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 81 [2023-12-05 21:12:21,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:21,190 INFO L124 PetriNetUnfolderBase]: 28/169 cut-off events. [2023-12-05 21:12:21,190 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2023-12-05 21:12:21,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 169 events. 28/169 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 494 event pairs, 17 based on Foata normal form. 6/174 useless extension candidates. Maximal degree in co-relation 351. Up to 64 conditions per place. [2023-12-05 21:12:21,193 INFO L140 encePairwiseOnDemand]: 75/81 looper letters, 25 selfloop transitions, 4 changer transitions 6/83 dead transitions. [2023-12-05 21:12:21,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 83 transitions, 405 flow [2023-12-05 21:12:21,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 21:12:21,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 21:12:21,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 344 transitions. [2023-12-05 21:12:21,195 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7078189300411523 [2023-12-05 21:12:21,195 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 344 transitions. [2023-12-05 21:12:21,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 344 transitions. [2023-12-05 21:12:21,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:21,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 344 transitions. [2023-12-05 21:12:21,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 57.333333333333336) internal successors, (344), 6 states have internal predecessors, (344), 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-12-05 21:12:21,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 81.0) internal successors, (567), 7 states have internal predecessors, (567), 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-12-05 21:12:21,197 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 81.0) internal successors, (567), 7 states have internal predecessors, (567), 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-12-05 21:12:21,199 INFO L308 CegarLoopForPetriNet]: 81 programPoint places, 10 predicate places. [2023-12-05 21:12:21,199 INFO L500 AbstractCegarLoop]: Abstraction has has 91 places, 83 transitions, 405 flow [2023-12-05 21:12:21,200 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 55.333333333333336) internal successors, (332), 6 states have internal predecessors, (332), 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-12-05 21:12:21,200 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:21,200 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:12:21,200 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:12:21,200 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-12-05 21:12:21,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:21,202 INFO L85 PathProgramCache]: Analyzing trace with hash -26652603, now seen corresponding path program 1 times [2023-12-05 21:12:21,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:21,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558150902] [2023-12-05 21:12:21,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:21,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:21,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-12-05 21:12:21,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:21,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558150902] [2023-12-05 21:12:21,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558150902] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:21,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:21,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 21:12:21,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103831222] [2023-12-05 21:12:21,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:21,418 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 21:12:21,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:21,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 21:12:21,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-05 21:12:21,421 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 81 [2023-12-05 21:12:21,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 83 transitions, 405 flow. Second operand has 8 states, 8 states have (on average 45.125) internal successors, (361), 8 states have internal predecessors, (361), 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-12-05 21:12:21,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:21,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 81 [2023-12-05 21:12:21,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:21,609 INFO L124 PetriNetUnfolderBase]: 45/242 cut-off events. [2023-12-05 21:12:21,609 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2023-12-05 21:12:21,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 824 conditions, 242 events. 45/242 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 948 event pairs, 21 based on Foata normal form. 8/249 useless extension candidates. Maximal degree in co-relation 361. Up to 98 conditions per place. [2023-12-05 21:12:21,613 INFO L140 encePairwiseOnDemand]: 70/81 looper letters, 33 selfloop transitions, 6 changer transitions 28/102 dead transitions. [2023-12-05 21:12:21,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 102 transitions, 700 flow [2023-12-05 21:12:21,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 21:12:21,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 21:12:21,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 439 transitions. [2023-12-05 21:12:21,615 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6021947873799726 [2023-12-05 21:12:21,615 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 439 transitions. [2023-12-05 21:12:21,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 439 transitions. [2023-12-05 21:12:21,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:21,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 439 transitions. [2023-12-05 21:12:21,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 48.77777777777778) internal successors, (439), 9 states have internal predecessors, (439), 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-12-05 21:12:21,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 81.0) internal successors, (810), 10 states have internal predecessors, (810), 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-12-05 21:12:21,619 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 81.0) internal successors, (810), 10 states have internal predecessors, (810), 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-12-05 21:12:21,620 INFO L308 CegarLoopForPetriNet]: 81 programPoint places, 17 predicate places. [2023-12-05 21:12:21,621 INFO L500 AbstractCegarLoop]: Abstraction has has 98 places, 102 transitions, 700 flow [2023-12-05 21:12:21,621 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 45.125) internal successors, (361), 8 states have internal predecessors, (361), 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-12-05 21:12:21,621 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:21,621 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:12:21,622 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:12:21,622 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-12-05 21:12:21,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:21,623 INFO L85 PathProgramCache]: Analyzing trace with hash -26652602, now seen corresponding path program 1 times [2023-12-05 21:12:21,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:21,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039701568] [2023-12-05 21:12:21,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:21,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:21,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:21,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:21,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039701568] [2023-12-05 21:12:21,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039701568] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:21,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:21,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 21:12:21,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080757381] [2023-12-05 21:12:21,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:21,915 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 21:12:21,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:21,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 21:12:21,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-05 21:12:21,921 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 81 [2023-12-05 21:12:21,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 102 transitions, 700 flow. Second operand has 8 states, 8 states have (on average 46.0) internal successors, (368), 8 states have internal predecessors, (368), 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-12-05 21:12:21,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:21,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 81 [2023-12-05 21:12:21,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:22,095 INFO L124 PetriNetUnfolderBase]: 46/247 cut-off events. [2023-12-05 21:12:22,095 INFO L125 PetriNetUnfolderBase]: For 477/477 co-relation queries the response was YES. [2023-12-05 21:12:22,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 982 conditions, 247 events. 46/247 cut-off events. For 477/477 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 976 event pairs, 18 based on Foata normal form. 4/250 useless extension candidates. Maximal degree in co-relation 427. Up to 95 conditions per place. [2023-12-05 21:12:22,096 INFO L140 encePairwiseOnDemand]: 72/81 looper letters, 24 selfloop transitions, 4 changer transitions 46/106 dead transitions. [2023-12-05 21:12:22,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 106 transitions, 880 flow [2023-12-05 21:12:22,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 21:12:22,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 21:12:22,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 441 transitions. [2023-12-05 21:12:22,099 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6049382716049383 [2023-12-05 21:12:22,099 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 441 transitions. [2023-12-05 21:12:22,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 441 transitions. [2023-12-05 21:12:22,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:22,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 441 transitions. [2023-12-05 21:12:22,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 49.0) internal successors, (441), 9 states have internal predecessors, (441), 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-12-05 21:12:22,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 81.0) internal successors, (810), 10 states have internal predecessors, (810), 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-12-05 21:12:22,102 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 81.0) internal successors, (810), 10 states have internal predecessors, (810), 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-12-05 21:12:22,104 INFO L308 CegarLoopForPetriNet]: 81 programPoint places, 25 predicate places. [2023-12-05 21:12:22,104 INFO L500 AbstractCegarLoop]: Abstraction has has 106 places, 106 transitions, 880 flow [2023-12-05 21:12:22,104 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 46.0) internal successors, (368), 8 states have internal predecessors, (368), 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-12-05 21:12:22,104 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:22,104 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:12:22,105 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:12:22,105 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-12-05 21:12:22,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:22,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1957062567, now seen corresponding path program 1 times [2023-12-05 21:12:22,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:22,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979109592] [2023-12-05 21:12:22,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:22,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:22,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:22,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:22,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979109592] [2023-12-05 21:12:22,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979109592] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:22,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:22,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 21:12:22,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659649642] [2023-12-05 21:12:22,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:22,293 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 21:12:22,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:22,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 21:12:22,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-05 21:12:22,295 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 81 [2023-12-05 21:12:22,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 106 transitions, 880 flow. Second operand has 8 states, 8 states have (on average 47.0) internal successors, (376), 8 states have internal predecessors, (376), 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-12-05 21:12:22,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:22,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 81 [2023-12-05 21:12:22,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:22,470 INFO L124 PetriNetUnfolderBase]: 43/232 cut-off events. [2023-12-05 21:12:22,471 INFO L125 PetriNetUnfolderBase]: For 636/636 co-relation queries the response was YES. [2023-12-05 21:12:22,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 232 events. 43/232 cut-off events. For 636/636 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 861 event pairs, 9 based on Foata normal form. 4/235 useless extension candidates. Maximal degree in co-relation 437. Up to 92 conditions per place. [2023-12-05 21:12:22,472 INFO L140 encePairwiseOnDemand]: 73/81 looper letters, 23 selfloop transitions, 4 changer transitions 49/108 dead transitions. [2023-12-05 21:12:22,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 108 transitions, 1048 flow [2023-12-05 21:12:22,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 21:12:22,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 21:12:22,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 454 transitions. [2023-12-05 21:12:22,474 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6227709190672154 [2023-12-05 21:12:22,474 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 454 transitions. [2023-12-05 21:12:22,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 454 transitions. [2023-12-05 21:12:22,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:22,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 454 transitions. [2023-12-05 21:12:22,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 50.44444444444444) internal successors, (454), 9 states have internal predecessors, (454), 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-12-05 21:12:22,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 81.0) internal successors, (810), 10 states have internal predecessors, (810), 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-12-05 21:12:22,477 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 81.0) internal successors, (810), 10 states have internal predecessors, (810), 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-12-05 21:12:22,478 INFO L308 CegarLoopForPetriNet]: 81 programPoint places, 32 predicate places. [2023-12-05 21:12:22,478 INFO L500 AbstractCegarLoop]: Abstraction has has 113 places, 108 transitions, 1048 flow [2023-12-05 21:12:22,478 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 47.0) internal successors, (376), 8 states have internal predecessors, (376), 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-12-05 21:12:22,478 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:12:22,478 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:12:22,478 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:12:22,479 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-12-05 21:12:22,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:12:22,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1957062566, now seen corresponding path program 1 times [2023-12-05 21:12:22,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:12:22,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072132439] [2023-12-05 21:12:22,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:12:22,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:12:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:12:22,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:12:22,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:12:22,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072132439] [2023-12-05 21:12:22,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072132439] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:12:22,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:12:22,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 21:12:22,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512152471] [2023-12-05 21:12:22,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:12:22,686 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 21:12:22,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:12:22,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 21:12:22,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-05 21:12:22,688 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 81 [2023-12-05 21:12:22,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 108 transitions, 1048 flow. Second operand has 8 states, 8 states have (on average 46.0) internal successors, (368), 8 states have internal predecessors, (368), 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-12-05 21:12:22,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:12:22,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 81 [2023-12-05 21:12:22,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:12:22,848 INFO L124 PetriNetUnfolderBase]: 40/221 cut-off events. [2023-12-05 21:12:22,848 INFO L125 PetriNetUnfolderBase]: For 832/832 co-relation queries the response was YES. [2023-12-05 21:12:22,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 221 events. 40/221 cut-off events. For 832/832 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 785 event pairs, 6 based on Foata normal form. 4/224 useless extension candidates. Maximal degree in co-relation 475. Up to 85 conditions per place. [2023-12-05 21:12:22,849 INFO L140 encePairwiseOnDemand]: 73/81 looper letters, 0 selfloop transitions, 0 changer transitions 111/111 dead transitions. [2023-12-05 21:12:22,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 111 transitions, 1242 flow [2023-12-05 21:12:22,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-05 21:12:22,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-05 21:12:22,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 396 transitions. [2023-12-05 21:12:22,851 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2023-12-05 21:12:22,852 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 396 transitions. [2023-12-05 21:12:22,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 396 transitions. [2023-12-05 21:12:22,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:12:22,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 396 transitions. [2023-12-05 21:12:22,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 49.5) internal successors, (396), 8 states have internal predecessors, (396), 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-12-05 21:12:22,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 81.0) internal successors, (729), 9 states have internal predecessors, (729), 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-12-05 21:12:22,860 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 81.0) internal successors, (729), 9 states have internal predecessors, (729), 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-12-05 21:12:22,862 INFO L308 CegarLoopForPetriNet]: 81 programPoint places, 38 predicate places. [2023-12-05 21:12:22,864 INFO L500 AbstractCegarLoop]: Abstraction has has 119 places, 111 transitions, 1242 flow [2023-12-05 21:12:22,865 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 46.0) internal successors, (368), 8 states have internal predecessors, (368), 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-12-05 21:12:22,872 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/06-symbeq_11-equ_nr.i_BEv2_AllErrorsAtOnce [2023-12-05 21:12:22,905 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 9 remaining) [2023-12-05 21:12:22,906 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 9 remaining) [2023-12-05 21:12:22,906 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2023-12-05 21:12:22,906 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2023-12-05 21:12:22,906 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2023-12-05 21:12:22,906 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2023-12-05 21:12:22,906 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 9 remaining) [2023-12-05 21:12:22,907 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 9 remaining) [2023-12-05 21:12:22,907 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 9 remaining) [2023-12-05 21:12:22,907 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:12:22,907 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:12:22,916 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:12:22,916 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:12:22,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:12:22 BasicIcfg [2023-12-05 21:12:22,924 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:12:22,924 INFO L158 Benchmark]: Toolchain (without parser) took 4781.17ms. Allocated memory is still 311.4MB. Free memory was 253.5MB in the beginning and 227.1MB in the end (delta: 26.5MB). Peak memory consumption was 27.0MB. Max. memory is 8.0GB. [2023-12-05 21:12:22,924 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 196.1MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:12:22,925 INFO L158 Benchmark]: CACSL2BoogieTranslator took 641.19ms. Allocated memory is still 311.4MB. Free memory was 253.0MB in the beginning and 225.1MB in the end (delta: 27.9MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2023-12-05 21:12:22,925 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.16ms. Allocated memory is still 311.4MB. Free memory was 225.1MB in the beginning and 223.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:12:22,925 INFO L158 Benchmark]: Boogie Preprocessor took 55.33ms. Allocated memory is still 311.4MB. Free memory was 222.6MB in the beginning and 221.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:12:22,925 INFO L158 Benchmark]: RCFGBuilder took 491.05ms. Allocated memory is still 311.4MB. Free memory was 221.0MB in the beginning and 204.8MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-05 21:12:22,926 INFO L158 Benchmark]: TraceAbstraction took 3523.63ms. Allocated memory is still 311.4MB. Free memory was 203.7MB in the beginning and 227.1MB in the end (delta: -23.3MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:12:22,930 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.14ms. Allocated memory is still 196.1MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 641.19ms. Allocated memory is still 311.4MB. Free memory was 253.0MB in the beginning and 225.1MB in the end (delta: 27.9MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.16ms. Allocated memory is still 311.4MB. Free memory was 225.1MB in the beginning and 223.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.33ms. Allocated memory is still 311.4MB. Free memory was 222.6MB in the beginning and 221.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 491.05ms. Allocated memory is still 311.4MB. Free memory was 221.0MB in the beginning and 204.8MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 3523.63ms. Allocated memory is still 311.4MB. Free memory was 203.7MB in the beginning and 227.1MB in the end (delta: -23.3MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 92 locations, 9 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: 3.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 444 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 444 mSDsluCounter, 117 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 595 IncrementalHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 68 mSDtfsCounter, 595 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1242occurred in iteration=8, InterpolantAutomatonStates: 52, 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, 1.7s InterpolantComputationTime, 394 NumberOfCodeBlocks, 394 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 386 ConstructedInterpolants, 0 QuantifiedInterpolants, 3451 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 21:12:22,951 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...