./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4be4b344509b887bc91f2389f98de1e4ff745494aee0f078864fd49e79b0b4b8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 17:51:16,846 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 17:51:16,900 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 17:51:16,903 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 17:51:16,903 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 17:51:16,921 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 17:51:16,921 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 17:51:16,921 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 17:51:16,922 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 17:51:16,922 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 17:51:16,923 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 17:51:16,923 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 17:51:16,923 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 17:51:16,923 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 17:51:16,923 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 17:51:16,924 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 17:51:16,924 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 17:51:16,924 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 17:51:16,924 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 17:51:16,924 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 17:51:16,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 17:51:16,924 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 17:51:16,924 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 17:51:16,924 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 17:51:16,924 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 17:51:16,924 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 17:51:16,924 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 17:51:16,924 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 17:51:16,924 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 17:51:16,924 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 17:51:16,925 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 17:51:16,925 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 17:51:16,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:51:16,925 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 17:51:16,925 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 17:51:16,925 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 17:51:16,925 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 17:51:16,925 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 17:51:16,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 17:51:16,925 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 17:51:16,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 17:51:16,925 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 17:51:16,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 17:51:16,925 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4be4b344509b887bc91f2389f98de1e4ff745494aee0f078864fd49e79b0b4b8 [2025-03-16 17:51:17,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 17:51:17,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 17:51:17,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 17:51:17,134 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 17:51:17,134 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 17:51:17,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2025-03-16 17:51:18,231 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a323316bb/6c3b8f0f69bc4a329bb59013ca38822d/FLAGde3781837 [2025-03-16 17:51:18,443 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 17:51:18,443 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2025-03-16 17:51:18,449 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a323316bb/6c3b8f0f69bc4a329bb59013ca38822d/FLAGde3781837 [2025-03-16 17:51:18,464 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a323316bb/6c3b8f0f69bc4a329bb59013ca38822d [2025-03-16 17:51:18,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 17:51:18,467 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 17:51:18,468 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 17:51:18,468 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 17:51:18,471 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 17:51:18,472 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:51:18" (1/1) ... [2025-03-16 17:51:18,472 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16da5a3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:18, skipping insertion in model container [2025-03-16 17:51:18,472 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:51:18" (1/1) ... [2025-03-16 17:51:18,481 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 17:51:18,571 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/sendmail-close-angle.i[893,906] [2025-03-16 17:51:18,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:51:18,593 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 17:51:18,601 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/sendmail-close-angle.i[893,906] [2025-03-16 17:51:18,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:51:18,614 INFO L204 MainTranslator]: Completed translation [2025-03-16 17:51:18,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:18 WrapperNode [2025-03-16 17:51:18,615 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 17:51:18,616 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 17:51:18,616 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 17:51:18,616 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 17:51:18,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:18" (1/1) ... [2025-03-16 17:51:18,625 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:18" (1/1) ... [2025-03-16 17:51:18,634 INFO L138 Inliner]: procedures = 16, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 60 [2025-03-16 17:51:18,636 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 17:51:18,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 17:51:18,637 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 17:51:18,637 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 17:51:18,641 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:18" (1/1) ... [2025-03-16 17:51:18,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:18" (1/1) ... [2025-03-16 17:51:18,643 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:18" (1/1) ... [2025-03-16 17:51:18,652 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 17:51:18,652 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:18" (1/1) ... [2025-03-16 17:51:18,652 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:18" (1/1) ... [2025-03-16 17:51:18,654 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:18" (1/1) ... [2025-03-16 17:51:18,656 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:18" (1/1) ... [2025-03-16 17:51:18,656 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:18" (1/1) ... [2025-03-16 17:51:18,656 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:18" (1/1) ... [2025-03-16 17:51:18,657 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 17:51:18,661 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 17:51:18,661 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 17:51:18,661 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 17:51:18,662 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:18" (1/1) ... [2025-03-16 17:51:18,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:51:18,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:51:18,688 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 17:51:18,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 17:51:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 17:51:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 17:51:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 17:51:18,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 17:51:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-16 17:51:18,709 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-16 17:51:18,752 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 17:51:18,753 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 17:51:18,862 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-16 17:51:18,862 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 17:51:18,870 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 17:51:18,870 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 17:51:18,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:51:18 BoogieIcfgContainer [2025-03-16 17:51:18,870 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 17:51:18,874 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 17:51:18,874 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 17:51:18,877 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 17:51:18,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:51:18" (1/3) ... [2025-03-16 17:51:18,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439abaa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:51:18, skipping insertion in model container [2025-03-16 17:51:18,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:18" (2/3) ... [2025-03-16 17:51:18,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439abaa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:51:18, skipping insertion in model container [2025-03-16 17:51:18,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:51:18" (3/3) ... [2025-03-16 17:51:18,880 INFO L128 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2025-03-16 17:51:18,889 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 17:51:18,891 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sendmail-close-angle.i that has 2 procedures, 27 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 17:51:18,924 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 17:51:18,934 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;@c5b441e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 17:51:18,934 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 17:51:18,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 16 states have (on average 1.5) internal successors, (24), 18 states have internal predecessors, (24), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-16 17:51:18,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-16 17:51:18,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:51:18,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:51:18,940 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:51:18,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:51:18,943 INFO L85 PathProgramCache]: Analyzing trace with hash -789737845, now seen corresponding path program 1 times [2025-03-16 17:51:18,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:51:18,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184549369] [2025-03-16 17:51:18,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:51:18,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:51:18,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-16 17:51:19,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-16 17:51:19,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:51:19,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:19,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:51:19,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:51:19,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184549369] [2025-03-16 17:51:19,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184549369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:51:19,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:51:19,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 17:51:19,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612116794] [2025-03-16 17:51:19,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:51:19,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 17:51:19,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:51:19,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 17:51:19,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 17:51:19,056 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.5) internal successors, (24), 18 states have internal predecessors, (24), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:51:19,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:51:19,067 INFO L93 Difference]: Finished difference Result 50 states and 81 transitions. [2025-03-16 17:51:19,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 17:51:19,068 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-16 17:51:19,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:51:19,071 INFO L225 Difference]: With dead ends: 50 [2025-03-16 17:51:19,071 INFO L226 Difference]: Without dead ends: 23 [2025-03-16 17:51:19,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 17:51:19,074 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:51:19,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:51:19,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-16 17:51:19,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-16 17:51:19,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 15 states have internal predecessors, (16), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-16 17:51:19,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2025-03-16 17:51:19,094 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 9 [2025-03-16 17:51:19,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:51:19,095 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2025-03-16 17:51:19,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:51:19,095 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2025-03-16 17:51:19,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-16 17:51:19,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:51:19,095 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:51:19,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 17:51:19,096 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:51:19,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:51:19,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1233683155, now seen corresponding path program 1 times [2025-03-16 17:51:19,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:51:19,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977128997] [2025-03-16 17:51:19,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:51:19,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:51:19,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-16 17:51:19,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-16 17:51:19,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:51:19,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:51:19,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:51:19,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977128997] [2025-03-16 17:51:19,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977128997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:51:19,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:51:19,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 17:51:19,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056857155] [2025-03-16 17:51:19,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:51:19,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:51:19,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:51:19,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:51:19,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:51:19,230 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:51:19,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:51:19,282 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2025-03-16 17:51:19,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:51:19,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-16 17:51:19,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:51:19,284 INFO L225 Difference]: With dead ends: 29 [2025-03-16 17:51:19,284 INFO L226 Difference]: Without dead ends: 27 [2025-03-16 17:51:19,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:51:19,284 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:51:19,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 71 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:51:19,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-16 17:51:19,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-16 17:51:19,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-16 17:51:19,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2025-03-16 17:51:19,292 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2025-03-16 17:51:19,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:51:19,293 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2025-03-16 17:51:19,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:51:19,293 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2025-03-16 17:51:19,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-16 17:51:19,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:51:19,293 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:51:19,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 17:51:19,293 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:51:19,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:51:19,294 INFO L85 PathProgramCache]: Analyzing trace with hash -406840401, now seen corresponding path program 1 times [2025-03-16 17:51:19,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:51:19,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625718919] [2025-03-16 17:51:19,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:51:19,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:51:19,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 17:51:19,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 17:51:19,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:51:19,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:19,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:51:19,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:51:19,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625718919] [2025-03-16 17:51:19,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625718919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:51:19,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:51:19,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 17:51:19,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786563762] [2025-03-16 17:51:19,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:51:19,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 17:51:19,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:51:19,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 17:51:19,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:51:19,396 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:51:19,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:51:19,485 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2025-03-16 17:51:19,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:51:19,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-16 17:51:19,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:51:19,486 INFO L225 Difference]: With dead ends: 42 [2025-03-16 17:51:19,486 INFO L226 Difference]: Without dead ends: 40 [2025-03-16 17:51:19,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 17:51:19,486 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 21 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:51:19,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 94 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:51:19,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-16 17:51:19,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-03-16 17:51:19,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 25 states have internal predecessors, (27), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-16 17:51:19,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2025-03-16 17:51:19,493 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 15 [2025-03-16 17:51:19,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:51:19,493 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2025-03-16 17:51:19,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:51:19,493 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2025-03-16 17:51:19,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-16 17:51:19,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:51:19,493 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:51:19,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 17:51:19,493 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:51:19,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:51:19,494 INFO L85 PathProgramCache]: Analyzing trace with hash -929891474, now seen corresponding path program 1 times [2025-03-16 17:51:19,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:51:19,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206260776] [2025-03-16 17:51:19,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:51:19,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:51:19,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-16 17:51:19,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-16 17:51:19,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:51:19,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:19,591 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 17:51:19,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:51:19,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206260776] [2025-03-16 17:51:19,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206260776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:51:19,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:51:19,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 17:51:19,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054174855] [2025-03-16 17:51:19,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:51:19,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 17:51:19,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:51:19,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 17:51:19,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:51:19,593 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 17:51:19,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:51:19,653 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2025-03-16 17:51:19,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:51:19,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-16 17:51:19,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:51:19,654 INFO L225 Difference]: With dead ends: 48 [2025-03-16 17:51:19,654 INFO L226 Difference]: Without dead ends: 46 [2025-03-16 17:51:19,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:51:19,655 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 12 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:51:19,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 178 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:51:19,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-16 17:51:19,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2025-03-16 17:51:19,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 25 states have (on average 1.2) internal successors, (30), 28 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-16 17:51:19,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2025-03-16 17:51:19,662 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 22 [2025-03-16 17:51:19,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:51:19,662 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2025-03-16 17:51:19,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 17:51:19,663 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2025-03-16 17:51:19,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-16 17:51:19,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:51:19,663 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:51:19,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 17:51:19,664 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:51:19,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:51:19,664 INFO L85 PathProgramCache]: Analyzing trace with hash 462629659, now seen corresponding path program 1 times [2025-03-16 17:51:19,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:51:19,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351157361] [2025-03-16 17:51:19,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:51:19,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:51:19,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 17:51:19,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 17:51:19,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:51:19,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:19,762 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 17:51:19,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:51:19,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351157361] [2025-03-16 17:51:19,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351157361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:51:19,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:51:19,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 17:51:19,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174193516] [2025-03-16 17:51:19,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:51:19,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 17:51:19,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:51:19,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 17:51:19,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:51:19,763 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 17:51:19,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:51:19,862 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2025-03-16 17:51:19,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 17:51:19,863 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2025-03-16 17:51:19,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:51:19,863 INFO L225 Difference]: With dead ends: 67 [2025-03-16 17:51:19,863 INFO L226 Difference]: Without dead ends: 60 [2025-03-16 17:51:19,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 17:51:19,864 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:51:19,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 93 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:51:19,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-16 17:51:19,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2025-03-16 17:51:19,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 38 states have internal predecessors, (40), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-16 17:51:19,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2025-03-16 17:51:19,872 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 26 [2025-03-16 17:51:19,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:51:19,872 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2025-03-16 17:51:19,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 17:51:19,872 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2025-03-16 17:51:19,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-16 17:51:19,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:51:19,873 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:51:19,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 17:51:19,873 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:51:19,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:51:19,873 INFO L85 PathProgramCache]: Analyzing trace with hash 221903732, now seen corresponding path program 1 times [2025-03-16 17:51:19,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:51:19,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862414972] [2025-03-16 17:51:19,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:51:19,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:51:19,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 17:51:19,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 17:51:19,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:51:19,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:19,960 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 17:51:19,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:51:19,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862414972] [2025-03-16 17:51:19,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862414972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:51:19,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:51:19,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 17:51:19,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668860408] [2025-03-16 17:51:19,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:51:19,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 17:51:19,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:51:19,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 17:51:19,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:51:19,961 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 17:51:20,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:51:20,023 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2025-03-16 17:51:20,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 17:51:20,023 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2025-03-16 17:51:20,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:51:20,024 INFO L225 Difference]: With dead ends: 68 [2025-03-16 17:51:20,024 INFO L226 Difference]: Without dead ends: 66 [2025-03-16 17:51:20,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-16 17:51:20,025 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 28 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:51:20,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 122 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:51:20,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-16 17:51:20,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2025-03-16 17:51:20,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.131578947368421) internal successors, (43), 41 states have internal predecessors, (43), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-16 17:51:20,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2025-03-16 17:51:20,032 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 27 [2025-03-16 17:51:20,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:51:20,032 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2025-03-16 17:51:20,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 17:51:20,032 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2025-03-16 17:51:20,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 17:51:20,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:51:20,033 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:51:20,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 17:51:20,033 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:51:20,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:51:20,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1588819061, now seen corresponding path program 1 times [2025-03-16 17:51:20,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:51:20,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815634336] [2025-03-16 17:51:20,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:51:20,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:51:20,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 17:51:20,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 17:51:20,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:51:20,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:20,208 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 17:51:20,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:51:20,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815634336] [2025-03-16 17:51:20,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815634336] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:51:20,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099268337] [2025-03-16 17:51:20,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:51:20,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:51:20,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:51:20,211 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:51:20,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 17:51:20,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 17:51:20,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 17:51:20,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:51:20,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:20,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-16 17:51:20,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:51:20,452 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-16 17:51:20,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:51:20,603 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-16 17:51:20,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099268337] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:51:20,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:51:20,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 19 [2025-03-16 17:51:20,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719071608] [2025-03-16 17:51:20,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:51:20,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-16 17:51:20,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:51:20,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-16 17:51:20,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-03-16 17:51:20,604 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand has 19 states, 16 states have (on average 2.3125) internal successors, (37), 17 states have internal predecessors, (37), 7 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2025-03-16 17:51:20,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:51:20,856 INFO L93 Difference]: Finished difference Result 97 states and 128 transitions. [2025-03-16 17:51:20,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 17:51:20,856 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 2.3125) internal successors, (37), 17 states have internal predecessors, (37), 7 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) Word has length 50 [2025-03-16 17:51:20,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:51:20,858 INFO L225 Difference]: With dead ends: 97 [2025-03-16 17:51:20,858 INFO L226 Difference]: Without dead ends: 82 [2025-03-16 17:51:20,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 85 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2025-03-16 17:51:20,859 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 50 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 17:51:20,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 151 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 17:51:20,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-16 17:51:20,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-16 17:51:20,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 52 states have internal predecessors, (54), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-16 17:51:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2025-03-16 17:51:20,877 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 50 [2025-03-16 17:51:20,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:51:20,877 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2025-03-16 17:51:20,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 2.3125) internal successors, (37), 17 states have internal predecessors, (37), 7 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2025-03-16 17:51:20,877 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2025-03-16 17:51:20,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 17:51:20,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:51:20,878 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:51:20,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 17:51:21,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:51:21,083 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:51:21,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:51:21,084 INFO L85 PathProgramCache]: Analyzing trace with hash 774036826, now seen corresponding path program 1 times [2025-03-16 17:51:21,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:51:21,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749904617] [2025-03-16 17:51:21,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:51:21,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:51:21,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 17:51:21,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 17:51:21,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:51:21,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:21,199 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 17:51:21,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:51:21,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749904617] [2025-03-16 17:51:21,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749904617] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:51:21,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731313733] [2025-03-16 17:51:21,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:51:21,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:51:21,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:51:21,202 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:51:21,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 17:51:21,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 17:51:21,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 17:51:21,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:51:21,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:21,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-16 17:51:21,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:51:21,340 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 17:51:21,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:51:21,433 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 17:51:21,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731313733] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:51:21,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:51:21,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-16 17:51:21,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419716736] [2025-03-16 17:51:21,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:51:21,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 17:51:21,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:51:21,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 17:51:21,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-16 17:51:21,434 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2025-03-16 17:51:21,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:51:21,510 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2025-03-16 17:51:21,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 17:51:21,511 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 51 [2025-03-16 17:51:21,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:51:21,512 INFO L225 Difference]: With dead ends: 88 [2025-03-16 17:51:21,512 INFO L226 Difference]: Without dead ends: 86 [2025-03-16 17:51:21,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 90 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-03-16 17:51:21,513 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 29 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:51:21,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 171 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:51:21,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-16 17:51:21,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-16 17:51:21,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 55 states have internal predecessors, (57), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-16 17:51:21,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 104 transitions. [2025-03-16 17:51:21,529 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 104 transitions. Word has length 51 [2025-03-16 17:51:21,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:51:21,529 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 104 transitions. [2025-03-16 17:51:21,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2025-03-16 17:51:21,529 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2025-03-16 17:51:21,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 17:51:21,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:51:21,530 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2025-03-16 17:51:21,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 17:51:21,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-16 17:51:21,731 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:51:21,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:51:21,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1310584128, now seen corresponding path program 2 times [2025-03-16 17:51:21,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:51:21,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6363012] [2025-03-16 17:51:21,732 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:51:21,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:51:21,737 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-16 17:51:21,747 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 17:51:21,748 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:51:21,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:21,900 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 48 proven. 21 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2025-03-16 17:51:21,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:51:21,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6363012] [2025-03-16 17:51:21,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6363012] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:51:21,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127608428] [2025-03-16 17:51:21,901 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:51:21,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:51:21,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:51:21,903 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:51:21,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 17:51:21,928 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-16 17:51:21,943 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 17:51:21,943 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:51:21,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:21,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-16 17:51:21,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:51:22,139 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 22 proven. 24 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-16 17:51:22,139 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:51:22,272 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 22 proven. 24 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-16 17:51:22,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127608428] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:51:22,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:51:22,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2025-03-16 17:51:22,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251977774] [2025-03-16 17:51:22,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:51:22,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-16 17:51:22,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:51:22,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-16 17:51:22,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2025-03-16 17:51:22,275 INFO L87 Difference]: Start difference. First operand 86 states and 104 transitions. Second operand has 20 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 10 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) [2025-03-16 17:51:22,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:51:22,551 INFO L93 Difference]: Finished difference Result 96 states and 114 transitions. [2025-03-16 17:51:22,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 17:51:22,552 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 10 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) Word has length 75 [2025-03-16 17:51:22,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:51:22,552 INFO L225 Difference]: With dead ends: 96 [2025-03-16 17:51:22,552 INFO L226 Difference]: Without dead ends: 94 [2025-03-16 17:51:22,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 138 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2025-03-16 17:51:22,553 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 48 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:51:22,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 197 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:51:22,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-16 17:51:22,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2025-03-16 17:51:22,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 58 states have internal predecessors, (60), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-16 17:51:22,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 107 transitions. [2025-03-16 17:51:22,563 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 107 transitions. Word has length 75 [2025-03-16 17:51:22,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:51:22,563 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 107 transitions. [2025-03-16 17:51:22,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 10 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) [2025-03-16 17:51:22,563 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2025-03-16 17:51:22,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 17:51:22,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:51:22,564 INFO L218 NwaCegarLoop]: trace histogram [16, 15, 15, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:51:22,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 17:51:22,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:51:22,765 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:51:22,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:51:22,765 INFO L85 PathProgramCache]: Analyzing trace with hash 388906281, now seen corresponding path program 2 times [2025-03-16 17:51:22,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:51:22,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399120238] [2025-03-16 17:51:22,765 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:51:22,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:51:22,770 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 98 statements into 2 equivalence classes. [2025-03-16 17:51:22,778 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 17:51:22,778 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:51:22,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:22,966 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 68 proven. 28 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2025-03-16 17:51:22,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:51:22,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399120238] [2025-03-16 17:51:22,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399120238] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:51:22,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700524685] [2025-03-16 17:51:22,967 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:51:22,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:51:22,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:51:22,968 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:51:22,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 17:51:22,996 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 98 statements into 2 equivalence classes. [2025-03-16 17:51:23,017 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 17:51:23,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:51:23,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:23,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 17:51:23,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:51:23,120 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 64 proven. 67 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2025-03-16 17:51:23,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:51:23,263 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 71 proven. 60 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2025-03-16 17:51:23,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700524685] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:51:23,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:51:23,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 16 [2025-03-16 17:51:23,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882914692] [2025-03-16 17:51:23,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:51:23,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-16 17:51:23,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:51:23,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-16 17:51:23,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-03-16 17:51:23,264 INFO L87 Difference]: Start difference. First operand 90 states and 107 transitions. Second operand has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 7 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2025-03-16 17:51:23,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:51:23,476 INFO L93 Difference]: Finished difference Result 101 states and 122 transitions. [2025-03-16 17:51:23,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 17:51:23,476 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 7 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) Word has length 98 [2025-03-16 17:51:23,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:51:23,477 INFO L225 Difference]: With dead ends: 101 [2025-03-16 17:51:23,477 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 17:51:23,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 189 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2025-03-16 17:51:23,478 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 17 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:51:23,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 250 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:51:23,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 17:51:23,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 17:51:23,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:51:23,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 17:51:23,478 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2025-03-16 17:51:23,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:51:23,478 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 17:51:23,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 7 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2025-03-16 17:51:23,478 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 17:51:23,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 17:51:23,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 17:51:23,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 17:51:23,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:51:23,687 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-16 17:51:23,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 17:51:24,174 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 17:51:24,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 05:51:24 BoogieIcfgContainer [2025-03-16 17:51:24,183 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 17:51:24,183 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 17:51:24,183 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 17:51:24,183 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 17:51:24,185 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:51:18" (3/4) ... [2025-03-16 17:51:24,186 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 17:51:24,190 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-16 17:51:24,193 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-16 17:51:24,193 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 17:51:24,194 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 17:51:24,194 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 17:51:24,245 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 17:51:24,245 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 17:51:24,245 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 17:51:24,246 INFO L158 Benchmark]: Toolchain (without parser) took 5778.37ms. Allocated memory is still 167.8MB. Free memory was 133.4MB in the beginning and 68.5MB in the end (delta: 65.0MB). Peak memory consumption was 64.1MB. Max. memory is 16.1GB. [2025-03-16 17:51:24,246 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:51:24,246 INFO L158 Benchmark]: CACSL2BoogieTranslator took 147.21ms. Allocated memory is still 167.8MB. Free memory was 133.0MB in the beginning and 122.0MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 17:51:24,246 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.68ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 120.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:51:24,246 INFO L158 Benchmark]: Boogie Preprocessor took 20.95ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 119.8MB in the end (delta: 902.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:51:24,246 INFO L158 Benchmark]: IcfgBuilder took 209.34ms. Allocated memory is still 167.8MB. Free memory was 119.8MB in the beginning and 107.7MB in the end (delta: 12.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 17:51:24,246 INFO L158 Benchmark]: TraceAbstraction took 5308.95ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 74.9MB in the end (delta: 32.4MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. [2025-03-16 17:51:24,247 INFO L158 Benchmark]: Witness Printer took 62.00ms. Allocated memory is still 167.8MB. Free memory was 74.9MB in the beginning and 68.5MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 17:51:24,247 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 147.21ms. Allocated memory is still 167.8MB. Free memory was 133.0MB in the beginning and 122.0MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.68ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 120.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.95ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 119.8MB in the end (delta: 902.6kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 209.34ms. Allocated memory is still 167.8MB. Free memory was 119.8MB in the beginning and 107.7MB in the end (delta: 12.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5308.95ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 74.9MB in the end (delta: 32.4MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. * Witness Printer took 62.00ms. Allocated memory is still 167.8MB. Free memory was 74.9MB in the beginning and 68.5MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: 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 2 procedures, 27 locations, 48 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 10, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 293 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 238 mSDsluCounter, 1365 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1090 mSDsCounter, 202 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1050 IncrementalHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 202 mSolverCounterUnsat, 275 mSDtfsCounter, 1050 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 649 GetRequests, 514 SyntacticMatches, 17 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=9, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 16 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 657 NumberOfCodeBlocks, 657 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 913 ConstructedInterpolants, 0 QuantifiedInterpolants, 2752 SizeOfPredicates, 14 NumberOfNonLiveVariables, 618 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 2610/2902 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: 37]: Location Invariant Derived location invariant: (((((((((long long) bufferlen + in) + 1) <= ((long long) buf + inlen)) && (bufferlen == ((long long) 2 + buflim))) && (1 <= in)) && (((long long) buf + 2) <= bufferlen)) && (0 <= buf)) || (((((buf == 0) && (bufferlen == ((long long) 2 + buflim))) && (0 <= buflim)) && (((long long) 3 + buflim) <= inlen)) && (in == 0))) RESULT: Ultimate proved your program to be correct! [2025-03-16 17:51:24,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE