./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label46.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/Problem02_label46.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 6c9ef72945147e4ae81caf50df56c252d6632fa10df84ba86d26e6872e2ab991 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:54:15,409 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:54:15,482 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:54:15,487 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:54:15,490 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:54:15,517 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:54:15,519 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:54:15,519 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:54:15,519 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:54:15,520 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:54:15,520 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:54:15,521 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:54:15,521 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:54:15,521 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:54:15,521 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:54:15,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:54:15,522 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:54:15,522 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:54:15,522 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:54:15,522 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:54:15,522 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:54:15,522 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:54:15,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:54:15,523 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:54:15,523 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:54:15,523 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:54:15,523 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:54:15,523 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:54:15,523 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:54:15,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:54:15,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:54:15,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:54:15,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:54:15,524 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:54:15,524 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:54:15,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:54:15,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:54:15,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:54:15,524 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:54:15,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:54:15,525 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:54:15,525 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:54:15,525 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:54:15,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:54:15,525 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:54:15,525 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:54:15,525 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:54:15,526 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:54:15,526 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 -> 6c9ef72945147e4ae81caf50df56c252d6632fa10df84ba86d26e6872e2ab991 [2025-01-08 22:54:15,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:54:15,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:54:15,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:54:15,807 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:54:15,807 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:54:15,809 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label46.c [2025-01-08 22:54:17,071 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2770c943f/8d9c129bcaa74d05b973eb9722521533/FLAG98e39d622 [2025-01-08 22:54:17,424 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:54:17,425 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label46.c [2025-01-08 22:54:17,448 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2770c943f/8d9c129bcaa74d05b973eb9722521533/FLAG98e39d622 [2025-01-08 22:54:17,644 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2770c943f/8d9c129bcaa74d05b973eb9722521533 [2025-01-08 22:54:17,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:54:17,647 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:54:17,648 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:54:17,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:54:17,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:54:17,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:54:17" (1/1) ... [2025-01-08 22:54:17,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f422569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:17, skipping insertion in model container [2025-01-08 22:54:17,656 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:54:17" (1/1) ... [2025-01-08 22:54:17,693 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:54:17,991 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/Problem02_label46.c[18150,18163] [2025-01-08 22:54:18,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:54:18,042 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:54:18,118 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/Problem02_label46.c[18150,18163] [2025-01-08 22:54:18,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:54:18,159 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:54:18,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:18 WrapperNode [2025-01-08 22:54:18,162 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:54:18,163 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:54:18,163 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:54:18,163 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:54:18,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:18" (1/1) ... [2025-01-08 22:54:18,182 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:18" (1/1) ... [2025-01-08 22:54:18,219 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 666 [2025-01-08 22:54:18,220 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:54:18,220 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:54:18,220 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:54:18,221 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:54:18,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:18" (1/1) ... [2025-01-08 22:54:18,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:18" (1/1) ... [2025-01-08 22:54:18,237 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:18" (1/1) ... [2025-01-08 22:54:18,272 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-01-08 22:54:18,273 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:18" (1/1) ... [2025-01-08 22:54:18,273 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:18" (1/1) ... [2025-01-08 22:54:18,297 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:18" (1/1) ... [2025-01-08 22:54:18,306 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:18" (1/1) ... [2025-01-08 22:54:18,320 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:18" (1/1) ... [2025-01-08 22:54:18,326 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:18" (1/1) ... [2025-01-08 22:54:18,330 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:18" (1/1) ... [2025-01-08 22:54:18,334 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:54:18,335 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:54:18,336 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:54:18,336 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:54:18,337 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:18" (1/1) ... [2025-01-08 22:54:18,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:54:18,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:54:18,369 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-01-08 22:54:18,373 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-01-08 22:54:18,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:54:18,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:54:18,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:54:18,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:54:18,465 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:54:18,467 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:54:19,389 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-01-08 22:54:19,390 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:54:19,408 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:54:19,408 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 22:54:19,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:54:19 BoogieIcfgContainer [2025-01-08 22:54:19,409 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:54:19,410 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:54:19,411 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:54:19,414 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:54:19,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:54:17" (1/3) ... [2025-01-08 22:54:19,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a37fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:54:19, skipping insertion in model container [2025-01-08 22:54:19,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:18" (2/3) ... [2025-01-08 22:54:19,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a37fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:54:19, skipping insertion in model container [2025-01-08 22:54:19,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:54:19" (3/3) ... [2025-01-08 22:54:19,417 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem02_label46.c [2025-01-08 22:54:19,431 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:54:19,434 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem02_label46.c that has 1 procedures, 227 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:54:19,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:54:19,499 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;@3eba2b3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:54:19,499 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:54:19,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6622222222222223) internal successors, (374), 226 states have internal predecessors, (374), 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-01-08 22:54:19,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-08 22:54:19,511 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:19,512 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:19,512 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:19,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:19,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1489470683, now seen corresponding path program 1 times [2025-01-08 22:54:19,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:19,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514783415] [2025-01-08 22:54:19,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:19,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:19,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-08 22:54:19,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-08 22:54:19,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:19,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:20,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:54:20,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:20,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514783415] [2025-01-08 22:54:20,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514783415] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:20,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:20,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:54:20,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213776544] [2025-01-08 22:54:20,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:20,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:20,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:20,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:20,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:20,146 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6622222222222223) internal successors, (374), 226 states have internal predecessors, (374), 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 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 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-01-08 22:54:20,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:20,876 INFO L93 Difference]: Finished difference Result 600 states and 1034 transitions. [2025-01-08 22:54:20,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:20,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 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 112 [2025-01-08 22:54:20,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:20,888 INFO L225 Difference]: With dead ends: 600 [2025-01-08 22:54:20,888 INFO L226 Difference]: Without dead ends: 309 [2025-01-08 22:54:20,891 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-01-08 22:54:20,895 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 54 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:20,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 171 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 22:54:20,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-01-08 22:54:20,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2025-01-08 22:54:20,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.3300653594771241) internal successors, (407), 306 states have internal predecessors, (407), 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-01-08 22:54:20,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 407 transitions. [2025-01-08 22:54:20,949 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 407 transitions. Word has length 112 [2025-01-08 22:54:20,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:20,949 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 407 transitions. [2025-01-08 22:54:20,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 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-01-08 22:54:20,950 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 407 transitions. [2025-01-08 22:54:20,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-08 22:54:20,954 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:20,954 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:20,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:54:20,955 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:20,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:20,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1754413611, now seen corresponding path program 1 times [2025-01-08 22:54:20,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:20,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960351434] [2025-01-08 22:54:20,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:20,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:20,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-08 22:54:21,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-08 22:54:21,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:21,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:21,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:54:21,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:21,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960351434] [2025-01-08 22:54:21,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960351434] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:21,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:21,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:54:21,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513856159] [2025-01-08 22:54:21,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:21,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:21,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:21,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:21,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:21,205 INFO L87 Difference]: Start difference. First operand 307 states and 407 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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-01-08 22:54:21,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:21,705 INFO L93 Difference]: Finished difference Result 895 states and 1186 transitions. [2025-01-08 22:54:21,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:21,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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 117 [2025-01-08 22:54:21,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:21,709 INFO L225 Difference]: With dead ends: 895 [2025-01-08 22:54:21,709 INFO L226 Difference]: Without dead ends: 590 [2025-01-08 22:54:21,710 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-01-08 22:54:21,711 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 93 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:21,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 62 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:54:21,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-01-08 22:54:21,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2025-01-08 22:54:21,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 589 states have (on average 1.2869269949066213) internal successors, (758), 589 states have internal predecessors, (758), 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-01-08 22:54:21,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 758 transitions. [2025-01-08 22:54:21,733 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 758 transitions. Word has length 117 [2025-01-08 22:54:21,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:21,734 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 758 transitions. [2025-01-08 22:54:21,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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-01-08 22:54:21,734 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 758 transitions. [2025-01-08 22:54:21,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-08 22:54:21,737 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:21,737 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:21,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:54:21,737 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:21,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:21,738 INFO L85 PathProgramCache]: Analyzing trace with hash 416906070, now seen corresponding path program 1 times [2025-01-08 22:54:21,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:21,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228936728] [2025-01-08 22:54:21,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:21,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:21,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-08 22:54:21,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-08 22:54:21,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:21,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:21,985 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:54:21,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:21,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228936728] [2025-01-08 22:54:21,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228936728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:21,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:21,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:54:21,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492553501] [2025-01-08 22:54:21,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:21,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:21,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:21,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:21,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:21,989 INFO L87 Difference]: Start difference. First operand 590 states and 758 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-01-08 22:54:22,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:22,438 INFO L93 Difference]: Finished difference Result 1460 states and 1934 transitions. [2025-01-08 22:54:22,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:22,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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 121 [2025-01-08 22:54:22,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:22,443 INFO L225 Difference]: With dead ends: 1460 [2025-01-08 22:54:22,443 INFO L226 Difference]: Without dead ends: 872 [2025-01-08 22:54:22,445 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-01-08 22:54:22,445 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 145 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:22,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 250 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:54:22,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-01-08 22:54:22,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 871. [2025-01-08 22:54:22,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 870 states have (on average 1.2298850574712643) internal successors, (1070), 870 states have internal predecessors, (1070), 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-01-08 22:54:22,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1070 transitions. [2025-01-08 22:54:22,479 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1070 transitions. Word has length 121 [2025-01-08 22:54:22,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:22,479 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1070 transitions. [2025-01-08 22:54:22,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-01-08 22:54:22,480 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1070 transitions. [2025-01-08 22:54:22,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-08 22:54:22,482 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:22,483 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:22,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:54:22,483 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:22,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:22,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1785968396, now seen corresponding path program 1 times [2025-01-08 22:54:22,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:22,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123202428] [2025-01-08 22:54:22,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:22,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:22,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-08 22:54:22,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-08 22:54:22,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:22,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:22,653 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:54:22,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:22,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123202428] [2025-01-08 22:54:22,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123202428] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:22,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:22,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:54:22,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831678148] [2025-01-08 22:54:22,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:22,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:22,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:22,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:22,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:22,655 INFO L87 Difference]: Start difference. First operand 871 states and 1070 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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-01-08 22:54:23,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:23,086 INFO L93 Difference]: Finished difference Result 1882 states and 2342 transitions. [2025-01-08 22:54:23,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:23,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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 125 [2025-01-08 22:54:23,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:23,091 INFO L225 Difference]: With dead ends: 1882 [2025-01-08 22:54:23,092 INFO L226 Difference]: Without dead ends: 1013 [2025-01-08 22:54:23,093 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-01-08 22:54:23,094 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 140 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:23,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 265 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:54:23,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2025-01-08 22:54:23,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 1012. [2025-01-08 22:54:23,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 1.2077151335311573) internal successors, (1221), 1011 states have internal predecessors, (1221), 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-01-08 22:54:23,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1221 transitions. [2025-01-08 22:54:23,124 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1221 transitions. Word has length 125 [2025-01-08 22:54:23,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:23,125 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1221 transitions. [2025-01-08 22:54:23,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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-01-08 22:54:23,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1221 transitions. [2025-01-08 22:54:23,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-08 22:54:23,131 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:23,132 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:54:23,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:54:23,132 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:23,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:23,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1560827227, now seen corresponding path program 1 times [2025-01-08 22:54:23,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:23,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981697756] [2025-01-08 22:54:23,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:23,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:23,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-08 22:54:23,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-08 22:54:23,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:23,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:23,243 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:54:23,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:23,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981697756] [2025-01-08 22:54:23,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981697756] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:23,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:23,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:54:23,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261779335] [2025-01-08 22:54:23,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:23,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:23,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:23,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:23,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:23,247 INFO L87 Difference]: Start difference. First operand 1012 states and 1221 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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-01-08 22:54:23,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:23,727 INFO L93 Difference]: Finished difference Result 2862 states and 3472 transitions. [2025-01-08 22:54:23,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:23,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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 133 [2025-01-08 22:54:23,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:23,735 INFO L225 Difference]: With dead ends: 2862 [2025-01-08 22:54:23,735 INFO L226 Difference]: Without dead ends: 1852 [2025-01-08 22:54:23,737 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-01-08 22:54:23,738 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 180 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:23,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 81 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:54:23,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2025-01-08 22:54:23,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1852. [2025-01-08 22:54:23,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1852 states, 1851 states have (on average 1.1761210156672068) internal successors, (2177), 1851 states have internal predecessors, (2177), 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-01-08 22:54:23,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 2177 transitions. [2025-01-08 22:54:23,794 INFO L78 Accepts]: Start accepts. Automaton has 1852 states and 2177 transitions. Word has length 133 [2025-01-08 22:54:23,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:23,795 INFO L471 AbstractCegarLoop]: Abstraction has 1852 states and 2177 transitions. [2025-01-08 22:54:23,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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-01-08 22:54:23,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 2177 transitions. [2025-01-08 22:54:23,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-08 22:54:23,802 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:23,803 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:54:23,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:54:23,803 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:23,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:23,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1468287042, now seen corresponding path program 1 times [2025-01-08 22:54:23,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:23,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575621154] [2025-01-08 22:54:23,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:23,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:23,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-08 22:54:23,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-08 22:54:23,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:23,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:24,010 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-08 22:54:24,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:24,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575621154] [2025-01-08 22:54:24,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575621154] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:24,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:24,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:54:24,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524626104] [2025-01-08 22:54:24,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:24,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:24,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:24,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:24,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:24,015 INFO L87 Difference]: Start difference. First operand 1852 states and 2177 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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-01-08 22:54:24,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:24,472 INFO L93 Difference]: Finished difference Result 3702 states and 4352 transitions. [2025-01-08 22:54:24,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:24,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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 139 [2025-01-08 22:54:24,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:24,479 INFO L225 Difference]: With dead ends: 3702 [2025-01-08 22:54:24,479 INFO L226 Difference]: Without dead ends: 1852 [2025-01-08 22:54:24,481 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-01-08 22:54:24,482 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 52 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:24,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 244 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:54:24,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2025-01-08 22:54:24,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1432. [2025-01-08 22:54:24,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1431 states have (on average 1.1174004192872118) internal successors, (1599), 1431 states have internal predecessors, (1599), 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-01-08 22:54:24,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1599 transitions. [2025-01-08 22:54:24,508 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1599 transitions. Word has length 139 [2025-01-08 22:54:24,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:24,508 INFO L471 AbstractCegarLoop]: Abstraction has 1432 states and 1599 transitions. [2025-01-08 22:54:24,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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-01-08 22:54:24,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1599 transitions. [2025-01-08 22:54:24,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-08 22:54:24,511 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:24,512 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:54:24,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 22:54:24,512 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:24,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:24,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1146776723, now seen corresponding path program 1 times [2025-01-08 22:54:24,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:24,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642040731] [2025-01-08 22:54:24,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:24,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:24,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-08 22:54:24,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-08 22:54:24,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:24,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-08 22:54:24,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:24,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642040731] [2025-01-08 22:54:24,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642040731] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:24,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:24,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:54:24,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781174417] [2025-01-08 22:54:24,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:24,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:54:24,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:24,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:54:24,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:54:24,767 INFO L87 Difference]: Start difference. First operand 1432 states and 1599 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 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-01-08 22:54:25,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:25,415 INFO L93 Difference]: Finished difference Result 3219 states and 3641 transitions. [2025-01-08 22:54:25,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:54:25,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 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 146 [2025-01-08 22:54:25,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:25,421 INFO L225 Difference]: With dead ends: 3219 [2025-01-08 22:54:25,421 INFO L226 Difference]: Without dead ends: 1706 [2025-01-08 22:54:25,422 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-01-08 22:54:25,423 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 144 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:25,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 87 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:54:25,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2025-01-08 22:54:25,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1426. [2025-01-08 22:54:25,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1425 states have (on average 1.103859649122807) internal successors, (1573), 1425 states have internal predecessors, (1573), 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-01-08 22:54:25,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 1573 transitions. [2025-01-08 22:54:25,452 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 1573 transitions. Word has length 146 [2025-01-08 22:54:25,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:25,452 INFO L471 AbstractCegarLoop]: Abstraction has 1426 states and 1573 transitions. [2025-01-08 22:54:25,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 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-01-08 22:54:25,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 1573 transitions. [2025-01-08 22:54:25,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-08 22:54:25,456 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:25,456 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 22:54:25,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 22:54:25,457 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:25,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:25,459 INFO L85 PathProgramCache]: Analyzing trace with hash -566455115, now seen corresponding path program 1 times [2025-01-08 22:54:25,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:25,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456286508] [2025-01-08 22:54:25,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:25,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:25,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-08 22:54:25,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-08 22:54:25,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:25,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:25,686 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-08 22:54:25,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:25,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456286508] [2025-01-08 22:54:25,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456286508] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:25,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:25,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:54:25,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972022457] [2025-01-08 22:54:25,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:25,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:54:25,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:25,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:54:25,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:54:25,689 INFO L87 Difference]: Start difference. First operand 1426 states and 1573 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 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-01-08 22:54:26,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:26,468 INFO L93 Difference]: Finished difference Result 3410 states and 3787 transitions. [2025-01-08 22:54:26,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:54:26,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 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 168 [2025-01-08 22:54:26,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:26,486 INFO L225 Difference]: With dead ends: 3410 [2025-01-08 22:54:26,487 INFO L226 Difference]: Without dead ends: 1706 [2025-01-08 22:54:26,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:54:26,489 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 367 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:26,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 107 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 22:54:26,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2025-01-08 22:54:26,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1426. [2025-01-08 22:54:26,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1425 states have (on average 1.0764912280701755) internal successors, (1534), 1425 states have internal predecessors, (1534), 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-01-08 22:54:26,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 1534 transitions. [2025-01-08 22:54:26,519 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 1534 transitions. Word has length 168 [2025-01-08 22:54:26,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:26,520 INFO L471 AbstractCegarLoop]: Abstraction has 1426 states and 1534 transitions. [2025-01-08 22:54:26,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 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-01-08 22:54:26,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 1534 transitions. [2025-01-08 22:54:26,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-08 22:54:26,524 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:26,524 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:54:26,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 22:54:26,524 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:26,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:26,525 INFO L85 PathProgramCache]: Analyzing trace with hash 2115133213, now seen corresponding path program 1 times [2025-01-08 22:54:26,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:26,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461969746] [2025-01-08 22:54:26,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:26,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:26,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-08 22:54:26,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-08 22:54:26,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:26,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:26,823 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-08 22:54:26,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:26,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461969746] [2025-01-08 22:54:26,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461969746] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:26,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:26,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:54:26,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730413552] [2025-01-08 22:54:26,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:26,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:54:26,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:26,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:54:26,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:54:26,826 INFO L87 Difference]: Start difference. First operand 1426 states and 1534 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 4 states have internal predecessors, (179), 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-01-08 22:54:27,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:27,401 INFO L93 Difference]: Finished difference Result 3216 states and 3481 transitions. [2025-01-08 22:54:27,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:54:27,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 4 states have internal predecessors, (179), 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 186 [2025-01-08 22:54:27,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:27,407 INFO L225 Difference]: With dead ends: 3216 [2025-01-08 22:54:27,407 INFO L226 Difference]: Without dead ends: 1706 [2025-01-08 22:54:27,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:54:27,410 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 179 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:27,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 83 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:54:27,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2025-01-08 22:54:27,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1426. [2025-01-08 22:54:27,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1425 states have (on average 1.0743859649122807) internal successors, (1531), 1425 states have internal predecessors, (1531), 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-01-08 22:54:27,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 1531 transitions. [2025-01-08 22:54:27,436 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 1531 transitions. Word has length 186 [2025-01-08 22:54:27,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:27,437 INFO L471 AbstractCegarLoop]: Abstraction has 1426 states and 1531 transitions. [2025-01-08 22:54:27,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 4 states have internal predecessors, (179), 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-01-08 22:54:27,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 1531 transitions. [2025-01-08 22:54:27,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-08 22:54:27,441 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:27,441 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2025-01-08 22:54:27,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 22:54:27,442 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:27,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:27,443 INFO L85 PathProgramCache]: Analyzing trace with hash -899148328, now seen corresponding path program 1 times [2025-01-08 22:54:27,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:27,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529839841] [2025-01-08 22:54:27,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:27,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:27,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-08 22:54:27,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-08 22:54:27,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:27,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:27,538 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-08 22:54:27,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:27,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529839841] [2025-01-08 22:54:27,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529839841] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:27,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:27,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:54:27,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861871] [2025-01-08 22:54:27,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:27,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:27,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:27,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:27,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:27,541 INFO L87 Difference]: Start difference. First operand 1426 states and 1531 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:27,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:27,904 INFO L93 Difference]: Finished difference Result 3414 states and 3679 transitions. [2025-01-08 22:54:27,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:27,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 193 [2025-01-08 22:54:27,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:27,910 INFO L225 Difference]: With dead ends: 3414 [2025-01-08 22:54:27,911 INFO L226 Difference]: Without dead ends: 1850 [2025-01-08 22:54:27,913 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-01-08 22:54:27,913 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 138 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:27,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 219 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:54:27,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2025-01-08 22:54:27,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1566. [2025-01-08 22:54:27,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1565 states have (on average 1.0619808306709264) internal successors, (1662), 1565 states have internal predecessors, (1662), 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-01-08 22:54:27,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 1662 transitions. [2025-01-08 22:54:27,944 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 1662 transitions. Word has length 193 [2025-01-08 22:54:27,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:27,945 INFO L471 AbstractCegarLoop]: Abstraction has 1566 states and 1662 transitions. [2025-01-08 22:54:27,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:27,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 1662 transitions. [2025-01-08 22:54:27,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-08 22:54:27,948 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:27,949 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:27,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 22:54:27,949 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:27,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:27,950 INFO L85 PathProgramCache]: Analyzing trace with hash -278758439, now seen corresponding path program 1 times [2025-01-08 22:54:27,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:27,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999431674] [2025-01-08 22:54:27,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:27,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:27,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-08 22:54:27,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-08 22:54:27,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:27,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:28,093 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-08 22:54:28,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:28,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999431674] [2025-01-08 22:54:28,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999431674] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:28,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:28,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:54:28,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796306024] [2025-01-08 22:54:28,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:28,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:28,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:28,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:28,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:28,095 INFO L87 Difference]: Start difference. First operand 1566 states and 1662 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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-01-08 22:54:28,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:28,460 INFO L93 Difference]: Finished difference Result 3688 states and 3925 transitions. [2025-01-08 22:54:28,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:28,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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 205 [2025-01-08 22:54:28,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:28,461 INFO L225 Difference]: With dead ends: 3688 [2025-01-08 22:54:28,461 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 22:54:28,464 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-01-08 22:54:28,465 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 79 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:28,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 228 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:54:28,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 22:54:28,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 22:54:28,466 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-01-08 22:54:28,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 22:54:28,466 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 205 [2025-01-08 22:54:28,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:28,466 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 22:54:28,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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-01-08 22:54:28,467 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 22:54:28,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 22:54:28,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 22:54:28,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 22:54:28,472 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:28,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 22:54:28,653 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 22:54:28,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 10:54:28 BoogieIcfgContainer [2025-01-08 22:54:28,670 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 22:54:28,671 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 22:54:28,671 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 22:54:28,671 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 22:54:28,672 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:54:19" (3/4) ... [2025-01-08 22:54:28,674 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 22:54:28,695 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 22:54:28,696 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 22:54:28,696 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 22:54:28,698 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 22:54:28,824 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 22:54:28,825 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 22:54:28,825 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 22:54:28,828 INFO L158 Benchmark]: Toolchain (without parser) took 11178.62ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 113.1MB in the beginning and 172.6MB in the end (delta: -59.5MB). Peak memory consumption was 90.3MB. Max. memory is 16.1GB. [2025-01-08 22:54:28,828 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:54:28,828 INFO L158 Benchmark]: CACSL2BoogieTranslator took 514.08ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 87.5MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-08 22:54:28,828 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.09ms. Allocated memory is still 142.6MB. Free memory was 87.5MB in the beginning and 82.0MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:54:28,829 INFO L158 Benchmark]: Boogie Preprocessor took 114.30ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 77.2MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:54:28,829 INFO L158 Benchmark]: RCFGBuilder took 1073.47ms. Allocated memory is still 142.6MB. Free memory was 77.2MB in the beginning and 66.8MB in the end (delta: 10.4MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. [2025-01-08 22:54:28,829 INFO L158 Benchmark]: TraceAbstraction took 9259.89ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 66.8MB in the beginning and 184.2MB in the end (delta: -117.4MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. [2025-01-08 22:54:28,830 INFO L158 Benchmark]: Witness Printer took 154.13ms. Allocated memory is still 293.6MB. Free memory was 184.2MB in the beginning and 172.6MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:54:28,832 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.25ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 514.08ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 87.5MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.09ms. Allocated memory is still 142.6MB. Free memory was 87.5MB in the beginning and 82.0MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 114.30ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 77.2MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1073.47ms. Allocated memory is still 142.6MB. Free memory was 77.2MB in the beginning and 66.8MB in the end (delta: 10.4MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9259.89ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 66.8MB in the beginning and 184.2MB in the end (delta: -117.4MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. * Witness Printer took 154.13ms. Allocated memory is still 293.6MB. Free memory was 184.2MB in the beginning and 172.6MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 518]: 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, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1571 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1571 mSDsluCounter, 1797 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 239 mSDsCounter, 845 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5002 IncrementalHoareTripleChecker+Invalid, 5847 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 845 mSolverCounterUnsat, 1558 mSDtfsCounter, 5002 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1852occurred in iteration=5, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1548 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1645 NumberOfCodeBlocks, 1645 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1634 ConstructedInterpolants, 0 QuantifiedInterpolants, 6651 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 566/566 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: 616]: Loop Invariant Derived loop invariant: ((((((a19 == 0) || ((a19 == 1) && (a11 != 1))) || ((((10 <= a28) && (a17 <= 7)) && (a25 != 1)) && (a19 == 1))) || ((((a17 == 8) && (a25 == 1)) && (a21 == 1)) && (a19 == 1))) || ((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) || (((a25 == 1) && (a19 == 1)) && (a28 <= 7))) RESULT: Ultimate proved your program to be correct! [2025-01-08 22:54:28,851 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