./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label07.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/Problem01_label07.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 39297d98e51864b42bb205b0f8c2277625d87c54b09e28b80e649025742bd73d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:42:32,399 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:42:32,472 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:42:32,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:42:32,477 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:42:32,495 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:42:32,496 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:42:32,496 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:42:32,497 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:42:32,497 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:42:32,497 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:42:32,497 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:42:32,497 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:42:32,497 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:42:32,498 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:42:32,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:42:32,498 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:42:32,498 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:42:32,498 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:42:32,498 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:42:32,498 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:42:32,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:42:32,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:42:32,499 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:42:32,499 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:42:32,499 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:42:32,499 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:42:32,499 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:42:32,499 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:42:32,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:42:32,500 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:42:32,500 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:42:32,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:42:32,500 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:42:32,500 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:42:32,500 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:42:32,500 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:42:32,500 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:42:32,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:42:32,501 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:42:32,501 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:42:32,501 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:42:32,501 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:42:32,501 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 -> 39297d98e51864b42bb205b0f8c2277625d87c54b09e28b80e649025742bd73d [2025-02-05 10:42:32,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:42:32,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:42:32,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:42:32,822 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:42:32,822 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:42:32,823 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label07.c [2025-02-05 10:42:34,113 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83121be47/938b2dd63bc74c72b02e299af3506e63/FLAG860d3dc0b [2025-02-05 10:42:34,418 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:42:34,419 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label07.c [2025-02-05 10:42:34,436 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83121be47/938b2dd63bc74c72b02e299af3506e63/FLAG860d3dc0b [2025-02-05 10:42:34,455 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83121be47/938b2dd63bc74c72b02e299af3506e63 [2025-02-05 10:42:34,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:42:34,458 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:42:34,459 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:42:34,459 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:42:34,463 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:42:34,464 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:42:34" (1/1) ... [2025-02-05 10:42:34,464 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4479722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:34, skipping insertion in model container [2025-02-05 10:42:34,465 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:42:34" (1/1) ... [2025-02-05 10:42:34,501 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:42:34,796 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/Problem01_label07.c[18480,18493] [2025-02-05 10:42:34,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:42:34,845 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:42:34,924 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/Problem01_label07.c[18480,18493] [2025-02-05 10:42:34,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:42:34,951 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:42:34,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:34 WrapperNode [2025-02-05 10:42:34,952 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:42:34,953 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:42:34,953 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:42:34,953 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:42:34,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:34" (1/1) ... [2025-02-05 10:42:34,982 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:34" (1/1) ... [2025-02-05 10:42:35,033 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655 [2025-02-05 10:42:35,034 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:42:35,034 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:42:35,034 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:42:35,034 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:42:35,041 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:34" (1/1) ... [2025-02-05 10:42:35,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:34" (1/1) ... [2025-02-05 10:42:35,045 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:34" (1/1) ... [2025-02-05 10:42:35,074 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 10:42:35,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:34" (1/1) ... [2025-02-05 10:42:35,074 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:34" (1/1) ... [2025-02-05 10:42:35,100 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:34" (1/1) ... [2025-02-05 10:42:35,103 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:34" (1/1) ... [2025-02-05 10:42:35,107 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:34" (1/1) ... [2025-02-05 10:42:35,117 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:34" (1/1) ... [2025-02-05 10:42:35,123 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:42:35,125 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:42:35,126 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:42:35,126 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:42:35,127 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:34" (1/1) ... [2025-02-05 10:42:35,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:42:35,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:42:35,161 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 10:42:35,169 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 10:42:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:42:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:42:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:42:35,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:42:35,260 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:42:35,262 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:42:36,327 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-02-05 10:42:36,328 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:42:36,346 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:42:36,348 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:42:36,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:42:36 BoogieIcfgContainer [2025-02-05 10:42:36,349 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:42:36,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:42:36,352 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:42:36,356 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:42:36,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:42:34" (1/3) ... [2025-02-05 10:42:36,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc63b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:42:36, skipping insertion in model container [2025-02-05 10:42:36,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:34" (2/3) ... [2025-02-05 10:42:36,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc63b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:42:36, skipping insertion in model container [2025-02-05 10:42:36,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:42:36" (3/3) ... [2025-02-05 10:42:36,360 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem01_label07.c [2025-02-05 10:42:36,376 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:42:36,378 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem01_label07.c that has 1 procedures, 198 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 10:42:36,440 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:42:36,453 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;@d3ecbf7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:42:36,453 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:42:36,457 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 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 10:42:36,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 10:42:36,466 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:36,467 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:42:36,467 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:36,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:36,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1131121581, now seen corresponding path program 1 times [2025-02-05 10:42:36,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:36,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245567271] [2025-02-05 10:42:36,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:36,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:36,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 10:42:36,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 10:42:36,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:36,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:37,081 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 10:42:37,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:37,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245567271] [2025-02-05 10:42:37,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245567271] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:37,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:37,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:42:37,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25028604] [2025-02-05 10:42:37,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:37,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:42:37,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:37,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:42:37,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:42:37,114 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 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 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 10:42:37,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:37,885 INFO L93 Difference]: Finished difference Result 528 states and 912 transitions. [2025-02-05 10:42:37,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:42:37,887 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 10:42:37,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:37,897 INFO L225 Difference]: With dead ends: 528 [2025-02-05 10:42:37,899 INFO L226 Difference]: Without dead ends: 266 [2025-02-05 10:42:37,905 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 10:42:37,908 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 91 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:37,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 44 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 10:42:37,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-02-05 10:42:37,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-02-05 10:42:37,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.4792452830188678) internal successors, (392), 265 states have internal predecessors, (392), 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 10:42:37,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 392 transitions. [2025-02-05 10:42:37,964 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 392 transitions. Word has length 104 [2025-02-05 10:42:37,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:37,965 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 392 transitions. [2025-02-05 10:42:37,965 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 10:42:37,965 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 392 transitions. [2025-02-05 10:42:37,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 10:42:37,967 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:37,967 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 10:42:37,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:42:37,968 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:37,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:37,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1860169263, now seen corresponding path program 1 times [2025-02-05 10:42:37,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:37,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179622628] [2025-02-05 10:42:37,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:37,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:37,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 10:42:38,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 10:42:38,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:38,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:38,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:42:38,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:38,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179622628] [2025-02-05 10:42:38,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179622628] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:38,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:38,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:42:38,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382313124] [2025-02-05 10:42:38,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:38,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:42:38,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:38,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:42:38,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:42:38,115 INFO L87 Difference]: Start difference. First operand 266 states and 392 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 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 10:42:38,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:38,575 INFO L93 Difference]: Finished difference Result 792 states and 1171 transitions. [2025-02-05 10:42:38,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:42:38,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 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 109 [2025-02-05 10:42:38,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:38,584 INFO L225 Difference]: With dead ends: 792 [2025-02-05 10:42:38,584 INFO L226 Difference]: Without dead ends: 528 [2025-02-05 10:42:38,585 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 10:42:38,586 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 172 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:38,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 29 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:42:38,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-02-05 10:42:38,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2025-02-05 10:42:38,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.413662239089184) internal successors, (745), 527 states have internal predecessors, (745), 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 10:42:38,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 745 transitions. [2025-02-05 10:42:38,629 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 745 transitions. Word has length 109 [2025-02-05 10:42:38,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:38,629 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 745 transitions. [2025-02-05 10:42:38,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 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 10:42:38,633 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 745 transitions. [2025-02-05 10:42:38,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 10:42:38,636 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:38,636 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 10:42:38,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:42:38,637 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:38,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:38,639 INFO L85 PathProgramCache]: Analyzing trace with hash -2056478280, now seen corresponding path program 1 times [2025-02-05 10:42:38,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:38,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008747508] [2025-02-05 10:42:38,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:38,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:38,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 10:42:38,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 10:42:38,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:38,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:38,894 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:42:38,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:38,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008747508] [2025-02-05 10:42:38,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008747508] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:38,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:38,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:42:38,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139064811] [2025-02-05 10:42:38,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:38,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:42:38,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:38,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:42:38,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:42:38,896 INFO L87 Difference]: Start difference. First operand 528 states and 745 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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 10:42:39,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:39,320 INFO L93 Difference]: Finished difference Result 1447 states and 2032 transitions. [2025-02-05 10:42:39,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:42:39,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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 119 [2025-02-05 10:42:39,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:39,324 INFO L225 Difference]: With dead ends: 1447 [2025-02-05 10:42:39,325 INFO L226 Difference]: Without dead ends: 921 [2025-02-05 10:42:39,326 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 10:42:39,330 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 122 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:39,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 56 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:42:39,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2025-02-05 10:42:39,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 790. [2025-02-05 10:42:39,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 789 states have (on average 1.3219264892268694) internal successors, (1043), 789 states have internal predecessors, (1043), 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 10:42:39,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1043 transitions. [2025-02-05 10:42:39,362 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1043 transitions. Word has length 119 [2025-02-05 10:42:39,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:39,362 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 1043 transitions. [2025-02-05 10:42:39,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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 10:42:39,362 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1043 transitions. [2025-02-05 10:42:39,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 10:42:39,364 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:39,364 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-02-05 10:42:39,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:42:39,367 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:39,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:39,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1877347108, now seen corresponding path program 1 times [2025-02-05 10:42:39,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:39,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105349760] [2025-02-05 10:42:39,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:39,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:39,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 10:42:39,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 10:42:39,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:39,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:39,553 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 10:42:39,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:39,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105349760] [2025-02-05 10:42:39,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105349760] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:39,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:39,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:42:39,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413356197] [2025-02-05 10:42:39,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:39,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:42:39,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:39,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:42:39,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:42:39,555 INFO L87 Difference]: Start difference. First operand 790 states and 1043 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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 10:42:39,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:39,957 INFO L93 Difference]: Finished difference Result 1840 states and 2437 transitions. [2025-02-05 10:42:39,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:42:39,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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 120 [2025-02-05 10:42:39,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:39,965 INFO L225 Difference]: With dead ends: 1840 [2025-02-05 10:42:39,966 INFO L226 Difference]: Without dead ends: 1052 [2025-02-05 10:42:39,967 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 10:42:39,967 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 127 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:39,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 74 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:42:39,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2025-02-05 10:42:39,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 921. [2025-02-05 10:42:39,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.2891304347826087) internal successors, (1186), 920 states have internal predecessors, (1186), 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 10:42:39,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1186 transitions. [2025-02-05 10:42:39,989 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1186 transitions. Word has length 120 [2025-02-05 10:42:39,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:39,990 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1186 transitions. [2025-02-05 10:42:39,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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 10:42:39,990 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1186 transitions. [2025-02-05 10:42:39,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 10:42:39,992 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:39,992 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2025-02-05 10:42:39,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 10:42:39,993 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:39,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:39,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1259640673, now seen corresponding path program 1 times [2025-02-05 10:42:39,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:39,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266064355] [2025-02-05 10:42:39,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:39,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:40,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 10:42:40,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 10:42:40,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:40,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:40,175 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 10:42:40,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:40,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266064355] [2025-02-05 10:42:40,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266064355] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:40,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:40,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:42:40,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647043844] [2025-02-05 10:42:40,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:40,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:42:40,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:40,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:42:40,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:42:40,178 INFO L87 Difference]: Start difference. First operand 921 states and 1186 transitions. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 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 10:42:40,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:40,800 INFO L93 Difference]: Finished difference Result 2364 states and 3051 transitions. [2025-02-05 10:42:40,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:42:40,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 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 124 [2025-02-05 10:42:40,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:40,806 INFO L225 Difference]: With dead ends: 2364 [2025-02-05 10:42:40,806 INFO L226 Difference]: Without dead ends: 1445 [2025-02-05 10:42:40,807 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 10:42:40,808 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 264 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:40,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 53 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:42:40,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2025-02-05 10:42:40,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1314. [2025-02-05 10:42:40,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 1313 states have (on average 1.2665651180502666) internal successors, (1663), 1313 states have internal predecessors, (1663), 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 10:42:40,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1663 transitions. [2025-02-05 10:42:40,837 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1663 transitions. Word has length 124 [2025-02-05 10:42:40,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:40,837 INFO L471 AbstractCegarLoop]: Abstraction has 1314 states and 1663 transitions. [2025-02-05 10:42:40,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 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 10:42:40,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1663 transitions. [2025-02-05 10:42:40,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-05 10:42:40,851 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:40,851 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 10:42:40,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 10:42:40,851 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:40,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:40,852 INFO L85 PathProgramCache]: Analyzing trace with hash -355718687, now seen corresponding path program 1 times [2025-02-05 10:42:40,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:40,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885424130] [2025-02-05 10:42:40,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:40,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:40,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-05 10:42:40,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-05 10:42:40,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:40,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:41,068 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 10:42:41,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:41,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885424130] [2025-02-05 10:42:41,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885424130] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:41,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:41,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:42:41,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476099487] [2025-02-05 10:42:41,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:41,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:42:41,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:41,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:42:41,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:42:41,072 INFO L87 Difference]: Start difference. First operand 1314 states and 1663 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 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 10:42:41,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:41,740 INFO L93 Difference]: Finished difference Result 3543 states and 4391 transitions. [2025-02-05 10:42:41,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:42:41,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 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 153 [2025-02-05 10:42:41,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:41,748 INFO L225 Difference]: With dead ends: 3543 [2025-02-05 10:42:41,748 INFO L226 Difference]: Without dead ends: 2100 [2025-02-05 10:42:41,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:42:41,752 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 245 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:41,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 41 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:42:41,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2025-02-05 10:42:41,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1707. [2025-02-05 10:42:41,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.219812426729191) internal successors, (2081), 1706 states have internal predecessors, (2081), 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 10:42:41,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2081 transitions. [2025-02-05 10:42:41,795 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2081 transitions. Word has length 153 [2025-02-05 10:42:41,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:41,797 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 2081 transitions. [2025-02-05 10:42:41,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 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 10:42:41,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2081 transitions. [2025-02-05 10:42:41,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-02-05 10:42:41,802 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:41,802 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:42:41,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 10:42:41,803 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:41,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:41,804 INFO L85 PathProgramCache]: Analyzing trace with hash 539601972, now seen corresponding path program 1 times [2025-02-05 10:42:41,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:41,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112884925] [2025-02-05 10:42:41,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:41,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:41,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-05 10:42:41,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-05 10:42:41,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:41,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:42,062 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-02-05 10:42:42,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:42,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112884925] [2025-02-05 10:42:42,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112884925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:42,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:42,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:42:42,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339962315] [2025-02-05 10:42:42,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:42,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:42:42,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:42,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:42:42,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:42:42,064 INFO L87 Difference]: Start difference. First operand 1707 states and 2081 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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 10:42:42,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:42,461 INFO L93 Difference]: Finished difference Result 3805 states and 4618 transitions. [2025-02-05 10:42:42,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:42:42,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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 209 [2025-02-05 10:42:42,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:42,470 INFO L225 Difference]: With dead ends: 3805 [2025-02-05 10:42:42,471 INFO L226 Difference]: Without dead ends: 2100 [2025-02-05 10:42:42,474 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 10:42:42,475 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 93 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:42,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 47 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:42:42,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2025-02-05 10:42:42,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1838. [2025-02-05 10:42:42,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.2237343494828525) internal successors, (2248), 1837 states have internal predecessors, (2248), 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 10:42:42,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2248 transitions. [2025-02-05 10:42:42,523 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2248 transitions. Word has length 209 [2025-02-05 10:42:42,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:42,524 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 2248 transitions. [2025-02-05 10:42:42,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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 10:42:42,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2248 transitions. [2025-02-05 10:42:42,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-02-05 10:42:42,531 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:42,532 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:42:42,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 10:42:42,532 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:42,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:42,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1874324618, now seen corresponding path program 1 times [2025-02-05 10:42:42,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:42,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698033859] [2025-02-05 10:42:42,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:42,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:42,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-02-05 10:42:42,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-02-05 10:42:42,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:42,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:42,840 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2025-02-05 10:42:42,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:42,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698033859] [2025-02-05 10:42:42,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698033859] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:42,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:42,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:42:42,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968048977] [2025-02-05 10:42:42,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:42,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:42:42,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:42,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:42:42,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:42:42,842 INFO L87 Difference]: Start difference. First operand 1838 states and 2248 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 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 10:42:43,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:43,425 INFO L93 Difference]: Finished difference Result 3936 states and 4784 transitions. [2025-02-05 10:42:43,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:42:43,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 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 234 [2025-02-05 10:42:43,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:43,434 INFO L225 Difference]: With dead ends: 3936 [2025-02-05 10:42:43,434 INFO L226 Difference]: Without dead ends: 2100 [2025-02-05 10:42:43,436 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 10:42:43,437 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 265 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:43,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 51 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:42:43,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2025-02-05 10:42:43,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1969. [2025-02-05 10:42:43,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1969 states, 1968 states have (on average 1.2113821138211383) internal successors, (2384), 1968 states have internal predecessors, (2384), 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 10:42:43,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2384 transitions. [2025-02-05 10:42:43,493 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2384 transitions. Word has length 234 [2025-02-05 10:42:43,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:43,494 INFO L471 AbstractCegarLoop]: Abstraction has 1969 states and 2384 transitions. [2025-02-05 10:42:43,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 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 10:42:43,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2384 transitions. [2025-02-05 10:42:43,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-02-05 10:42:43,500 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:43,500 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 10:42:43,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 10:42:43,501 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:43,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:43,501 INFO L85 PathProgramCache]: Analyzing trace with hash 2080448286, now seen corresponding path program 1 times [2025-02-05 10:42:43,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:43,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396513150] [2025-02-05 10:42:43,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:43,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:43,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-05 10:42:43,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-05 10:42:43,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:43,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:43,714 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-02-05 10:42:43,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:43,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396513150] [2025-02-05 10:42:43,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396513150] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:43,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:43,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:42:43,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958372195] [2025-02-05 10:42:43,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:43,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:42:43,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:43,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:42:43,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:42:43,716 INFO L87 Difference]: Start difference. First operand 1969 states and 2384 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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 10:42:44,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:44,111 INFO L93 Difference]: Finished difference Result 4198 states and 5052 transitions. [2025-02-05 10:42:44,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:42:44,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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 252 [2025-02-05 10:42:44,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:44,120 INFO L225 Difference]: With dead ends: 4198 [2025-02-05 10:42:44,120 INFO L226 Difference]: Without dead ends: 2231 [2025-02-05 10:42:44,122 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 10:42:44,125 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 88 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:44,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 190 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:42:44,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2025-02-05 10:42:44,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2100. [2025-02-05 10:42:44,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 2099 states have (on average 1.175321581705574) internal successors, (2467), 2099 states have internal predecessors, (2467), 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 10:42:44,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2467 transitions. [2025-02-05 10:42:44,168 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2467 transitions. Word has length 252 [2025-02-05 10:42:44,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:44,168 INFO L471 AbstractCegarLoop]: Abstraction has 2100 states and 2467 transitions. [2025-02-05 10:42:44,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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 10:42:44,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2467 transitions. [2025-02-05 10:42:44,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-02-05 10:42:44,174 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:44,174 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2025-02-05 10:42:44,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 10:42:44,175 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:44,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:44,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1628152427, now seen corresponding path program 1 times [2025-02-05 10:42:44,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:44,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706312419] [2025-02-05 10:42:44,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:44,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:44,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-02-05 10:42:44,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-02-05 10:42:44,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:44,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:44,365 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-02-05 10:42:44,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:44,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706312419] [2025-02-05 10:42:44,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706312419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:44,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:44,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:42:44,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24968449] [2025-02-05 10:42:44,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:44,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:42:44,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:44,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:42:44,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:42:44,367 INFO L87 Difference]: Start difference. First operand 2100 states and 2467 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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 10:42:44,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:44,797 INFO L93 Difference]: Finished difference Result 4198 states and 4932 transitions. [2025-02-05 10:42:44,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:42:44,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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 265 [2025-02-05 10:42:44,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:44,807 INFO L225 Difference]: With dead ends: 4198 [2025-02-05 10:42:44,807 INFO L226 Difference]: Without dead ends: 2100 [2025-02-05 10:42:44,810 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 10:42:44,811 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 97 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:44,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 178 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:42:44,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2025-02-05 10:42:44,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2100. [2025-02-05 10:42:44,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 2099 states have (on average 1.1443544545021438) internal successors, (2402), 2099 states have internal predecessors, (2402), 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 10:42:44,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2402 transitions. [2025-02-05 10:42:44,858 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2402 transitions. Word has length 265 [2025-02-05 10:42:44,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:44,859 INFO L471 AbstractCegarLoop]: Abstraction has 2100 states and 2402 transitions. [2025-02-05 10:42:44,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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 10:42:44,860 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2402 transitions. [2025-02-05 10:42:44,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-05 10:42:44,866 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:44,866 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:42:44,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 10:42:44,867 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:44,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:44,867 INFO L85 PathProgramCache]: Analyzing trace with hash 465065013, now seen corresponding path program 1 times [2025-02-05 10:42:44,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:44,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044001852] [2025-02-05 10:42:44,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:44,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:44,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-05 10:42:44,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-05 10:42:44,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:44,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:45,533 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 256 proven. 142 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:42:45,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:45,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044001852] [2025-02-05 10:42:45,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044001852] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:42:45,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604389886] [2025-02-05 10:42:45,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:45,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:42:45,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:42:45,538 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 10:42:45,540 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 10:42:45,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-05 10:42:45,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-05 10:42:45,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:45,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:45,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:42:45,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:42:45,966 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-02-05 10:42:45,967 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:42:45,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604389886] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:45,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:42:45,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 10:42:45,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165318733] [2025-02-05 10:42:45,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:45,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:42:45,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:45,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:42:45,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:42:45,969 INFO L87 Difference]: Start difference. First operand 2100 states and 2402 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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 10:42:46,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:46,384 INFO L93 Difference]: Finished difference Result 4196 states and 4801 transitions. [2025-02-05 10:42:46,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:42:46,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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 274 [2025-02-05 10:42:46,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:46,386 INFO L225 Difference]: With dead ends: 4196 [2025-02-05 10:42:46,386 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 10:42:46,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:42:46,391 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 34 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:46,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 189 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:42:46,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 10:42:46,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 10:42:46,393 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 10:42:46,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 10:42:46,394 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 274 [2025-02-05 10:42:46,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:46,394 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 10:42:46,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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 10:42:46,394 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 10:42:46,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 10:42:46,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 10:42:46,405 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 10:42:46,597 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,SelfDestructingSolverStorable10 [2025-02-05 10:42:46,600 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:42:46,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 10:42:46,796 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 10:42:46,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:42:46 BoogieIcfgContainer [2025-02-05 10:42:46,811 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 10:42:46,811 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 10:42:46,812 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 10:42:46,812 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 10:42:46,812 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:42:36" (3/4) ... [2025-02-05 10:42:46,814 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 10:42:46,830 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-05 10:42:46,834 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 10:42:46,835 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 10:42:46,836 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 10:42:46,963 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 10:42:46,964 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 10:42:46,964 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 10:42:46,965 INFO L158 Benchmark]: Toolchain (without parser) took 12506.56ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 120.5MB in the beginning and 79.1MB in the end (delta: 41.4MB). Peak memory consumption was 127.3MB. Max. memory is 16.1GB. [2025-02-05 10:42:46,965 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:42:46,965 INFO L158 Benchmark]: CACSL2BoogieTranslator took 493.40ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 93.6MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 10:42:46,965 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.94ms. Allocated memory is still 167.8MB. Free memory was 93.6MB in the beginning and 88.3MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 10:42:46,965 INFO L158 Benchmark]: Boogie Preprocessor took 89.14ms. Allocated memory is still 167.8MB. Free memory was 88.3MB in the beginning and 84.3MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:42:46,966 INFO L158 Benchmark]: IcfgBuilder took 1224.29ms. Allocated memory is still 167.8MB. Free memory was 84.3MB in the beginning and 85.2MB in the end (delta: -971.6kB). Peak memory consumption was 67.4MB. Max. memory is 16.1GB. [2025-02-05 10:42:46,966 INFO L158 Benchmark]: TraceAbstraction took 10459.77ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 84.5MB in the beginning and 90.3MB in the end (delta: -5.8MB). Peak memory consumption was 76.6MB. Max. memory is 16.1GB. [2025-02-05 10:42:46,966 INFO L158 Benchmark]: Witness Printer took 152.39ms. Allocated memory is still 251.7MB. Free memory was 90.3MB in the beginning and 79.1MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 10:42:46,968 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 493.40ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 93.6MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.94ms. Allocated memory is still 167.8MB. Free memory was 93.6MB in the beginning and 88.3MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.14ms. Allocated memory is still 167.8MB. Free memory was 88.3MB in the beginning and 84.3MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1224.29ms. Allocated memory is still 167.8MB. Free memory was 84.3MB in the beginning and 85.2MB in the end (delta: -971.6kB). Peak memory consumption was 67.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10459.77ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 84.5MB in the beginning and 90.3MB in the end (delta: -5.8MB). Peak memory consumption was 76.6MB. Max. memory is 16.1GB. * Witness Printer took 152.39ms. Allocated memory is still 251.7MB. Free memory was 90.3MB in the beginning and 79.1MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. 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: 498]: 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, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.2s, OverallIterations: 11, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1598 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1598 mSDsluCounter, 952 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 744 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4429 IncrementalHoareTripleChecker+Invalid, 5173 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 744 mSolverCounterUnsat, 882 mSDtfsCounter, 4429 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 307 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2100occurred in iteration=9, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1310 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2237 NumberOfCodeBlocks, 2237 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2225 ConstructedInterpolants, 0 QuantifiedInterpolants, 5310 SizeOfPredicates, 0 NumberOfNonLiveVariables, 510 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 2168/2310 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: 593]: Location Invariant Derived location invariant: ((((((a21 == 1) && (a16 <= 5)) || ((a16 == 6) && (a21 <= 0))) || ((a21 <= 0) && (a16 <= 5))) || ((a21 == 1) && (a20 == 1))) || (((a16 == 6) && (a7 != 1)) && (a21 == 1))) RESULT: Ultimate proved your program to be correct! [2025-02-05 10:42:46,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE