/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:58:29,420 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:58:29,474 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 21:58:29,480 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:58:29,480 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:58:29,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:58:29,503 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:58:29,503 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:58:29,503 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:58:29,503 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:58:29,503 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:58:29,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:58:29,503 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:58:29,503 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:58:29,504 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:58:29,504 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:58:29,504 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:58:29,505 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:58:29,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:58:29,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:58:29,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:58:29,505 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:58:29,506 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:58:29,506 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:58:29,506 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:58:29,506 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:58:29,506 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:58:29,506 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:58:29,506 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:58:29,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:58:29,506 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:58:29,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:58:29,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:58:29,506 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:58:29,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:58:29,506 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:58:29,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:58:29,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:58:29,507 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:58:29,507 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:58:29,507 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:58:29,507 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:58:29,507 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:58:29,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:58:29,507 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:58:29,507 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:58:29,507 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:58:29,507 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 21:58:29,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:58:29,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:58:29,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:58:29,717 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:58:29,718 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:58:29,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i [2025-04-13 21:58:30,993 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f78ed1e2/e5fc513166ea462081255c6e31806a7c/FLAG382036f05 [2025-04-13 21:58:31,218 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:58:31,219 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i [2025-04-13 21:58:31,227 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f78ed1e2/e5fc513166ea462081255c6e31806a7c/FLAG382036f05 [2025-04-13 21:58:31,994 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f78ed1e2/e5fc513166ea462081255c6e31806a7c [2025-04-13 21:58:31,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:58:31,997 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:58:31,998 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:58:31,998 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:58:32,001 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:58:32,001 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:58:31" (1/1) ... [2025-04-13 21:58:32,002 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cc4e5d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:32, skipping insertion in model container [2025-04-13 21:58:32,002 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:58:31" (1/1) ... [2025-04-13 21:58:32,029 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:58:32,145 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i[1092,1105] [2025-04-13 21:58:32,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:58:32,256 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:58:32,271 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i[1092,1105] [2025-04-13 21:58:32,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:58:32,346 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:58:32,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:32 WrapperNode [2025-04-13 21:58:32,347 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:58:32,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:58:32,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:58:32,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:58:32,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:32" (1/1) ... [2025-04-13 21:58:32,364 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:32" (1/1) ... [2025-04-13 21:58:32,380 INFO L138 Inliner]: procedures = 165, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 137 [2025-04-13 21:58:32,380 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:58:32,380 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:58:32,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:58:32,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:58:32,389 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:32" (1/1) ... [2025-04-13 21:58:32,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:32" (1/1) ... [2025-04-13 21:58:32,391 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:32" (1/1) ... [2025-04-13 21:58:32,402 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 5, 5]. 42 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 0 writes are split as follows [0, 0, 0]. [2025-04-13 21:58:32,403 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:32" (1/1) ... [2025-04-13 21:58:32,403 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:32" (1/1) ... [2025-04-13 21:58:32,406 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:32" (1/1) ... [2025-04-13 21:58:32,407 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:32" (1/1) ... [2025-04-13 21:58:32,408 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:32" (1/1) ... [2025-04-13 21:58:32,408 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:32" (1/1) ... [2025-04-13 21:58:32,411 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:58:32,412 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 21:58:32,412 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 21:58:32,412 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 21:58:32,412 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:32" (1/1) ... [2025-04-13 21:58:32,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:58:32,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:58:32,436 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 21:58:32,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 21:58:32,451 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-04-13 21:58:32,452 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-04-13 21:58:32,452 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 21:58:32,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:58:32,452 INFO L130 BoogieDeclarations]: Found specification of procedure t3_fun [2025-04-13 21:58:32,452 INFO L138 BoogieDeclarations]: Found implementation of procedure t3_fun [2025-04-13 21:58:32,452 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-13 21:58:32,452 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-13 21:58:32,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:58:32,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 21:58:32,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 21:58:32,452 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 21:58:32,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:58:32,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:58:32,453 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 21:58:32,568 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 21:58:32,569 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:58:32,776 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:58:32,777 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:58:32,777 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 21:58:32,961 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:58:32,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:58:32 BoogieIcfgContainer [2025-04-13 21:58:32,961 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 21:58:32,964 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:58:32,964 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:58:32,983 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:58:32,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:58:31" (1/3) ... [2025-04-13 21:58:32,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8333d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:58:32, skipping insertion in model container [2025-04-13 21:58:32,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:32" (2/3) ... [2025-04-13 21:58:32,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8333d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:58:32, skipping insertion in model container [2025-04-13 21:58:32,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:58:32" (3/3) ... [2025-04-13 21:58:32,984 INFO L128 eAbstractionObserver]: Analyzing ICFG 36-apron_21-traces-cluster-based_true.i [2025-04-13 21:58:32,996 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:58:32,997 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 36-apron_21-traces-cluster-based_true.i that has 4 procedures, 50 locations, 47 edges, 1 initial locations, 0 loop locations, and 4 error locations. [2025-04-13 21:58:32,997 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:58:33,045 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:58:33,070 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 59 places, 50 transitions, 112 flow [2025-04-13 21:58:33,453 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 13148 states, 13137 states have (on average 3.6693308974651746) internal successors, (48204), 13147 states have internal predecessors, (48204), 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) [2025-04-13 21:58:33,473 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:58:33,482 INFO L340 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, 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;@20ed7b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:58:33,482 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-13 21:58:33,512 INFO L278 IsEmpty]: Start isEmpty. Operand has 13148 states, 13137 states have (on average 3.6693308974651746) internal successors, (48204), 13147 states have internal predecessors, (48204), 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) [2025-04-13 21:58:33,517 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-13 21:58:33,518 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:33,518 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:33,519 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-13 21:58:33,523 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:33,523 INFO L85 PathProgramCache]: Analyzing trace with hash -2032050752, now seen corresponding path program 1 times [2025-04-13 21:58:33,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:33,528 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655542936] [2025-04-13 21:58:33,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:58:33,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:33,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 21:58:33,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 21:58:33,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:58:33,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:33,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:58:33,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:33,837 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655542936] [2025-04-13 21:58:33,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655542936] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:58:33,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:58:33,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:58:33,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849299225] [2025-04-13 21:58:33,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:58:33,843 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:58:33,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:33,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:58:33,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:58:33,881 INFO L87 Difference]: Start difference. First operand has 13148 states, 13137 states have (on average 3.6693308974651746) internal successors, (48204), 13147 states have internal predecessors, (48204), 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) Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2025-04-13 21:58:34,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:34,361 INFO L93 Difference]: Finished difference Result 15963 states and 57723 transitions. [2025-04-13 21:58:34,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:58:34,363 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Word has length 9 [2025-04-13 21:58:34,363 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:34,498 INFO L225 Difference]: With dead ends: 15963 [2025-04-13 21:58:34,498 INFO L226 Difference]: Without dead ends: 14054 [2025-04-13 21:58:34,512 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:58:34,513 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 96 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:34,514 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 26 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:58:34,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14054 states. [2025-04-13 21:58:35,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14054 to 13655. [2025-04-13 21:58:35,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13655 states, 13644 states have (on average 3.61492231017297) internal successors, (49322), 13654 states have internal predecessors, (49322), 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) [2025-04-13 21:58:35,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13655 states to 13655 states and 49322 transitions. [2025-04-13 21:58:35,206 INFO L79 Accepts]: Start accepts. Automaton has 13655 states and 49322 transitions. Word has length 9 [2025-04-13 21:58:35,207 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:35,207 INFO L485 AbstractCegarLoop]: Abstraction has 13655 states and 49322 transitions. [2025-04-13 21:58:35,208 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2025-04-13 21:58:35,208 INFO L278 IsEmpty]: Start isEmpty. Operand 13655 states and 49322 transitions. [2025-04-13 21:58:35,211 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 21:58:35,211 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:35,211 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:35,211 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:58:35,211 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-13 21:58:35,212 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:35,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1584562821, now seen corresponding path program 1 times [2025-04-13 21:58:35,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:35,212 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143763066] [2025-04-13 21:58:35,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:58:35,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:35,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 21:58:35,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 21:58:35,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:58:35,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:35,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:58:35,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:35,381 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143763066] [2025-04-13 21:58:35,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143763066] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:58:35,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:58:35,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:58:35,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910587661] [2025-04-13 21:58:35,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:58:35,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:58:35,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:35,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:58:35,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:58:35,384 INFO L87 Difference]: Start difference. First operand 13655 states and 49322 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) [2025-04-13 21:58:35,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:35,641 INFO L93 Difference]: Finished difference Result 16265 states and 58514 transitions. [2025-04-13 21:58:35,641 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:58:35,642 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Word has length 11 [2025-04-13 21:58:35,642 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:35,706 INFO L225 Difference]: With dead ends: 16265 [2025-04-13 21:58:35,706 INFO L226 Difference]: Without dead ends: 13715 [2025-04-13 21:58:35,716 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:58:35,717 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 80 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:35,717 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 25 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:58:35,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13715 states. [2025-04-13 21:58:36,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13715 to 13505. [2025-04-13 21:58:36,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13505 states, 13498 states have (on average 3.5869017632241813) internal successors, (48416), 13504 states have internal predecessors, (48416), 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) [2025-04-13 21:58:36,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13505 states to 13505 states and 48416 transitions. [2025-04-13 21:58:36,229 INFO L79 Accepts]: Start accepts. Automaton has 13505 states and 48416 transitions. Word has length 11 [2025-04-13 21:58:36,230 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:36,230 INFO L485 AbstractCegarLoop]: Abstraction has 13505 states and 48416 transitions. [2025-04-13 21:58:36,230 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) [2025-04-13 21:58:36,230 INFO L278 IsEmpty]: Start isEmpty. Operand 13505 states and 48416 transitions. [2025-04-13 21:58:36,238 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 21:58:36,238 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:36,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:36,238 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:58:36,238 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-13 21:58:36,241 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:36,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1861839045, now seen corresponding path program 1 times [2025-04-13 21:58:36,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:36,241 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476806731] [2025-04-13 21:58:36,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:58:36,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:36,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:58:36,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:58:36,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:58:36,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:36,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:58:36,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:36,398 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476806731] [2025-04-13 21:58:36,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476806731] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:58:36,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:58:36,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:58:36,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794933115] [2025-04-13 21:58:36,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:58:36,398 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:58:36,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:36,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:58:36,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:58:36,399 INFO L87 Difference]: Start difference. First operand 13505 states and 48416 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) [2025-04-13 21:58:36,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:36,634 INFO L93 Difference]: Finished difference Result 18179 states and 65129 transitions. [2025-04-13 21:58:36,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:58:36,635 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) Word has length 15 [2025-04-13 21:58:36,635 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:36,714 INFO L225 Difference]: With dead ends: 18179 [2025-04-13 21:58:36,714 INFO L226 Difference]: Without dead ends: 15213 [2025-04-13 21:58:36,726 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:58:36,727 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 70 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:36,727 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 24 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:58:36,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15213 states. [2025-04-13 21:58:37,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15213 to 15213. [2025-04-13 21:58:37,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15213 states, 15206 states have (on average 3.5582664737603578) internal successors, (54107), 15212 states have internal predecessors, (54107), 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) [2025-04-13 21:58:37,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15213 states to 15213 states and 54107 transitions. [2025-04-13 21:58:37,193 INFO L79 Accepts]: Start accepts. Automaton has 15213 states and 54107 transitions. Word has length 15 [2025-04-13 21:58:37,193 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:37,194 INFO L485 AbstractCegarLoop]: Abstraction has 15213 states and 54107 transitions. [2025-04-13 21:58:37,194 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) [2025-04-13 21:58:37,194 INFO L278 IsEmpty]: Start isEmpty. Operand 15213 states and 54107 transitions. [2025-04-13 21:58:37,200 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 21:58:37,200 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:37,200 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:37,200 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:58:37,200 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-13 21:58:37,200 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:37,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1034499937, now seen corresponding path program 1 times [2025-04-13 21:58:37,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:37,201 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510628838] [2025-04-13 21:58:37,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:58:37,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:37,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 21:58:37,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:58:37,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:58:37,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:37,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:58:37,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:37,272 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510628838] [2025-04-13 21:58:37,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510628838] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:58:37,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:58:37,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:58:37,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111631577] [2025-04-13 21:58:37,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:58:37,273 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:58:37,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:37,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:58:37,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:58:37,274 INFO L87 Difference]: Start difference. First operand 15213 states and 54107 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:37,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:37,557 INFO L93 Difference]: Finished difference Result 26729 states and 93087 transitions. [2025-04-13 21:58:37,560 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:58:37,561 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 21:58:37,561 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:37,609 INFO L225 Difference]: With dead ends: 26729 [2025-04-13 21:58:37,610 INFO L226 Difference]: Without dead ends: 12282 [2025-04-13 21:58:37,637 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:58:37,639 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:37,640 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 18 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:58:37,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12282 states. [2025-04-13 21:58:37,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12282 to 11246. [2025-04-13 21:58:37,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11246 states, 11228 states have (on average 3.1996793729960813) internal successors, (35926), 11245 states have internal predecessors, (35926), 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) [2025-04-13 21:58:37,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11246 states to 11246 states and 35926 transitions. [2025-04-13 21:58:37,975 INFO L79 Accepts]: Start accepts. Automaton has 11246 states and 35926 transitions. Word has length 16 [2025-04-13 21:58:37,975 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:37,975 INFO L485 AbstractCegarLoop]: Abstraction has 11246 states and 35926 transitions. [2025-04-13 21:58:37,976 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:37,976 INFO L278 IsEmpty]: Start isEmpty. Operand 11246 states and 35926 transitions. [2025-04-13 21:58:37,978 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 21:58:37,978 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:37,978 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:37,978 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 21:58:37,979 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-13 21:58:37,980 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:37,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1838343419, now seen corresponding path program 1 times [2025-04-13 21:58:37,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:37,981 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833221184] [2025-04-13 21:58:37,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:58:37,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:37,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 21:58:37,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:58:38,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:58:38,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:38,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:58:38,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:38,132 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833221184] [2025-04-13 21:58:38,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833221184] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:58:38,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:58:38,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:58:38,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029664890] [2025-04-13 21:58:38,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:58:38,132 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:58:38,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:38,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:58:38,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:58:38,133 INFO L87 Difference]: Start difference. First operand 11246 states and 35926 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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) [2025-04-13 21:58:38,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:38,264 INFO L93 Difference]: Finished difference Result 15298 states and 48444 transitions. [2025-04-13 21:58:38,265 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:58:38,265 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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) Word has length 17 [2025-04-13 21:58:38,265 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:38,297 INFO L225 Difference]: With dead ends: 15298 [2025-04-13 21:58:38,297 INFO L226 Difference]: Without dead ends: 5130 [2025-04-13 21:58:38,311 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:58:38,312 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 43 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:38,312 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 9 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:58:38,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5130 states. [2025-04-13 21:58:38,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5130 to 5026. [2025-04-13 21:58:38,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5026 states, 5013 states have (on average 2.907241172950329) internal successors, (14574), 5025 states have internal predecessors, (14574), 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) [2025-04-13 21:58:38,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5026 states to 5026 states and 14574 transitions. [2025-04-13 21:58:38,402 INFO L79 Accepts]: Start accepts. Automaton has 5026 states and 14574 transitions. Word has length 17 [2025-04-13 21:58:38,403 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:38,403 INFO L485 AbstractCegarLoop]: Abstraction has 5026 states and 14574 transitions. [2025-04-13 21:58:38,403 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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) [2025-04-13 21:58:38,403 INFO L278 IsEmpty]: Start isEmpty. Operand 5026 states and 14574 transitions. [2025-04-13 21:58:38,405 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:58:38,407 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:38,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:38,407 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 21:58:38,407 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-13 21:58:38,407 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:38,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1995764968, now seen corresponding path program 1 times [2025-04-13 21:58:38,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:38,409 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167385275] [2025-04-13 21:58:38,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:58:38,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:38,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:58:38,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:58:38,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:58:38,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:38,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:58:38,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:38,497 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167385275] [2025-04-13 21:58:38,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167385275] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:58:38,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:58:38,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:58:38,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149882184] [2025-04-13 21:58:38,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:58:38,497 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:58:38,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:38,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:58:38,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:58:38,498 INFO L87 Difference]: Start difference. First operand 5026 states and 14574 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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) [2025-04-13 21:58:38,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:38,678 INFO L93 Difference]: Finished difference Result 5026 states and 14574 transitions. [2025-04-13 21:58:38,678 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:58:38,679 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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) Word has length 19 [2025-04-13 21:58:38,679 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:38,709 INFO L225 Difference]: With dead ends: 5026 [2025-04-13 21:58:38,709 INFO L226 Difference]: Without dead ends: 3842 [2025-04-13 21:58:38,712 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 21:58:38,712 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 109 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:38,712 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 35 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:58:38,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3842 states. [2025-04-13 21:58:38,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3842 to 3462. [2025-04-13 21:58:38,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3462 states, 3455 states have (on average 2.8619392185238786) internal successors, (9888), 3461 states have internal predecessors, (9888), 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) [2025-04-13 21:58:38,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3462 states to 3462 states and 9888 transitions. [2025-04-13 21:58:38,850 INFO L79 Accepts]: Start accepts. Automaton has 3462 states and 9888 transitions. Word has length 19 [2025-04-13 21:58:38,851 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:38,851 INFO L485 AbstractCegarLoop]: Abstraction has 3462 states and 9888 transitions. [2025-04-13 21:58:38,851 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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) [2025-04-13 21:58:38,851 INFO L278 IsEmpty]: Start isEmpty. Operand 3462 states and 9888 transitions. [2025-04-13 21:58:38,854 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 21:58:38,854 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:38,854 INFO L218 NwaCegarLoop]: 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] [2025-04-13 21:58:38,854 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 21:58:38,855 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-13 21:58:38,855 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:38,855 INFO L85 PathProgramCache]: Analyzing trace with hash 415172062, now seen corresponding path program 1 times [2025-04-13 21:58:38,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:38,855 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133451940] [2025-04-13 21:58:38,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:58:38,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:38,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 21:58:38,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 21:58:38,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:58:38,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:38,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:58:38,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:38,961 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133451940] [2025-04-13 21:58:38,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133451940] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:58:38,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:58:38,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:58:38,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325860397] [2025-04-13 21:58:38,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:58:38,962 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:58:38,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:38,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:58:38,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:58:38,962 INFO L87 Difference]: Start difference. First operand 3462 states and 9888 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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) [2025-04-13 21:58:39,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:39,149 INFO L93 Difference]: Finished difference Result 3566 states and 10140 transitions. [2025-04-13 21:58:39,150 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 21:58:39,150 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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) Word has length 23 [2025-04-13 21:58:39,150 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:39,172 INFO L225 Difference]: With dead ends: 3566 [2025-04-13 21:58:39,172 INFO L226 Difference]: Without dead ends: 2942 [2025-04-13 21:58:39,174 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 21:58:39,174 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 112 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:39,175 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 30 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:58:39,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2025-04-13 21:58:39,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 2942. [2025-04-13 21:58:39,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2942 states, 2940 states have (on average 2.814965986394558) internal successors, (8276), 2941 states have internal predecessors, (8276), 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) [2025-04-13 21:58:39,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2942 states to 2942 states and 8276 transitions. [2025-04-13 21:58:39,234 INFO L79 Accepts]: Start accepts. Automaton has 2942 states and 8276 transitions. Word has length 23 [2025-04-13 21:58:39,234 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:39,234 INFO L485 AbstractCegarLoop]: Abstraction has 2942 states and 8276 transitions. [2025-04-13 21:58:39,235 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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) [2025-04-13 21:58:39,235 INFO L278 IsEmpty]: Start isEmpty. Operand 2942 states and 8276 transitions. [2025-04-13 21:58:39,239 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 21:58:39,239 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:39,239 INFO L218 NwaCegarLoop]: 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] [2025-04-13 21:58:39,239 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 21:58:39,239 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-13 21:58:39,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:39,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1213439648, now seen corresponding path program 1 times [2025-04-13 21:58:39,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:39,240 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411338335] [2025-04-13 21:58:39,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:58:39,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:39,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 21:58:39,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 21:58:39,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:58:39,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:39,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:58:39,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:39,358 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411338335] [2025-04-13 21:58:39,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411338335] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:58:39,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:58:39,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:58:39,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323074968] [2025-04-13 21:58:39,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:58:39,358 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:58:39,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:39,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:58:39,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:58:39,359 INFO L87 Difference]: Start difference. First operand 2942 states and 8276 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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) [2025-04-13 21:58:39,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:39,535 INFO L93 Difference]: Finished difference Result 2942 states and 8276 transitions. [2025-04-13 21:58:39,536 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 21:58:39,536 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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) Word has length 27 [2025-04-13 21:58:39,536 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:39,556 INFO L225 Difference]: With dead ends: 2942 [2025-04-13 21:58:39,556 INFO L226 Difference]: Without dead ends: 558 [2025-04-13 21:58:39,560 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 21:58:39,560 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 103 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:39,560 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 30 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:58:39,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-04-13 21:58:39,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2025-04-13 21:58:39,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 557 states have (on average 2.5421903052064634) internal successors, (1416), 557 states have internal predecessors, (1416), 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) [2025-04-13 21:58:39,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 1416 transitions. [2025-04-13 21:58:39,583 INFO L79 Accepts]: Start accepts. Automaton has 558 states and 1416 transitions. Word has length 27 [2025-04-13 21:58:39,583 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:39,583 INFO L485 AbstractCegarLoop]: Abstraction has 558 states and 1416 transitions. [2025-04-13 21:58:39,583 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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) [2025-04-13 21:58:39,584 INFO L278 IsEmpty]: Start isEmpty. Operand 558 states and 1416 transitions. [2025-04-13 21:58:39,585 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 21:58:39,585 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:39,585 INFO L218 NwaCegarLoop]: 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] [2025-04-13 21:58:39,585 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 21:58:39,585 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-13 21:58:39,585 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:39,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1069692762, now seen corresponding path program 1 times [2025-04-13 21:58:39,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:39,585 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134449980] [2025-04-13 21:58:39,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:58:39,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:39,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 21:58:39,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 21:58:39,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:58:39,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:39,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:58:39,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:39,699 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134449980] [2025-04-13 21:58:39,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134449980] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:58:39,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:58:39,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:58:39,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284708533] [2025-04-13 21:58:39,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:58:39,699 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:58:39,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:39,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:58:39,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:58:39,700 INFO L87 Difference]: Start difference. First operand 558 states and 1416 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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) [2025-04-13 21:58:39,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:39,736 INFO L93 Difference]: Finished difference Result 574 states and 1448 transitions. [2025-04-13 21:58:39,736 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:58:39,736 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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) Word has length 31 [2025-04-13 21:58:39,737 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:39,751 INFO L225 Difference]: With dead ends: 574 [2025-04-13 21:58:39,751 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 21:58:39,752 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:58:39,753 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 18 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:39,753 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 7 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 21:58:39,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 21:58:39,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 21:58:39,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2025-04-13 21:58:39,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 21:58:39,767 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2025-04-13 21:58:39,767 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:39,767 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 21:58:39,767 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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) [2025-04-13 21:58:39,767 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 21:58:39,767 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 21:58:39,769 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2025-04-13 21:58:39,769 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2025-04-13 21:58:39,769 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2025-04-13 21:58:39,769 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 9 remaining) [2025-04-13 21:58:39,769 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2025-04-13 21:58:39,769 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2025-04-13 21:58:39,769 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2025-04-13 21:58:39,769 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2025-04-13 21:58:39,769 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2025-04-13 21:58:39,770 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 21:58:39,772 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:39,775 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:58:39,775 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:58:39,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:58:39 BasicIcfg [2025-04-13 21:58:39,778 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:58:39,778 INFO L158 Benchmark]: Toolchain (without parser) took 7780.93ms. Allocated memory was 155.2MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 108.3MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 632.2MB. Max. memory is 8.0GB. [2025-04-13 21:58:39,778 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:58:39,778 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.24ms. Allocated memory is still 155.2MB. Free memory was 108.3MB in the beginning and 84.9MB in the end (delta: 23.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 21:58:39,778 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.40ms. Allocated memory is still 155.2MB. Free memory was 84.9MB in the beginning and 82.7MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:58:39,778 INFO L158 Benchmark]: Boogie Preprocessor took 30.79ms. Allocated memory is still 155.2MB. Free memory was 82.7MB in the beginning and 80.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:58:39,779 INFO L158 Benchmark]: IcfgBuilder took 551.02ms. Allocated memory is still 155.2MB. Free memory was 80.7MB in the beginning and 26.8MB in the end (delta: 53.9MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. [2025-04-13 21:58:39,779 INFO L158 Benchmark]: TraceAbstraction took 6813.64ms. Allocated memory was 155.2MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 26.3MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 552.5MB. Max. memory is 8.0GB. [2025-04-13 21:58:39,780 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.18ms. Allocated memory is still 159.4MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 349.24ms. Allocated memory is still 155.2MB. Free memory was 108.3MB in the beginning and 84.9MB in the end (delta: 23.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.40ms. Allocated memory is still 155.2MB. Free memory was 84.9MB in the beginning and 82.7MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.79ms. Allocated memory is still 155.2MB. Free memory was 82.7MB in the beginning and 80.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 551.02ms. Allocated memory is still 155.2MB. Free memory was 80.7MB in the beginning and 26.8MB in the end (delta: 53.9MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. * TraceAbstraction took 6813.64ms. Allocated memory was 155.2MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 26.3MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 552.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 85 locations, 83 edges, 9 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 657 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 657 mSDsluCounter, 204 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 100 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1435 IncrementalHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 104 mSDtfsCounter, 1435 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15213occurred in iteration=3, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 2129 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 159 ConstructedInterpolants, 0 QuantifiedInterpolants, 485 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 21:58:39,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...