./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array26_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-patterns/array26_pattern.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 56ad35a361c83538323b9be55683beef9c8271c8f67221c1a0924c8496da71d0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:38:51,385 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:38:51,431 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:38:51,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:38:51,435 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:38:51,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:38:51,451 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:38:51,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:38:51,452 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:38:51,452 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:38:51,453 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:38:51,453 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:38:51,453 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:38:51,453 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:38:51,453 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:38:51,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:38:51,454 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:38:51,454 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:38:51,454 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:38:51,454 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:38:51,454 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:38:51,454 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:38:51,454 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:38:51,454 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:38:51,454 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:38:51,455 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:38:51,455 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:38:51,455 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:38:51,455 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:38:51,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:38:51,455 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:38:51,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:38:51,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:38:51,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:38:51,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:38:51,456 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:38:51,456 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:38:51,456 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:38:51,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:38:51,456 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:38:51,456 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:38:51,456 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:38:51,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:38:51,456 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 56ad35a361c83538323b9be55683beef9c8271c8f67221c1a0924c8496da71d0 [2025-03-08 00:38:51,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:38:51,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:38:51,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:38:51,697 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:38:51,698 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:38:51,700 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array26_pattern.c [2025-03-08 00:38:52,858 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/983436e98/cef1e266958a4396b1d3a91ea3ae3d2f/FLAG9804ac7d6 [2025-03-08 00:38:53,081 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:38:53,082 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array26_pattern.c [2025-03-08 00:38:53,091 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/983436e98/cef1e266958a4396b1d3a91ea3ae3d2f/FLAG9804ac7d6 [2025-03-08 00:38:53,110 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/983436e98/cef1e266958a4396b1d3a91ea3ae3d2f [2025-03-08 00:38:53,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:38:53,113 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:38:53,114 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:38:53,115 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:38:53,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:38:53,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:38:53" (1/1) ... [2025-03-08 00:38:53,122 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d57fddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:53, skipping insertion in model container [2025-03-08 00:38:53,122 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:38:53" (1/1) ... [2025-03-08 00:38:53,133 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:38:53,242 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array26_pattern.c[1324,1337] [2025-03-08 00:38:53,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:38:53,277 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:38:53,287 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array26_pattern.c[1324,1337] [2025-03-08 00:38:53,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:38:53,310 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:38:53,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:53 WrapperNode [2025-03-08 00:38:53,311 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:38:53,312 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:38:53,313 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:38:53,313 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:38:53,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:53" (1/1) ... [2025-03-08 00:38:53,321 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:53" (1/1) ... [2025-03-08 00:38:53,335 INFO L138 Inliner]: procedures = 16, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2025-03-08 00:38:53,336 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:38:53,336 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:38:53,336 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:38:53,336 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:38:53,342 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:53" (1/1) ... [2025-03-08 00:38:53,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:53" (1/1) ... [2025-03-08 00:38:53,347 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:53" (1/1) ... [2025-03-08 00:38:53,358 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-08 00:38:53,360 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:53" (1/1) ... [2025-03-08 00:38:53,360 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:53" (1/1) ... [2025-03-08 00:38:53,363 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:53" (1/1) ... [2025-03-08 00:38:53,366 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:53" (1/1) ... [2025-03-08 00:38:53,367 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:53" (1/1) ... [2025-03-08 00:38:53,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:53" (1/1) ... [2025-03-08 00:38:53,369 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:38:53,372 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:38:53,372 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:38:53,372 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:38:53,373 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:53" (1/1) ... [2025-03-08 00:38:53,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:38:53,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:38:53,398 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-03-08 00:38:53,402 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-03-08 00:38:53,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:38:53,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:38:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:38:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:38:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:38:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:38:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:38:53,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:38:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:38:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:38:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:38:53,472 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:38:53,474 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:38:53,615 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L45: call ULTIMATE.dealloc(main_~#array~0#1.base, main_~#array~0#1.offset);havoc main_~#array~0#1.base, main_~#array~0#1.offset; [2025-03-08 00:38:53,625 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-08 00:38:53,626 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:38:53,631 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:38:53,632 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:38:53,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:38:53 BoogieIcfgContainer [2025-03-08 00:38:53,633 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:38:53,635 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:38:53,635 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:38:53,638 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:38:53,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:38:53" (1/3) ... [2025-03-08 00:38:53,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2620227d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:38:53, skipping insertion in model container [2025-03-08 00:38:53,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:53" (2/3) ... [2025-03-08 00:38:53,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2620227d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:38:53, skipping insertion in model container [2025-03-08 00:38:53,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:38:53" (3/3) ... [2025-03-08 00:38:53,640 INFO L128 eAbstractionObserver]: Analyzing ICFG array26_pattern.c [2025-03-08 00:38:53,649 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:38:53,650 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array26_pattern.c that has 1 procedures, 18 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-08 00:38:53,681 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:38:53,688 INFO L333 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2f83a099, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:38:53,688 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:38:53,690 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 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-03-08 00:38:53,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 00:38:53,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:38:53,693 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:38:53,693 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:38:53,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:38:53,696 INFO L85 PathProgramCache]: Analyzing trace with hash -712016550, now seen corresponding path program 1 times [2025-03-08 00:38:53,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:38:53,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832913438] [2025-03-08 00:38:53,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:38:53,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:38:53,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 00:38:53,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 00:38:53,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:38:53,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:38:53,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:38:53,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:38:53,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832913438] [2025-03-08 00:38:53,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832913438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:38:53,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:38:53,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:38:53,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667673717] [2025-03-08 00:38:53,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:38:53,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 00:38:53,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:38:53,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 00:38:53,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:38:53,802 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 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 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-03-08 00:38:53,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:38:53,809 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2025-03-08 00:38:53,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 00:38:53,810 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2025-03-08 00:38:53,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:38:53,814 INFO L225 Difference]: With dead ends: 33 [2025-03-08 00:38:53,814 INFO L226 Difference]: Without dead ends: 14 [2025-03-08 00:38:53,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:38:53,821 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:38:53,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:38:53,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-08 00:38:53,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-08 00:38:53,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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-03-08 00:38:53,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2025-03-08 00:38:53,842 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 8 [2025-03-08 00:38:53,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:38:53,843 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2025-03-08 00:38:53,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-03-08 00:38:53,843 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2025-03-08 00:38:53,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 00:38:53,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:38:53,844 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:38:53,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:38:53,845 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:38:53,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:38:53,845 INFO L85 PathProgramCache]: Analyzing trace with hash -683387399, now seen corresponding path program 1 times [2025-03-08 00:38:53,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:38:53,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777820761] [2025-03-08 00:38:53,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:38:53,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:38:53,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 00:38:53,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 00:38:53,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:38:53,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:38:53,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:38:53,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:38:53,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777820761] [2025-03-08 00:38:53,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777820761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:38:53,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:38:53,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:38:53,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544900057] [2025-03-08 00:38:53,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:38:53,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:38:53,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:38:53,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:38:53,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:38:53,992 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-03-08 00:38:54,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:38:54,004 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2025-03-08 00:38:54,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:38:54,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2025-03-08 00:38:54,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:38:54,005 INFO L225 Difference]: With dead ends: 19 [2025-03-08 00:38:54,005 INFO L226 Difference]: Without dead ends: 16 [2025-03-08 00:38:54,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:38:54,005 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:38:54,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 39 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:38:54,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-08 00:38:54,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-08 00:38:54,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 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-03-08 00:38:54,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2025-03-08 00:38:54,012 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 8 [2025-03-08 00:38:54,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:38:54,012 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2025-03-08 00:38:54,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-03-08 00:38:54,013 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2025-03-08 00:38:54,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 00:38:54,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:38:54,013 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:38:54,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:38:54,013 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:38:54,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:38:54,013 INFO L85 PathProgramCache]: Analyzing trace with hash -559311989, now seen corresponding path program 1 times [2025-03-08 00:38:54,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:38:54,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092486972] [2025-03-08 00:38:54,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:38:54,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:38:54,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 00:38:54,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 00:38:54,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:38:54,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:38:54,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:38:54,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:38:54,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092486972] [2025-03-08 00:38:54,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092486972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:38:54,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:38:54,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:38:54,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556218080] [2025-03-08 00:38:54,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:38:54,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:38:54,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:38:54,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:38:54,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:38:54,104 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-03-08 00:38:54,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:38:54,168 INFO L93 Difference]: Finished difference Result 37 states and 55 transitions. [2025-03-08 00:38:54,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:38:54,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-03-08 00:38:54,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:38:54,169 INFO L225 Difference]: With dead ends: 37 [2025-03-08 00:38:54,170 INFO L226 Difference]: Without dead ends: 24 [2025-03-08 00:38:54,170 INFO L434 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-03-08 00:38:54,171 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:38:54,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 17 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:38:54,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-08 00:38:54,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2025-03-08 00:38:54,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 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-03-08 00:38:54,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2025-03-08 00:38:54,178 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 11 [2025-03-08 00:38:54,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:38:54,178 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 29 transitions. [2025-03-08 00:38:54,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-03-08 00:38:54,178 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2025-03-08 00:38:54,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 00:38:54,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:38:54,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:38:54,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 00:38:54,179 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:38:54,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:38:54,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1177784718, now seen corresponding path program 1 times [2025-03-08 00:38:54,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:38:54,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311011625] [2025-03-08 00:38:54,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:38:54,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:38:54,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 00:38:54,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 00:38:54,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:38:54,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:38:54,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:38:54,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:38:54,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311011625] [2025-03-08 00:38:54,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311011625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:38:54,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:38:54,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:38:54,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409268164] [2025-03-08 00:38:54,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:38:54,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:38:54,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:38:54,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:38:54,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:38:54,269 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-03-08 00:38:54,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:38:54,326 INFO L93 Difference]: Finished difference Result 41 states and 60 transitions. [2025-03-08 00:38:54,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:38:54,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2025-03-08 00:38:54,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:38:54,327 INFO L225 Difference]: With dead ends: 41 [2025-03-08 00:38:54,327 INFO L226 Difference]: Without dead ends: 25 [2025-03-08 00:38:54,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-03-08 00:38:54,329 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:38:54,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 15 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:38:54,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-08 00:38:54,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2025-03-08 00:38:54,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 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-03-08 00:38:54,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2025-03-08 00:38:54,334 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 13 [2025-03-08 00:38:54,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:38:54,334 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2025-03-08 00:38:54,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-03-08 00:38:54,334 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2025-03-08 00:38:54,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 00:38:54,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:38:54,334 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:38:54,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 00:38:54,334 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:38:54,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:38:54,335 INFO L85 PathProgramCache]: Analyzing trace with hash -2019719752, now seen corresponding path program 1 times [2025-03-08 00:38:54,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:38:54,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375156423] [2025-03-08 00:38:54,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:38:54,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:38:54,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 00:38:54,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 00:38:54,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:38:54,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:38:54,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:38:54,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:38:54,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375156423] [2025-03-08 00:38:54,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375156423] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:38:54,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451289458] [2025-03-08 00:38:54,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:38:54,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:38:54,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:38:54,499 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:38:54,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 00:38:54,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 00:38:54,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 00:38:54,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:38:54,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:38:54,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 00:38:54,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:38:54,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:38:54,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:38:54,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:38:54,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2025-03-08 00:38:54,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2025-03-08 00:38:54,973 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:38:54,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451289458] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:38:54,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:38:54,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 19 [2025-03-08 00:38:54,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102467637] [2025-03-08 00:38:54,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:38:54,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 00:38:54,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:38:54,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 00:38:54,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:38:54,978 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 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-03-08 00:38:55,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:38:55,641 INFO L93 Difference]: Finished difference Result 73 states and 108 transitions. [2025-03-08 00:38:55,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 00:38:55,642 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 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-03-08 00:38:55,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:38:55,644 INFO L225 Difference]: With dead ends: 73 [2025-03-08 00:38:55,644 INFO L226 Difference]: Without dead ends: 61 [2025-03-08 00:38:55,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=306, Invalid=1100, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 00:38:55,645 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 92 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:38:55,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 31 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:38:55,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-08 00:38:55,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 31. [2025-03-08 00:38:55,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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-03-08 00:38:55,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2025-03-08 00:38:55,657 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 16 [2025-03-08 00:38:55,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:38:55,657 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2025-03-08 00:38:55,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 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-03-08 00:38:55,659 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2025-03-08 00:38:55,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 00:38:55,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:38:55,660 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:38:55,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 00:38:55,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:38:55,861 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:38:55,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:38:55,861 INFO L85 PathProgramCache]: Analyzing trace with hash 829016340, now seen corresponding path program 2 times [2025-03-08 00:38:55,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:38:55,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112030652] [2025-03-08 00:38:55,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:38:55,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:38:55,873 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-08 00:38:55,884 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 00:38:55,885 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:38:55,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:38:55,952 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:38:55,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:38:55,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112030652] [2025-03-08 00:38:55,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112030652] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:38:55,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157517499] [2025-03-08 00:38:55,953 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:38:55,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:38:55,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:38:55,955 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:38:55,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 00:38:55,989 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-08 00:38:56,002 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 00:38:56,003 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:38:56,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:38:56,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:38:56,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:38:56,054 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:38:56,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:38:56,096 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:38:56,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157517499] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:38:56,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:38:56,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-08 00:38:56,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591927618] [2025-03-08 00:38:56,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:38:56,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:38:56,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:38:56,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:38:56,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:38:56,097 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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-03-08 00:38:56,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:38:56,220 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2025-03-08 00:38:56,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 00:38:56,221 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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 20 [2025-03-08 00:38:56,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:38:56,221 INFO L225 Difference]: With dead ends: 41 [2025-03-08 00:38:56,221 INFO L226 Difference]: Without dead ends: 38 [2025-03-08 00:38:56,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:38:56,222 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 46 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:38:56,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 21 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:38:56,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-08 00:38:56,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2025-03-08 00:38:56,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 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-03-08 00:38:56,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2025-03-08 00:38:56,229 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 20 [2025-03-08 00:38:56,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:38:56,229 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2025-03-08 00:38:56,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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-03-08 00:38:56,229 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2025-03-08 00:38:56,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 00:38:56,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:38:56,230 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:38:56,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 00:38:56,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-08 00:38:56,431 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:38:56,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:38:56,432 INFO L85 PathProgramCache]: Analyzing trace with hash 206036726, now seen corresponding path program 3 times [2025-03-08 00:38:56,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:38:56,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89358647] [2025-03-08 00:38:56,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:38:56,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:38:56,447 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 5 equivalence classes. [2025-03-08 00:38:56,458 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 12 of 24 statements. [2025-03-08 00:38:56,459 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 00:38:56,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:38:56,525 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 00:38:56,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:38:56,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89358647] [2025-03-08 00:38:56,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89358647] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:38:56,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628452870] [2025-03-08 00:38:56,525 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:38:56,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:38:56,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:38:56,527 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:38:56,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 00:38:56,564 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 5 equivalence classes. [2025-03-08 00:38:56,575 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 12 of 24 statements. [2025-03-08 00:38:56,576 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 00:38:56,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:38:56,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:38:56,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:38:56,636 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 00:38:56,637 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:38:56,668 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 00:38:56,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628452870] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:38:56,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:38:56,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-08 00:38:56,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936835045] [2025-03-08 00:38:56,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:38:56,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 00:38:56,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:38:56,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 00:38:56,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:38:56,671 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 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-03-08 00:38:56,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:38:56,750 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2025-03-08 00:38:56,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:38:56,750 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 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 24 [2025-03-08 00:38:56,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:38:56,751 INFO L225 Difference]: With dead ends: 76 [2025-03-08 00:38:56,751 INFO L226 Difference]: Without dead ends: 54 [2025-03-08 00:38:56,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:38:56,752 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 57 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:38:56,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 20 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:38:56,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-08 00:38:56,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2025-03-08 00:38:56,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 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-03-08 00:38:56,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2025-03-08 00:38:56,763 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 24 [2025-03-08 00:38:56,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:38:56,763 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 58 transitions. [2025-03-08 00:38:56,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 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-03-08 00:38:56,763 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2025-03-08 00:38:56,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 00:38:56,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:38:56,764 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:38:56,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 00:38:56,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:38:56,965 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:38:56,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:38:56,965 INFO L85 PathProgramCache]: Analyzing trace with hash 289170550, now seen corresponding path program 1 times [2025-03-08 00:38:56,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:38:56,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10805318] [2025-03-08 00:38:56,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:38:56,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:38:56,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 00:38:56,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:38:56,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:38:56,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:38:57,101 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 00:38:57,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:38:57,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10805318] [2025-03-08 00:38:57,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10805318] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:38:57,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869261214] [2025-03-08 00:38:57,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:38:57,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:38:57,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:38:57,103 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:38:57,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 00:38:57,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 00:38:57,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:38:57,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:38:57,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:38:57,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 00:38:57,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:38:57,183 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 00:38:57,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:38:57,352 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 00:38:57,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869261214] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:38:57,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:38:57,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 7] total 12 [2025-03-08 00:38:57,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209961064] [2025-03-08 00:38:57,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:38:57,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 00:38:57,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:38:57,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 00:38:57,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:38:57,353 INFO L87 Difference]: Start difference. First operand 45 states and 58 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 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-03-08 00:38:57,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:38:57,684 INFO L93 Difference]: Finished difference Result 167 states and 235 transitions. [2025-03-08 00:38:57,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 00:38:57,684 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 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 34 [2025-03-08 00:38:57,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:38:57,685 INFO L225 Difference]: With dead ends: 167 [2025-03-08 00:38:57,685 INFO L226 Difference]: Without dead ends: 129 [2025-03-08 00:38:57,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2025-03-08 00:38:57,686 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 86 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:38:57,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 32 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:38:57,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-08 00:38:57,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 104. [2025-03-08 00:38:57,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3300970873786409) internal successors, (137), 103 states have internal predecessors, (137), 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-03-08 00:38:57,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 137 transitions. [2025-03-08 00:38:57,702 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 137 transitions. Word has length 34 [2025-03-08 00:38:57,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:38:57,702 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 137 transitions. [2025-03-08 00:38:57,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 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-03-08 00:38:57,702 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 137 transitions. [2025-03-08 00:38:57,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 00:38:57,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:38:57,703 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:38:57,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 00:38:57,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:38:57,904 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:38:57,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:38:57,904 INFO L85 PathProgramCache]: Analyzing trace with hash -672390028, now seen corresponding path program 2 times [2025-03-08 00:38:57,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:38:57,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386514839] [2025-03-08 00:38:57,904 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:38:57,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:38:57,914 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-08 00:38:57,940 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 00:38:57,940 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:38:57,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 00:38:57,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1543979695] [2025-03-08 00:38:57,943 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:38:57,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:38:57,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:38:57,945 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:38:57,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 00:38:57,978 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-08 00:38:58,024 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 00:38:58,025 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:38:58,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:38:58,027 WARN L254 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-03-08 00:38:58,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:38:58,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:38:58,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 00:38:58,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:58,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:58,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:38:58,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2025-03-08 00:38:58,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:58,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:58,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:58,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:58,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:38:58,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 46 [2025-03-08 00:38:58,995 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:38:58,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:39:00,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 471 treesize of output 455 [2025-03-08 00:39:00,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:39:00,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 959662395 treesize of output 919816541 [2025-03-08 00:39:16,746 WARN L286 SmtUtils]: Spent 16.04s on a formula simplification. DAG size of input: 10252 DAG size of output: 1376 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)