./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label17.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/eca-rers2012/Problem10_label17.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 c12284a0b0818e5553c135263b83926be59cee67b7fc82977d08837b834dc791 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:30:25,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:30:25,925 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:30:25,931 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:30:25,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:30:25,952 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:30:25,953 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:30:25,953 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:30:25,954 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:30:25,954 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:30:25,954 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:30:25,955 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:30:25,955 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:30:25,955 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:30:25,955 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:30:25,955 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:30:25,956 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:30:25,956 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:30:25,956 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:30:25,956 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:30:25,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:30:25,956 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:30:25,956 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:30:25,956 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:30:25,956 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:30:25,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:30:25,956 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:30:25,957 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:30:25,957 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:30:25,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:30:25,957 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:30:25,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:30:25,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:30:25,957 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:30:25,958 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:30:25,958 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:30:25,958 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:30:25,958 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:30:25,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:30:25,958 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:30:25,958 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:30:25,958 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:30:25,958 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:30:25,958 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 -> c12284a0b0818e5553c135263b83926be59cee67b7fc82977d08837b834dc791 [2025-03-03 10:30:26,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:30:26,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:30:26,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:30:26,205 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:30:26,205 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:30:26,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label17.c [2025-03-03 10:30:27,374 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ca81cb09/91892f5065ce46e59e281a74b69be5e3/FLAGcf019e066 [2025-03-03 10:30:27,628 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:30:27,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label17.c [2025-03-03 10:30:27,648 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ca81cb09/91892f5065ce46e59e281a74b69be5e3/FLAGcf019e066 [2025-03-03 10:30:27,934 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ca81cb09/91892f5065ce46e59e281a74b69be5e3 [2025-03-03 10:30:27,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:30:27,937 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:30:27,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:30:27,938 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:30:27,940 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:30:27,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:30:27" (1/1) ... [2025-03-03 10:30:27,942 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12b61bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:27, skipping insertion in model container [2025-03-03 10:30:27,942 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:30:27" (1/1) ... [2025-03-03 10:30:27,970 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:30:28,109 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/eca-rers2012/Problem10_label17.c[3604,3617] [2025-03-03 10:30:28,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:30:28,234 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:30:28,245 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/eca-rers2012/Problem10_label17.c[3604,3617] [2025-03-03 10:30:28,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:30:28,315 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:30:28,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:28 WrapperNode [2025-03-03 10:30:28,317 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:30:28,318 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:30:28,318 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:30:28,318 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:30:28,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:28" (1/1) ... [2025-03-03 10:30:28,332 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:28" (1/1) ... [2025-03-03 10:30:28,378 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 595 [2025-03-03 10:30:28,379 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:30:28,379 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:30:28,379 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:30:28,379 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:30:28,393 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:28" (1/1) ... [2025-03-03 10:30:28,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:28" (1/1) ... [2025-03-03 10:30:28,407 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:28" (1/1) ... [2025-03-03 10:30:28,430 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 10:30:28,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:28" (1/1) ... [2025-03-03 10:30:28,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:28" (1/1) ... [2025-03-03 10:30:28,448 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:28" (1/1) ... [2025-03-03 10:30:28,450 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:28" (1/1) ... [2025-03-03 10:30:28,453 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:28" (1/1) ... [2025-03-03 10:30:28,455 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:28" (1/1) ... [2025-03-03 10:30:28,460 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:30:28,461 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:30:28,461 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:30:28,461 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:30:28,462 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:28" (1/1) ... [2025-03-03 10:30:28,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:30:28,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:30:28,497 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-03 10:30:28,504 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-03 10:30:28,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:30:28,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:30:28,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:30:28,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:30:28,575 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:30:28,576 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:30:29,407 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-03 10:30:29,407 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:30:29,419 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:30:29,419 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:30:29,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:30:29 BoogieIcfgContainer [2025-03-03 10:30:29,420 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:30:29,425 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:30:29,425 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:30:29,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:30:29,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:30:27" (1/3) ... [2025-03-03 10:30:29,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73176d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:30:29, skipping insertion in model container [2025-03-03 10:30:29,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:28" (2/3) ... [2025-03-03 10:30:29,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73176d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:30:29, skipping insertion in model container [2025-03-03 10:30:29,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:30:29" (3/3) ... [2025-03-03 10:30:29,431 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem10_label17.c [2025-03-03 10:30:29,443 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:30:29,444 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem10_label17.c that has 1 procedures, 206 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:30:29,494 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:30:29,504 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;@6650c64c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:30:29,505 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:30:29,509 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 205 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:30:29,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 10:30:29,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:30:29,514 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:30:29,515 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:30:29,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:30:29,519 INFO L85 PathProgramCache]: Analyzing trace with hash -55825670, now seen corresponding path program 1 times [2025-03-03 10:30:29,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:30:29,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552557831] [2025-03-03 10:30:29,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:30:29,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:30:29,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-03 10:30:29,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 10:30:29,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:30:29,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:30:29,752 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-03 10:30:29,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:30:29,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552557831] [2025-03-03 10:30:29,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552557831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:30:29,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:30:29,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:30:29,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230178236] [2025-03-03 10:30:29,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:30:29,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:30:29,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:30:29,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:30:29,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:30:29,774 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 205 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 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-03 10:30:30,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:30:30,421 INFO L93 Difference]: Finished difference Result 567 states and 978 transitions. [2025-03-03 10:30:30,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:30:30,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 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) Word has length 30 [2025-03-03 10:30:30,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:30:30,432 INFO L225 Difference]: With dead ends: 567 [2025-03-03 10:30:30,432 INFO L226 Difference]: Without dead ends: 282 [2025-03-03 10:30:30,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:30:30,438 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 148 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:30:30,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 66 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:30:30,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-03 10:30:30,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2025-03-03 10:30:30,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.4661921708185053) internal successors, (412), 281 states have internal predecessors, (412), 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-03 10:30:30,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 412 transitions. [2025-03-03 10:30:30,473 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 412 transitions. Word has length 30 [2025-03-03 10:30:30,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:30:30,473 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 412 transitions. [2025-03-03 10:30:30,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 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-03 10:30:30,473 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 412 transitions. [2025-03-03 10:30:30,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 10:30:30,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:30:30,475 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:30:30,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:30:30,475 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:30:30,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:30:30,476 INFO L85 PathProgramCache]: Analyzing trace with hash -628184982, now seen corresponding path program 1 times [2025-03-03 10:30:30,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:30:30,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879696537] [2025-03-03 10:30:30,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:30:30,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:30:30,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 10:30:30,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 10:30:30,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:30:30,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:30:30,669 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:30:30,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:30:30,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879696537] [2025-03-03 10:30:30,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879696537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:30:30,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:30:30,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:30:30,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941504255] [2025-03-03 10:30:30,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:30:30,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:30:30,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:30:30,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:30:30,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:30:30,672 INFO L87 Difference]: Start difference. First operand 282 states and 412 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:30:31,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:30:31,034 INFO L93 Difference]: Finished difference Result 840 states and 1231 transitions. [2025-03-03 10:30:31,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:30:31,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-03 10:30:31,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:30:31,036 INFO L225 Difference]: With dead ends: 840 [2025-03-03 10:30:31,036 INFO L226 Difference]: Without dead ends: 560 [2025-03-03 10:30:31,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:30:31,038 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 75 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:30:31,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 67 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:30:31,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-03-03 10:30:31,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2025-03-03 10:30:31,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.3059033989266546) internal successors, (730), 559 states have internal predecessors, (730), 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-03 10:30:31,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 730 transitions. [2025-03-03 10:30:31,060 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 730 transitions. Word has length 100 [2025-03-03 10:30:31,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:30:31,060 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 730 transitions. [2025-03-03 10:30:31,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:30:31,061 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 730 transitions. [2025-03-03 10:30:31,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 10:30:31,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:30:31,063 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:30:31,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:30:31,063 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:30:31,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:30:31,067 INFO L85 PathProgramCache]: Analyzing trace with hash 139801921, now seen corresponding path program 1 times [2025-03-03 10:30:31,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:30:31,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351393553] [2025-03-03 10:30:31,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:30:31,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:30:31,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 10:30:31,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 10:30:31,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:30:31,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:30:31,206 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:30:31,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:30:31,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351393553] [2025-03-03 10:30:31,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351393553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:30:31,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:30:31,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:30:31,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137147681] [2025-03-03 10:30:31,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:30:31,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:30:31,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:30:31,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:30:31,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:30:31,208 INFO L87 Difference]: Start difference. First operand 560 states and 730 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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-03 10:30:31,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:30:31,576 INFO L93 Difference]: Finished difference Result 979 states and 1299 transitions. [2025-03-03 10:30:31,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:30:31,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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 105 [2025-03-03 10:30:31,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:30:31,580 INFO L225 Difference]: With dead ends: 979 [2025-03-03 10:30:31,580 INFO L226 Difference]: Without dead ends: 977 [2025-03-03 10:30:31,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:30:31,581 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 154 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:30:31,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 11 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:30:31,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-03-03 10:30:31,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 699. [2025-03-03 10:30:31,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.3524355300859598) internal successors, (944), 698 states have internal predecessors, (944), 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-03 10:30:31,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 944 transitions. [2025-03-03 10:30:31,597 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 944 transitions. Word has length 105 [2025-03-03 10:30:31,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:30:31,597 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 944 transitions. [2025-03-03 10:30:31,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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-03 10:30:31,598 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 944 transitions. [2025-03-03 10:30:31,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 10:30:31,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:30:31,601 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:30:31,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:30:31,601 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:30:31,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:30:31,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1083602674, now seen corresponding path program 1 times [2025-03-03 10:30:31,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:30:31,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991435989] [2025-03-03 10:30:31,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:30:31,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:30:31,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 10:30:31,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 10:30:31,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:30:31,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:30:31,967 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:30:31,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:30:31,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991435989] [2025-03-03 10:30:31,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991435989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:30:31,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:30:31,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:30:31,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102734396] [2025-03-03 10:30:31,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:30:31,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:30:31,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:30:31,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:30:31,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:30:31,972 INFO L87 Difference]: Start difference. First operand 699 states and 944 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 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-03 10:30:32,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:30:32,426 INFO L93 Difference]: Finished difference Result 1535 states and 2045 transitions. [2025-03-03 10:30:32,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:30:32,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 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 148 [2025-03-03 10:30:32,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:30:32,430 INFO L225 Difference]: With dead ends: 1535 [2025-03-03 10:30:32,430 INFO L226 Difference]: Without dead ends: 838 [2025-03-03 10:30:32,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:30:32,434 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 87 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:30:32,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 87 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:30:32,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-03-03 10:30:32,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2025-03-03 10:30:32,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.2998805256869772) internal successors, (1088), 837 states have internal predecessors, (1088), 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-03 10:30:32,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1088 transitions. [2025-03-03 10:30:32,452 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1088 transitions. Word has length 148 [2025-03-03 10:30:32,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:30:32,453 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1088 transitions. [2025-03-03 10:30:32,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 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-03 10:30:32,454 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1088 transitions. [2025-03-03 10:30:32,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-03 10:30:32,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:30:32,459 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:30:32,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:30:32,459 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:30:32,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:30:32,460 INFO L85 PathProgramCache]: Analyzing trace with hash -716442403, now seen corresponding path program 1 times [2025-03-03 10:30:32,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:30:32,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519691453] [2025-03-03 10:30:32,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:30:32,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:30:32,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-03 10:30:32,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-03 10:30:32,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:30:32,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:30:32,864 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:30:32,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:30:32,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519691453] [2025-03-03 10:30:32,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519691453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:30:32,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:30:32,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 10:30:32,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240502578] [2025-03-03 10:30:32,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:30:32,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 10:30:32,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:30:32,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 10:30:32,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:30:32,867 INFO L87 Difference]: Start difference. First operand 838 states and 1088 transitions. Second operand has 7 states, 7 states have (on average 26.142857142857142) internal successors, (183), 6 states have internal predecessors, (183), 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-03 10:30:33,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:30:33,316 INFO L93 Difference]: Finished difference Result 1590 states and 2085 transitions. [2025-03-03 10:30:33,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 10:30:33,316 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.142857142857142) internal successors, (183), 6 states have internal predecessors, (183), 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 183 [2025-03-03 10:30:33,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:30:33,319 INFO L225 Difference]: With dead ends: 1590 [2025-03-03 10:30:33,319 INFO L226 Difference]: Without dead ends: 838 [2025-03-03 10:30:33,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:30:33,321 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:30:33,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 28 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:30:33,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-03-03 10:30:33,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2025-03-03 10:30:33,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.2927120669056154) internal successors, (1082), 837 states have internal predecessors, (1082), 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-03 10:30:33,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1082 transitions. [2025-03-03 10:30:33,339 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1082 transitions. Word has length 183 [2025-03-03 10:30:33,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:30:33,339 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1082 transitions. [2025-03-03 10:30:33,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.142857142857142) internal successors, (183), 6 states have internal predecessors, (183), 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-03 10:30:33,339 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1082 transitions. [2025-03-03 10:30:33,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 10:30:33,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:30:33,342 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:30:33,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:30:33,342 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:30:33,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:30:33,343 INFO L85 PathProgramCache]: Analyzing trace with hash -2108468632, now seen corresponding path program 1 times [2025-03-03 10:30:33,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:30:33,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986912703] [2025-03-03 10:30:33,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:30:33,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:30:33,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 10:30:33,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 10:30:33,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:30:33,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:30:33,515 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:30:33,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:30:33,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986912703] [2025-03-03 10:30:33,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986912703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:30:33,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:30:33,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:30:33,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819846379] [2025-03-03 10:30:33,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:30:33,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:30:33,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:30:33,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:30:33,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:30:33,520 INFO L87 Difference]: Start difference. First operand 838 states and 1082 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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-03 10:30:33,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:30:33,892 INFO L93 Difference]: Finished difference Result 1952 states and 2639 transitions. [2025-03-03 10:30:33,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:30:33,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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 190 [2025-03-03 10:30:33,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:30:33,897 INFO L225 Difference]: With dead ends: 1952 [2025-03-03 10:30:33,897 INFO L226 Difference]: Without dead ends: 1255 [2025-03-03 10:30:33,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:30:33,899 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 50 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:30:33,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 214 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:30:33,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2025-03-03 10:30:33,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 838. [2025-03-03 10:30:33,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.2819593787335724) internal successors, (1073), 837 states have internal predecessors, (1073), 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-03 10:30:33,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1073 transitions. [2025-03-03 10:30:33,921 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1073 transitions. Word has length 190 [2025-03-03 10:30:33,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:30:33,921 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1073 transitions. [2025-03-03 10:30:33,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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-03 10:30:33,921 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1073 transitions. [2025-03-03 10:30:33,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 10:30:33,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:30:33,924 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:30:33,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:30:33,925 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:30:33,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:30:33,925 INFO L85 PathProgramCache]: Analyzing trace with hash 66297219, now seen corresponding path program 1 times [2025-03-03 10:30:33,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:30:33,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495877528] [2025-03-03 10:30:33,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:30:33,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:30:33,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 10:30:33,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 10:30:33,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:30:33,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:30:34,090 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:30:34,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:30:34,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495877528] [2025-03-03 10:30:34,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495877528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:30:34,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:30:34,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:30:34,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17425240] [2025-03-03 10:30:34,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:30:34,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:30:34,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:30:34,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:30:34,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:30:34,092 INFO L87 Difference]: Start difference. First operand 838 states and 1073 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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-03 10:30:34,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:30:34,472 INFO L93 Difference]: Finished difference Result 1952 states and 2621 transitions. [2025-03-03 10:30:34,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:30:34,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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 219 [2025-03-03 10:30:34,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:30:34,476 INFO L225 Difference]: With dead ends: 1952 [2025-03-03 10:30:34,476 INFO L226 Difference]: Without dead ends: 1255 [2025-03-03 10:30:34,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:30:34,477 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 75 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:30:34,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 190 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:30:34,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2025-03-03 10:30:34,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1116. [2025-03-03 10:30:34,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 1.2609865470852017) internal successors, (1406), 1115 states have internal predecessors, (1406), 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-03 10:30:34,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1406 transitions. [2025-03-03 10:30:34,493 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1406 transitions. Word has length 219 [2025-03-03 10:30:34,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:30:34,493 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1406 transitions. [2025-03-03 10:30:34,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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-03 10:30:34,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1406 transitions. [2025-03-03 10:30:34,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-03-03 10:30:34,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:30:34,497 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:30:34,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:30:34,497 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:30:34,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:30:34,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1703987266, now seen corresponding path program 1 times [2025-03-03 10:30:34,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:30:34,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632617244] [2025-03-03 10:30:34,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:30:34,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:30:34,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-03 10:30:34,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-03 10:30:34,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:30:34,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:30:34,990 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 56 proven. 209 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-03 10:30:34,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:30:34,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632617244] [2025-03-03 10:30:34,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632617244] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:30:34,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353761982] [2025-03-03 10:30:34,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:30:34,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:30:34,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:30:34,993 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-03 10:30:34,995 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-03 10:30:35,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-03 10:30:35,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-03 10:30:35,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:30:35,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:30:35,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:30:35,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:30:35,182 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-03-03 10:30:35,182 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:30:35,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353761982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:30:35,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:30:35,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 10:30:35,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028156169] [2025-03-03 10:30:35,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:30:35,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:30:35,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:30:35,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:30:35,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:30:35,184 INFO L87 Difference]: Start difference. First operand 1116 states and 1406 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-03 10:30:35,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:30:35,579 INFO L93 Difference]: Finished difference Result 2367 states and 3072 transitions. [2025-03-03 10:30:35,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:30:35,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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 329 [2025-03-03 10:30:35,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:30:35,582 INFO L225 Difference]: With dead ends: 2367 [2025-03-03 10:30:35,582 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:30:35,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:30:35,584 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 135 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:30:35,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 18 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:30:35,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:30:35,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:30:35,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:30:35,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:30:35,585 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 329 [2025-03-03 10:30:35,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:30:35,585 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:30:35,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-03 10:30:35,586 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:30:35,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:30:35,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:30:35,598 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-03 10:30:35,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:30:35,793 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:30:35,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 10:30:35,876 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 10:30:35,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:30:35 BoogieIcfgContainer [2025-03-03 10:30:35,888 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 10:30:35,889 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 10:30:35,889 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 10:30:35,889 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 10:30:35,890 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:30:29" (3/4) ... [2025-03-03 10:30:35,892 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 10:30:35,904 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-03 10:30:35,905 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 10:30:35,906 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 10:30:35,906 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 10:30:35,997 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 10:30:35,998 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 10:30:35,998 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 10:30:35,998 INFO L158 Benchmark]: Toolchain (without parser) took 8061.55ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 104.4MB in the beginning and 256.3MB in the end (delta: -151.9MB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. [2025-03-03 10:30:36,000 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 10:30:36,001 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.60ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 78.1MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 10:30:36,001 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.98ms. Allocated memory is still 142.6MB. Free memory was 78.1MB in the beginning and 70.6MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 10:30:36,001 INFO L158 Benchmark]: Boogie Preprocessor took 81.34ms. Allocated memory is still 142.6MB. Free memory was 69.7MB in the beginning and 61.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 10:30:36,001 INFO L158 Benchmark]: IcfgBuilder took 958.59ms. Allocated memory is still 142.6MB. Free memory was 61.3MB in the beginning and 98.9MB in the end (delta: -37.6MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. [2025-03-03 10:30:36,001 INFO L158 Benchmark]: TraceAbstraction took 6463.76ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 98.0MB in the beginning and 264.7MB in the end (delta: -166.7MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2025-03-03 10:30:36,001 INFO L158 Benchmark]: Witness Printer took 108.98ms. Allocated memory is still 343.9MB. Free memory was 264.7MB in the beginning and 256.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 10:30:36,003 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.55ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 379.60ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 78.1MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.98ms. Allocated memory is still 142.6MB. Free memory was 78.1MB in the beginning and 70.6MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.34ms. Allocated memory is still 142.6MB. Free memory was 69.7MB in the beginning and 61.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 958.59ms. Allocated memory is still 142.6MB. Free memory was 61.3MB in the beginning and 98.9MB in the end (delta: -37.6MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6463.76ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 98.0MB in the beginning and 264.7MB in the end (delta: -166.7MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. * Witness Printer took 108.98ms. Allocated memory is still 343.9MB. Free memory was 264.7MB in the beginning and 256.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 104]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 866 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 866 mSDsluCounter, 681 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 541 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3543 IncrementalHoareTripleChecker+Invalid, 4084 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 541 mSolverCounterUnsat, 625 mSDtfsCounter, 3543 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 356 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1116occurred in iteration=7, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 834 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1633 NumberOfCodeBlocks, 1633 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1624 ConstructedInterpolants, 0 QuantifiedInterpolants, 6067 SizeOfPredicates, 0 NumberOfNonLiveVariables, 454 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 929/1138 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 592]: Location Invariant Derived location invariant: (((((8 <= a19) && (14 == a4)) && (a12 == 0)) || (((a1 <= 23) && (14 == a4)) && (a12 == 0))) || (((a10 <= 3) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2025-03-03 10:30:36,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE