./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label43.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_label43.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 a7b85a68724f5afc4ed57f536cb2f17f7de1e36fdc537e0c0591e3a43de5da10 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:30:29,586 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:30:29,637 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:30:29,642 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:30:29,645 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:30:29,667 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:30:29,668 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:30:29,668 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:30:29,669 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:30:29,669 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:30:29,669 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:30:29,670 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:30:29,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:30:29,670 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:30:29,670 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:30:29,670 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:30:29,670 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:30:29,671 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:30:29,671 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:30:29,671 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:30:29,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:30:29,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:30:29,671 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:30:29,671 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:30:29,671 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:30:29,671 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:30:29,671 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:30:29,671 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:30:29,672 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:30:29,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:30:29,672 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:30:29,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:30:29,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:30:29,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:30:29,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:30:29,673 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:30:29,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:30:29,673 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:30:29,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:30:29,673 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:30:29,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:30:29,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:30:29,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:30:29,673 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-jdk21/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 -> a7b85a68724f5afc4ed57f536cb2f17f7de1e36fdc537e0c0591e3a43de5da10 [2025-02-05 11:30:29,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:30:29,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:30:29,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:30:29,919 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:30:29,920 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:30:29,920 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label43.c [2025-02-05 11:30:31,094 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36f0a2153/8adbb6c0768647c8b87d86f74eb30539/FLAGd27b750e4 [2025-02-05 11:30:31,525 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:30:31,525 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label43.c [2025-02-05 11:30:31,537 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36f0a2153/8adbb6c0768647c8b87d86f74eb30539/FLAGd27b750e4 [2025-02-05 11:30:31,688 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36f0a2153/8adbb6c0768647c8b87d86f74eb30539 [2025-02-05 11:30:31,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:30:31,691 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:30:31,693 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:30:31,693 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:30:31,696 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:30:31,697 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:30:31" (1/1) ... [2025-02-05 11:30:31,697 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bf8b581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:31, skipping insertion in model container [2025-02-05 11:30:31,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:30:31" (1/1) ... [2025-02-05 11:30:31,727 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:30:31,856 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label43.c[4120,4133] [2025-02-05 11:30:31,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:30:31,937 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:30:31,950 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label43.c[4120,4133] [2025-02-05 11:30:31,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:30:32,002 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:30:32,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:32 WrapperNode [2025-02-05 11:30:32,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:30:32,003 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:30:32,003 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:30:32,003 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:30:32,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:32" (1/1) ... [2025-02-05 11:30:32,017 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:32" (1/1) ... [2025-02-05 11:30:32,049 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 595 [2025-02-05 11:30:32,050 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:30:32,050 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:30:32,050 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:30:32,050 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:30:32,059 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:32" (1/1) ... [2025-02-05 11:30:32,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:32" (1/1) ... [2025-02-05 11:30:32,067 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:32" (1/1) ... [2025-02-05 11:30:32,094 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-02-05 11:30:32,094 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:32" (1/1) ... [2025-02-05 11:30:32,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:32" (1/1) ... [2025-02-05 11:30:32,108 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:32" (1/1) ... [2025-02-05 11:30:32,114 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:32" (1/1) ... [2025-02-05 11:30:32,117 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:32" (1/1) ... [2025-02-05 11:30:32,119 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:32" (1/1) ... [2025-02-05 11:30:32,124 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:30:32,125 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:30:32,125 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:30:32,125 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:30:32,125 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:32" (1/1) ... [2025-02-05 11:30:32,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:30:32,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:30:32,151 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 11:30:32,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 11:30:32,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:30:32,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:30:32,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:30:32,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:30:32,217 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:30:32,218 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:30:33,099 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-02-05 11:30:33,099 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:30:33,108 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:30:33,108 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:30:33,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:30:33 BoogieIcfgContainer [2025-02-05 11:30:33,109 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:30:33,110 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:30:33,110 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:30:33,114 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:30:33,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:30:31" (1/3) ... [2025-02-05 11:30:33,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66994ac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:30:33, skipping insertion in model container [2025-02-05 11:30:33,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:32" (2/3) ... [2025-02-05 11:30:33,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66994ac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:30:33, skipping insertion in model container [2025-02-05 11:30:33,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:30:33" (3/3) ... [2025-02-05 11:30:33,116 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem10_label43.c [2025-02-05 11:30:33,125 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:30:33,126 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem10_label43.c that has 1 procedures, 206 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:30:33,164 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:30:33,171 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;@25a80113, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:30:33,172 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:30:33,175 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-02-05 11:30:33,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-05 11:30:33,179 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:30:33,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:30:33,180 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:30:33,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:30:33,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1422414701, now seen corresponding path program 1 times [2025-02-05 11:30:33,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:30:33,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59957613] [2025-02-05 11:30:33,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:33,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:30:33,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 11:30:33,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 11:30:33,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:33,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:33,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:30:33,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:30:33,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59957613] [2025-02-05 11:30:33,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59957613] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:30:33,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:30:33,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:30:33,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545196598] [2025-02-05 11:30:33,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:30:33,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:30:33,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:30:33,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:30:33,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:30:33,503 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 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 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-02-05 11:30:34,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:30:34,108 INFO L93 Difference]: Finished difference Result 552 states and 963 transitions. [2025-02-05 11:30:34,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:30:34,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 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 35 [2025-02-05 11:30:34,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:30:34,117 INFO L225 Difference]: With dead ends: 552 [2025-02-05 11:30:34,117 INFO L226 Difference]: Without dead ends: 282 [2025-02-05 11:30:34,120 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-02-05 11:30:34,127 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 153 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:30:34,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 76 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:30:34,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-02-05 11:30:34,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2025-02-05 11:30:34,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.5373665480427046) internal successors, (432), 281 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:30:34,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2025-02-05 11:30:34,186 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 35 [2025-02-05 11:30:34,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:30:34,187 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2025-02-05 11:30:34,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 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-02-05 11:30:34,187 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2025-02-05 11:30:34,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 11:30:34,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:30:34,193 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, 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] [2025-02-05 11:30:34,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:30:34,193 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:30:34,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:30:34,193 INFO L85 PathProgramCache]: Analyzing trace with hash 710558782, now seen corresponding path program 1 times [2025-02-05 11:30:34,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:30:34,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375748273] [2025-02-05 11:30:34,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:34,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:30:34,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 11:30:34,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 11:30:34,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:34,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:34,403 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:30:34,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:30:34,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375748273] [2025-02-05 11:30:34,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375748273] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:30:34,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:30:34,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:30:34,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382777718] [2025-02-05 11:30:34,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:30:34,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:30:34,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:30:34,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:30:34,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:30:34,405 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 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-02-05 11:30:34,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:30:34,790 INFO L93 Difference]: Finished difference Result 701 states and 1076 transitions. [2025-02-05 11:30:34,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:30:34,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 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 104 [2025-02-05 11:30:34,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:30:34,793 INFO L225 Difference]: With dead ends: 701 [2025-02-05 11:30:34,793 INFO L226 Difference]: Without dead ends: 421 [2025-02-05 11:30:34,794 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-02-05 11:30:34,794 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 109 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:30:34,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 34 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:30:34,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-02-05 11:30:34,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2025-02-05 11:30:34,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.4190476190476191) internal successors, (596), 420 states have internal predecessors, (596), 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-02-05 11:30:34,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 596 transitions. [2025-02-05 11:30:34,807 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 596 transitions. Word has length 104 [2025-02-05 11:30:34,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:30:34,807 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 596 transitions. [2025-02-05 11:30:34,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 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-02-05 11:30:34,807 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 596 transitions. [2025-02-05 11:30:34,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-05 11:30:34,808 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:30:34,808 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, 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-02-05 11:30:34,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:30:34,808 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:30:34,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:30:34,809 INFO L85 PathProgramCache]: Analyzing trace with hash -365796115, now seen corresponding path program 1 times [2025-02-05 11:30:34,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:30:34,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591221221] [2025-02-05 11:30:34,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:34,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:30:34,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 11:30:34,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 11:30:34,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:34,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:35,021 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:30:35,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:30:35,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591221221] [2025-02-05 11:30:35,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591221221] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:30:35,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:30:35,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:30:35,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892820488] [2025-02-05 11:30:35,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:30:35,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:30:35,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:30:35,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:30:35,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:30:35,023 INFO L87 Difference]: Start difference. First operand 421 states and 596 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 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-02-05 11:30:35,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:30:35,720 INFO L93 Difference]: Finished difference Result 1674 states and 2376 transitions. [2025-02-05 11:30:35,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:30:35,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 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 110 [2025-02-05 11:30:35,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:30:35,724 INFO L225 Difference]: With dead ends: 1674 [2025-02-05 11:30:35,724 INFO L226 Difference]: Without dead ends: 1255 [2025-02-05 11:30:35,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:30:35,726 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 190 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:30:35,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 19 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:30:35,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2025-02-05 11:30:35,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 977. [2025-02-05 11:30:35,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.3698770491803278) internal successors, (1337), 976 states have internal predecessors, (1337), 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-02-05 11:30:35,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1337 transitions. [2025-02-05 11:30:35,752 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1337 transitions. Word has length 110 [2025-02-05 11:30:35,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:30:35,752 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1337 transitions. [2025-02-05 11:30:35,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 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-02-05 11:30:35,752 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1337 transitions. [2025-02-05 11:30:35,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 11:30:35,754 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:30:35,754 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, 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] [2025-02-05 11:30:35,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:30:35,754 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:30:35,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:30:35,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1758008406, now seen corresponding path program 1 times [2025-02-05 11:30:35,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:30:35,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312464623] [2025-02-05 11:30:35,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:35,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:30:35,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 11:30:35,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 11:30:35,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:35,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:35,869 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:30:35,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:30:35,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312464623] [2025-02-05 11:30:35,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312464623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:30:35,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:30:35,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:30:35,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609089121] [2025-02-05 11:30:35,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:30:35,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:30:35,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:30:35,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:30:35,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:30:35,871 INFO L87 Difference]: Start difference. First operand 977 states and 1337 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 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-02-05 11:30:36,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:30:36,236 INFO L93 Difference]: Finished difference Result 2508 states and 3454 transitions. [2025-02-05 11:30:36,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:30:36,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 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 113 [2025-02-05 11:30:36,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:30:36,241 INFO L225 Difference]: With dead ends: 2508 [2025-02-05 11:30:36,241 INFO L226 Difference]: Without dead ends: 1533 [2025-02-05 11:30:36,242 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-02-05 11:30:36,242 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 65 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:30:36,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 30 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 11:30:36,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2025-02-05 11:30:36,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1533. [2025-02-05 11:30:36,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1532 states have (on average 1.3505221932114881) internal successors, (2069), 1532 states have internal predecessors, (2069), 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-02-05 11:30:36,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 2069 transitions. [2025-02-05 11:30:36,265 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 2069 transitions. Word has length 113 [2025-02-05 11:30:36,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:30:36,265 INFO L471 AbstractCegarLoop]: Abstraction has 1533 states and 2069 transitions. [2025-02-05 11:30:36,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 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-02-05 11:30:36,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 2069 transitions. [2025-02-05 11:30:36,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 11:30:36,267 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:30:36,267 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, 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] [2025-02-05 11:30:36,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:30:36,268 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:30:36,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:30:36,268 INFO L85 PathProgramCache]: Analyzing trace with hash -655919407, now seen corresponding path program 1 times [2025-02-05 11:30:36,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:30:36,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279864480] [2025-02-05 11:30:36,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:36,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:30:36,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 11:30:36,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 11:30:36,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:36,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:36,509 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:30:36,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:30:36,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279864480] [2025-02-05 11:30:36,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279864480] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:30:36,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:30:36,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:30:36,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966851630] [2025-02-05 11:30:36,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:30:36,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:30:36,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:30:36,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:30:36,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:30:36,515 INFO L87 Difference]: Start difference. First operand 1533 states and 2069 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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-02-05 11:30:37,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:30:37,111 INFO L93 Difference]: Finished difference Result 2925 states and 3957 transitions. [2025-02-05 11:30:37,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:30:37,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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 150 [2025-02-05 11:30:37,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:30:37,117 INFO L225 Difference]: With dead ends: 2925 [2025-02-05 11:30:37,117 INFO L226 Difference]: Without dead ends: 1533 [2025-02-05 11:30:37,118 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-02-05 11:30:37,120 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 26 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:30:37,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 62 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:30:37,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2025-02-05 11:30:37,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1533. [2025-02-05 11:30:37,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1532 states have (on average 1.3407310704960835) internal successors, (2054), 1532 states have internal predecessors, (2054), 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-02-05 11:30:37,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 2054 transitions. [2025-02-05 11:30:37,142 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 2054 transitions. Word has length 150 [2025-02-05 11:30:37,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:30:37,143 INFO L471 AbstractCegarLoop]: Abstraction has 1533 states and 2054 transitions. [2025-02-05 11:30:37,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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-02-05 11:30:37,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 2054 transitions. [2025-02-05 11:30:37,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 11:30:37,145 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:30:37,145 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:30:37,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:30:37,145 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:30:37,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:30:37,146 INFO L85 PathProgramCache]: Analyzing trace with hash -297653155, now seen corresponding path program 1 times [2025-02-05 11:30:37,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:30:37,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87757194] [2025-02-05 11:30:37,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:37,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:30:37,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 11:30:37,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 11:30:37,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:37,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:37,454 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:30:37,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:30:37,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87757194] [2025-02-05 11:30:37,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87757194] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:30:37,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:30:37,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:30:37,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247493649] [2025-02-05 11:30:37,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:30:37,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:30:37,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:30:37,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:30:37,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:30:37,457 INFO L87 Difference]: Start difference. First operand 1533 states and 2054 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 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-02-05 11:30:38,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:30:38,472 INFO L93 Difference]: Finished difference Result 2925 states and 3942 transitions. [2025-02-05 11:30:38,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:30:38,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 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 167 [2025-02-05 11:30:38,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:30:38,477 INFO L225 Difference]: With dead ends: 2925 [2025-02-05 11:30:38,477 INFO L226 Difference]: Without dead ends: 1533 [2025-02-05 11:30:38,478 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-02-05 11:30:38,479 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 73 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:30:38,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 87 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 11:30:38,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2025-02-05 11:30:38,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1533. [2025-02-05 11:30:38,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1532 states have (on average 1.3276762402088773) internal successors, (2034), 1532 states have internal predecessors, (2034), 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-02-05 11:30:38,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 2034 transitions. [2025-02-05 11:30:38,504 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 2034 transitions. Word has length 167 [2025-02-05 11:30:38,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:30:38,505 INFO L471 AbstractCegarLoop]: Abstraction has 1533 states and 2034 transitions. [2025-02-05 11:30:38,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 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-02-05 11:30:38,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 2034 transitions. [2025-02-05 11:30:38,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-02-05 11:30:38,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:30:38,508 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:30:38,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:30:38,509 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:30:38,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:30:38,509 INFO L85 PathProgramCache]: Analyzing trace with hash 21059376, now seen corresponding path program 1 times [2025-02-05 11:30:38,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:30:38,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169277732] [2025-02-05 11:30:38,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:38,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:30:38,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-05 11:30:38,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-05 11:30:38,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:38,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:38,863 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:30:38,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:30:38,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169277732] [2025-02-05 11:30:38,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169277732] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:30:38,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:30:38,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 11:30:38,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682286733] [2025-02-05 11:30:38,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:30:38,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 11:30:38,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:30:38,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 11:30:38,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:30:38,864 INFO L87 Difference]: Start difference. First operand 1533 states and 2034 transitions. Second operand has 7 states, 7 states have (on average 26.857142857142858) internal successors, (188), 6 states have internal predecessors, (188), 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-02-05 11:30:39,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:30:39,942 INFO L93 Difference]: Finished difference Result 3035 states and 4032 transitions. [2025-02-05 11:30:39,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 11:30:39,942 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.857142857142858) internal successors, (188), 6 states have internal predecessors, (188), 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 188 [2025-02-05 11:30:39,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:30:39,947 INFO L225 Difference]: With dead ends: 3035 [2025-02-05 11:30:39,947 INFO L226 Difference]: Without dead ends: 1533 [2025-02-05 11:30:39,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:30:39,949 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 143 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:30:39,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 29 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 11:30:39,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2025-02-05 11:30:39,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1533. [2025-02-05 11:30:39,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1532 states have (on average 1.3218015665796345) internal successors, (2025), 1532 states have internal predecessors, (2025), 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-02-05 11:30:39,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 2025 transitions. [2025-02-05 11:30:39,972 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 2025 transitions. Word has length 188 [2025-02-05 11:30:39,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:30:39,973 INFO L471 AbstractCegarLoop]: Abstraction has 1533 states and 2025 transitions. [2025-02-05 11:30:39,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.857142857142858) internal successors, (188), 6 states have internal predecessors, (188), 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-02-05 11:30:39,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 2025 transitions. [2025-02-05 11:30:39,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-02-05 11:30:39,975 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:30:39,975 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:30:39,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:30:39,976 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:30:39,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:30:39,976 INFO L85 PathProgramCache]: Analyzing trace with hash -33256948, now seen corresponding path program 1 times [2025-02-05 11:30:39,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:30:39,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912673550] [2025-02-05 11:30:39,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:39,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:30:39,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-05 11:30:40,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-05 11:30:40,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:40,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:40,070 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-02-05 11:30:40,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:30:40,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912673550] [2025-02-05 11:30:40,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912673550] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:30:40,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:30:40,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:30:40,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013282867] [2025-02-05 11:30:40,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:30:40,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:30:40,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:30:40,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:30:40,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:30:40,072 INFO L87 Difference]: Start difference. First operand 1533 states and 2025 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-02-05 11:30:40,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:30:40,432 INFO L93 Difference]: Finished difference Result 3203 states and 4273 transitions. [2025-02-05 11:30:40,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:30:40,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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 216 [2025-02-05 11:30:40,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:30:40,437 INFO L225 Difference]: With dead ends: 3203 [2025-02-05 11:30:40,437 INFO L226 Difference]: Without dead ends: 1533 [2025-02-05 11:30:40,439 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-02-05 11:30:40,439 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 107 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:30:40,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 225 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 11:30:40,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2025-02-05 11:30:40,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1533. [2025-02-05 11:30:40,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1532 states have (on average 1.3120104438642297) internal successors, (2010), 1532 states have internal predecessors, (2010), 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-02-05 11:30:40,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 2010 transitions. [2025-02-05 11:30:40,460 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 2010 transitions. Word has length 216 [2025-02-05 11:30:40,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:30:40,460 INFO L471 AbstractCegarLoop]: Abstraction has 1533 states and 2010 transitions. [2025-02-05 11:30:40,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-02-05 11:30:40,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 2010 transitions. [2025-02-05 11:30:40,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-02-05 11:30:40,462 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:30:40,463 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:30:40,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:30:40,463 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:30:40,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:30:40,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1011399114, now seen corresponding path program 1 times [2025-02-05 11:30:40,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:30:40,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030044046] [2025-02-05 11:30:40,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:40,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:30:40,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-02-05 11:30:40,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-02-05 11:30:40,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:40,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:40,586 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:30:40,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:30:40,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030044046] [2025-02-05 11:30:40,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030044046] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:30:40,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:30:40,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:30:40,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124212904] [2025-02-05 11:30:40,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:30:40,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:30:40,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:30:40,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:30:40,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:30:40,588 INFO L87 Difference]: Start difference. First operand 1533 states and 2010 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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-02-05 11:30:40,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:30:40,944 INFO L93 Difference]: Finished difference Result 3759 states and 4991 transitions. [2025-02-05 11:30:40,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:30:40,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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 224 [2025-02-05 11:30:40,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:30:40,951 INFO L225 Difference]: With dead ends: 3759 [2025-02-05 11:30:40,951 INFO L226 Difference]: Without dead ends: 2367 [2025-02-05 11:30:40,953 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-02-05 11:30:40,953 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 71 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:30:40,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 207 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 11:30:40,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2025-02-05 11:30:40,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 2228. [2025-02-05 11:30:40,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2228 states, 2227 states have (on average 1.2227211495285137) internal successors, (2723), 2227 states have internal predecessors, (2723), 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-02-05 11:30:40,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2723 transitions. [2025-02-05 11:30:40,985 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2723 transitions. Word has length 224 [2025-02-05 11:30:40,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:30:40,985 INFO L471 AbstractCegarLoop]: Abstraction has 2228 states and 2723 transitions. [2025-02-05 11:30:40,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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-02-05 11:30:40,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2723 transitions. [2025-02-05 11:30:40,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-02-05 11:30:40,988 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:30:40,988 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:30:40,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:30:40,989 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:30:40,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:30:40,989 INFO L85 PathProgramCache]: Analyzing trace with hash 674010754, now seen corresponding path program 1 times [2025-02-05 11:30:40,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:30:40,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811097827] [2025-02-05 11:30:40,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:40,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:30:41,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-02-05 11:30:41,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-02-05 11:30:41,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:41,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:41,119 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:30:41,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:30:41,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811097827] [2025-02-05 11:30:41,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811097827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:30:41,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:30:41,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:30:41,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940841268] [2025-02-05 11:30:41,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:30:41,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:30:41,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:30:41,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:30:41,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:30:41,121 INFO L87 Difference]: Start difference. First operand 2228 states and 2723 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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-02-05 11:30:41,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:30:41,455 INFO L93 Difference]: Finished difference Result 4871 states and 6016 transitions. [2025-02-05 11:30:41,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:30:41,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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 233 [2025-02-05 11:30:41,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:30:41,463 INFO L225 Difference]: With dead ends: 4871 [2025-02-05 11:30:41,463 INFO L226 Difference]: Without dead ends: 2784 [2025-02-05 11:30:41,466 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-02-05 11:30:41,466 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 12 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:30:41,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 211 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 11:30:41,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2025-02-05 11:30:41,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2506. [2025-02-05 11:30:41,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2506 states, 2505 states have (on average 1.1924151696606786) internal successors, (2987), 2505 states have internal predecessors, (2987), 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-02-05 11:30:41,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 2987 transitions. [2025-02-05 11:30:41,504 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 2987 transitions. Word has length 233 [2025-02-05 11:30:41,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:30:41,504 INFO L471 AbstractCegarLoop]: Abstraction has 2506 states and 2987 transitions. [2025-02-05 11:30:41,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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-02-05 11:30:41,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 2987 transitions. [2025-02-05 11:30:41,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-02-05 11:30:41,507 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:30:41,507 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:30:41,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:30:41,508 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:30:41,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:30:41,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1670744869, now seen corresponding path program 1 times [2025-02-05 11:30:41,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:30:41,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242619245] [2025-02-05 11:30:41,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:41,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:30:41,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-02-05 11:30:41,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-02-05 11:30:41,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:41,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:41,642 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-02-05 11:30:41,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:30:41,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242619245] [2025-02-05 11:30:41,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242619245] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:30:41,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:30:41,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:30:41,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346712417] [2025-02-05 11:30:41,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:30:41,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:30:41,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:30:41,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:30:41,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:30:41,644 INFO L87 Difference]: Start difference. First operand 2506 states and 2987 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 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-02-05 11:30:41,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:30:41,995 INFO L93 Difference]: Finished difference Result 5288 states and 6366 transitions. [2025-02-05 11:30:41,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:30:41,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 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 243 [2025-02-05 11:30:41,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:30:42,003 INFO L225 Difference]: With dead ends: 5288 [2025-02-05 11:30:42,003 INFO L226 Difference]: Without dead ends: 2923 [2025-02-05 11:30:42,006 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-02-05 11:30:42,006 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 13 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:30:42,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 74 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 11:30:42,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states. [2025-02-05 11:30:42,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 2645. [2025-02-05 11:30:42,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2645 states, 2644 states have (on average 1.1482602118003025) internal successors, (3036), 2644 states have internal predecessors, (3036), 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-02-05 11:30:42,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 3036 transitions. [2025-02-05 11:30:42,043 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 3036 transitions. Word has length 243 [2025-02-05 11:30:42,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:30:42,043 INFO L471 AbstractCegarLoop]: Abstraction has 2645 states and 3036 transitions. [2025-02-05 11:30:42,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 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-02-05 11:30:42,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 3036 transitions. [2025-02-05 11:30:42,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2025-02-05 11:30:42,047 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:30:42,047 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, 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, 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] [2025-02-05 11:30:42,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:30:42,047 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:30:42,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:30:42,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1419057996, now seen corresponding path program 1 times [2025-02-05 11:30:42,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:30:42,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143856699] [2025-02-05 11:30:42,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:42,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:30:42,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-02-05 11:30:42,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-02-05 11:30:42,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:42,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:42,272 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 31 proven. 34 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-02-05 11:30:42,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:30:42,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143856699] [2025-02-05 11:30:42,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143856699] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:30:42,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274589349] [2025-02-05 11:30:42,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:42,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:30:42,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:30:42,275 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:30:42,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 11:30:42,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-02-05 11:30:42,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-02-05 11:30:42,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:42,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:42,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:30:42,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:30:42,469 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-02-05 11:30:42,470 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:30:42,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274589349] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:30:42,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:30:42,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 11:30:42,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869664110] [2025-02-05 11:30:42,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:30:42,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:30:42,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:30:42,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:30:42,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:30:42,472 INFO L87 Difference]: Start difference. First operand 2645 states and 3036 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 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-02-05 11:30:42,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:30:42,838 INFO L93 Difference]: Finished difference Result 5566 states and 6454 transitions. [2025-02-05 11:30:42,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:30:42,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 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 283 [2025-02-05 11:30:42,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:30:42,848 INFO L225 Difference]: With dead ends: 5566 [2025-02-05 11:30:42,848 INFO L226 Difference]: Without dead ends: 3062 [2025-02-05 11:30:42,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:30:42,852 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 109 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:30:42,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 217 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 11:30:42,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2025-02-05 11:30:42,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 2784. [2025-02-05 11:30:42,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2784 states, 2783 states have (on average 1.117499101688825) internal successors, (3110), 2783 states have internal predecessors, (3110), 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-02-05 11:30:42,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 3110 transitions. [2025-02-05 11:30:42,892 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 3110 transitions. Word has length 283 [2025-02-05 11:30:42,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:30:42,892 INFO L471 AbstractCegarLoop]: Abstraction has 2784 states and 3110 transitions. [2025-02-05 11:30:42,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 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-02-05 11:30:42,892 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 3110 transitions. [2025-02-05 11:30:42,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-02-05 11:30:42,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:30:42,896 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, 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, 1, 1, 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-02-05 11:30:42,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 11:30:43,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-05 11:30:43,099 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:30:43,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:30:43,100 INFO L85 PathProgramCache]: Analyzing trace with hash -611131728, now seen corresponding path program 1 times [2025-02-05 11:30:43,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:30:43,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013170357] [2025-02-05 11:30:43,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:43,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:30:43,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-02-05 11:30:43,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-02-05 11:30:43,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:43,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:43,221 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2025-02-05 11:30:43,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:30:43,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013170357] [2025-02-05 11:30:43,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013170357] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:30:43,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:30:43,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:30:43,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319699598] [2025-02-05 11:30:43,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:30:43,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:30:43,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:30:43,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:30:43,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:30:43,224 INFO L87 Difference]: Start difference. First operand 2784 states and 3110 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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-02-05 11:30:43,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:30:43,556 INFO L93 Difference]: Finished difference Result 5842 states and 6526 transitions. [2025-02-05 11:30:43,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:30:43,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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 316 [2025-02-05 11:30:43,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:30:43,557 INFO L225 Difference]: With dead ends: 5842 [2025-02-05 11:30:43,557 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 11:30:43,562 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-02-05 11:30:43,562 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 107 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:30:43,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 219 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 11:30:43,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 11:30:43,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 11:30:43,563 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-02-05 11:30:43,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 11:30:43,563 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 316 [2025-02-05 11:30:43,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:30:43,563 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 11:30:43,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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-02-05 11:30:43,564 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 11:30:43,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 11:30:43,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 11:30:43,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 11:30:43,568 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:30:43,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 11:30:43,810 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 11:30:43,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 11:30:43 BoogieIcfgContainer [2025-02-05 11:30:43,824 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 11:30:43,825 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 11:30:43,825 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 11:30:43,825 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 11:30:43,825 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:30:33" (3/4) ... [2025-02-05 11:30:43,827 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 11:30:43,840 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-05 11:30:43,841 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 11:30:43,842 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 11:30:43,842 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 11:30:43,940 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 11:30:43,940 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 11:30:43,940 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 11:30:43,941 INFO L158 Benchmark]: Toolchain (without parser) took 12249.67ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 108.6MB in the beginning and 265.6MB in the end (delta: -157.0MB). Peak memory consumption was 120.9MB. Max. memory is 16.1GB. [2025-02-05 11:30:43,941 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 11:30:43,942 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.12ms. Allocated memory is still 142.6MB. Free memory was 107.5MB in the beginning and 80.3MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 11:30:43,942 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.59ms. Allocated memory is still 142.6MB. Free memory was 80.3MB in the beginning and 71.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 11:30:43,942 INFO L158 Benchmark]: Boogie Preprocessor took 73.85ms. Allocated memory is still 142.6MB. Free memory was 71.9MB in the beginning and 63.5MB in the end (delta: 8.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 11:30:43,942 INFO L158 Benchmark]: IcfgBuilder took 983.96ms. Allocated memory is still 142.6MB. Free memory was 63.5MB in the beginning and 100.3MB in the end (delta: -36.8MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. [2025-02-05 11:30:43,942 INFO L158 Benchmark]: TraceAbstraction took 10714.47ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 99.5MB in the beginning and 278.1MB in the end (delta: -178.6MB). Peak memory consumption was 106.5MB. Max. memory is 16.1GB. [2025-02-05 11:30:43,943 INFO L158 Benchmark]: Witness Printer took 115.49ms. Allocated memory is still 419.4MB. Free memory was 278.1MB in the beginning and 265.6MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 11:30:43,944 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.21ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.12ms. Allocated memory is still 142.6MB. Free memory was 107.5MB in the beginning and 80.3MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.59ms. Allocated memory is still 142.6MB. Free memory was 80.3MB in the beginning and 71.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.85ms. Allocated memory is still 142.6MB. Free memory was 71.9MB in the beginning and 63.5MB in the end (delta: 8.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 983.96ms. Allocated memory is still 142.6MB. Free memory was 63.5MB in the beginning and 100.3MB in the end (delta: -36.8MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10714.47ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 99.5MB in the beginning and 278.1MB in the end (delta: -178.6MB). Peak memory consumption was 106.5MB. Max. memory is 16.1GB. * Witness Printer took 115.49ms. Allocated memory is still 419.4MB. Free memory was 278.1MB in the beginning and 265.6MB in the end (delta: 12.5MB). 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: 119]: 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: 10.4s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1178 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1178 mSDsluCounter, 1490 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 82 mSDsCounter, 751 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5944 IncrementalHoareTripleChecker+Invalid, 6695 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 751 mSolverCounterUnsat, 1408 mSDtfsCounter, 5944 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 321 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2784occurred in iteration=12, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 1251 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 2665 NumberOfCodeBlocks, 2665 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2651 ConstructedInterpolants, 0 QuantifiedInterpolants, 8863 SizeOfPredicates, 0 NumberOfNonLiveVariables, 387 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 1503/1537 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: (((((((((((a10 <= 0) && (14 == a4)) && (a12 == 0)) && (9 <= a19)) || (((a19 <= 6) && (14 == a4)) && (a12 == 0))) || ((((a19 <= 9) && (14 == a4)) && (a12 == 0)) && (23 <= a1))) || (((a19 == 9) && (14 == a4)) && (a12 == 0))) || ((((a19 <= 9) && (4 <= a10)) && (14 == a4)) && (a12 == 0))) || ((((a19 <= 9) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) || ((((a10 == 1) && (14 == a4)) && (a19 <= 7)) && (a12 == 0))) || ((((a10 == 1) && (14 == a4)) && (a12 == 0)) && (9 <= a19))) RESULT: Ultimate proved your program to be correct! [2025-02-05 11:30:43,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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