./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/nla-digbench-scaling/hard-ll_valuebound2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9851f41ad4fb2d0ff96507e8e48f0d2886a8de6481eed845b23377b9fa492b45 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:09:49,261 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:09:49,317 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:09:49,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:09:49,322 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:09:49,342 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:09:49,343 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:09:49,343 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:09:49,344 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:09:49,344 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:09:49,344 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:09:49,345 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:09:49,345 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:09:49,345 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:09:49,345 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:09:49,345 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:09:49,345 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:09:49,346 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:09:49,346 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:09:49,346 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:09:49,346 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:09:49,346 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:09:49,346 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:09:49,346 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:09:49,346 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:09:49,346 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:09:49,346 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:09:49,346 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:09:49,347 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:09:49,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:09:49,347 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:09:49,347 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:09:49,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:09:49,347 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:09:49,347 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:09:49,347 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:09:49,348 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:09:49,348 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:09:49,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:09:49,348 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:09:49,348 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:09:49,348 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:09:49,348 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:09:49,348 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 -> 9851f41ad4fb2d0ff96507e8e48f0d2886a8de6481eed845b23377b9fa492b45 [2025-03-08 05:09:49,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:09:49,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:09:49,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:09:49,576 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:09:49,576 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:09:49,577 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound2.c [2025-03-08 05:09:50,699 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9907edebf/b67d821e6b1743a589167065ef639063/FLAG8e523e0a0 [2025-03-08 05:09:50,906 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:09:50,907 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound2.c [2025-03-08 05:09:50,915 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9907edebf/b67d821e6b1743a589167065ef639063/FLAG8e523e0a0 [2025-03-08 05:09:51,260 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9907edebf/b67d821e6b1743a589167065ef639063 [2025-03-08 05:09:51,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:09:51,263 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:09:51,263 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:09:51,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:09:51,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:09:51,267 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:09:51" (1/1) ... [2025-03-08 05:09:51,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26eea268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:09:51, skipping insertion in model container [2025-03-08 05:09:51,268 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:09:51" (1/1) ... [2025-03-08 05:09:51,277 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:09:51,357 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/nla-digbench-scaling/hard-ll_valuebound2.c[538,551] [2025-03-08 05:09:51,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:09:51,378 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:09:51,385 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/nla-digbench-scaling/hard-ll_valuebound2.c[538,551] [2025-03-08 05:09:51,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:09:51,400 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:09:51,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:09:51 WrapperNode [2025-03-08 05:09:51,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:09:51,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:09:51,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:09:51,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:09:51,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:09:51" (1/1) ... [2025-03-08 05:09:51,410 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:09:51" (1/1) ... [2025-03-08 05:09:51,420 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 50 [2025-03-08 05:09:51,420 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:09:51,421 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:09:51,421 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:09:51,421 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:09:51,426 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:09:51" (1/1) ... [2025-03-08 05:09:51,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:09:51" (1/1) ... [2025-03-08 05:09:51,427 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:09:51" (1/1) ... [2025-03-08 05:09:51,433 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-08 05:09:51,433 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:09:51" (1/1) ... [2025-03-08 05:09:51,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:09:51" (1/1) ... [2025-03-08 05:09:51,435 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:09:51" (1/1) ... [2025-03-08 05:09:51,435 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:09:51" (1/1) ... [2025-03-08 05:09:51,436 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:09:51" (1/1) ... [2025-03-08 05:09:51,436 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:09:51" (1/1) ... [2025-03-08 05:09:51,437 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:09:51,438 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:09:51,438 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:09:51,438 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:09:51,439 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:09:51" (1/1) ... [2025-03-08 05:09:51,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:09:51,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:09:51,460 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-08 05:09:51,464 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-08 05:09:51,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:09:51,477 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 05:09:51,477 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 05:09:51,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:09:51,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:09:51,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:09:51,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 05:09:51,477 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 05:09:51,516 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:09:51,518 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:09:51,632 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-08 05:09:51,632 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:09:51,639 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:09:51,640 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:09:51,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:09:51 BoogieIcfgContainer [2025-03-08 05:09:51,640 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:09:51,642 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:09:51,642 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:09:51,645 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:09:51,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:09:51" (1/3) ... [2025-03-08 05:09:51,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e601ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:09:51, skipping insertion in model container [2025-03-08 05:09:51,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:09:51" (2/3) ... [2025-03-08 05:09:51,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e601ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:09:51, skipping insertion in model container [2025-03-08 05:09:51,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:09:51" (3/3) ... [2025-03-08 05:09:51,647 INFO L128 eAbstractionObserver]: Analyzing ICFG hard-ll_valuebound2.c [2025-03-08 05:09:51,656 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:09:51,657 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hard-ll_valuebound2.c that has 3 procedures, 31 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 05:09:51,697 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:09:51,706 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;@c312611, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:09:51,707 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:09:51,709 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 05:09:51,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 05:09:51,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:09:51,714 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:09:51,714 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:09:51,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:09:51,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1866426684, now seen corresponding path program 1 times [2025-03-08 05:09:51,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:09:51,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441945512] [2025-03-08 05:09:51,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:51,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:09:51,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 05:09:51,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 05:09:51,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:51,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:51,835 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 05:09:51,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:09:51,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441945512] [2025-03-08 05:09:51,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441945512] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:09:51,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427210709] [2025-03-08 05:09:51,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:51,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:09:51,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:09:51,840 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-08 05:09:51,842 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-08 05:09:51,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 05:09:51,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 05:09:51,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:51,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:51,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 05:09:51,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:09:51,906 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 05:09:51,907 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:09:51,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427210709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:09:51,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:09:51,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 05:09:51,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158124207] [2025-03-08 05:09:51,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:09:51,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 05:09:51,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:09:51,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 05:09:51,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 05:09:51,928 INFO L87 Difference]: Start difference. First operand has 31 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:09:51,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:09:51,945 INFO L93 Difference]: Finished difference Result 59 states and 96 transitions. [2025-03-08 05:09:51,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 05:09:51,948 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2025-03-08 05:09:51,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:09:51,953 INFO L225 Difference]: With dead ends: 59 [2025-03-08 05:09:51,953 INFO L226 Difference]: Without dead ends: 27 [2025-03-08 05:09:51,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 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-08 05:09:51,958 INFO L435 NwaCegarLoop]: 41 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, 41 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-08 05:09:51,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:09:51,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-08 05:09:51,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-08 05:09:51,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 05:09:51,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2025-03-08 05:09:51,988 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 23 [2025-03-08 05:09:51,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:09:51,988 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2025-03-08 05:09:51,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:09:51,988 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2025-03-08 05:09:51,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 05:09:51,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:09:51,989 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:09:51,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:09:52,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 05:09:52,194 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:09:52,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:09:52,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1261491227, now seen corresponding path program 1 times [2025-03-08 05:09:52,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:09:52,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321203407] [2025-03-08 05:09:52,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:52,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:09:52,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 05:09:52,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 05:09:52,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:52,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:52,394 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:09:52,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:09:52,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321203407] [2025-03-08 05:09:52,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321203407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:09:52,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:09:52,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:09:52,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706977026] [2025-03-08 05:09:52,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:09:52,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:09:52,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:09:52,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:09:52,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:09:52,396 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 05:09:52,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:09:52,448 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2025-03-08 05:09:52,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:09:52,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2025-03-08 05:09:52,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:09:52,450 INFO L225 Difference]: With dead ends: 39 [2025-03-08 05:09:52,450 INFO L226 Difference]: Without dead ends: 37 [2025-03-08 05:09:52,450 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-08 05:09:52,450 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:09:52,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 119 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:09:52,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-08 05:09:52,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2025-03-08 05:09:52,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 05:09:52,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2025-03-08 05:09:52,460 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 23 [2025-03-08 05:09:52,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:09:52,460 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2025-03-08 05:09:52,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 05:09:52,461 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2025-03-08 05:09:52,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 05:09:52,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:09:52,461 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:09:52,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:09:52,462 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:09:52,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:09:52,463 INFO L85 PathProgramCache]: Analyzing trace with hash 443892832, now seen corresponding path program 1 times [2025-03-08 05:09:52,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:09:52,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091626853] [2025-03-08 05:09:52,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:52,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:09:52,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 05:09:52,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 05:09:52,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:52,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:52,590 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:09:52,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:09:52,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091626853] [2025-03-08 05:09:52,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091626853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:09:52,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:09:52,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:09:52,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165830078] [2025-03-08 05:09:52,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:09:52,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:09:52,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:09:52,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:09:52,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:09:52,592 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 05:09:52,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:09:52,651 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2025-03-08 05:09:52,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:09:52,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2025-03-08 05:09:52,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:09:52,655 INFO L225 Difference]: With dead ends: 43 [2025-03-08 05:09:52,655 INFO L226 Difference]: Without dead ends: 41 [2025-03-08 05:09:52,655 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-08 05:09:52,656 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:09:52,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 116 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:09:52,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-08 05:09:52,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2025-03-08 05:09:52,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 05:09:52,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2025-03-08 05:09:52,662 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 28 [2025-03-08 05:09:52,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:09:52,664 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2025-03-08 05:09:52,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 05:09:52,665 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2025-03-08 05:09:52,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 05:09:52,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:09:52,666 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:09:52,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:09:52,667 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:09:52,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:09:52,667 INFO L85 PathProgramCache]: Analyzing trace with hash 312813829, now seen corresponding path program 1 times [2025-03-08 05:09:52,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:09:52,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106847518] [2025-03-08 05:09:52,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:52,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:09:52,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 05:09:52,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 05:09:52,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:52,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:09:52,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1134318451] [2025-03-08 05:09:52,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:52,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:09:52,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:09:52,693 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-08 05:09:52,694 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-08 05:09:52,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 05:09:52,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 05:09:52,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:52,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:52,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 05:09:52,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:09:52,805 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 05:09:52,805 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:09:52,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:09:52,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106847518] [2025-03-08 05:09:52,806 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:09:52,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134318451] [2025-03-08 05:09:52,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134318451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:09:52,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:09:52,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:09:52,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632242101] [2025-03-08 05:09:52,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:09:52,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:09:52,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:09:52,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:09:52,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:09:52,807 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:09:52,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:09:52,854 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2025-03-08 05:09:52,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:09:52,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2025-03-08 05:09:52,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:09:52,857 INFO L225 Difference]: With dead ends: 58 [2025-03-08 05:09:52,857 INFO L226 Difference]: Without dead ends: 46 [2025-03-08 05:09:52,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 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-08 05:09:52,857 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:09:52,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 116 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:09:52,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-08 05:09:52,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-08 05:09:52,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 05:09:52,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2025-03-08 05:09:52,868 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 59 transitions. Word has length 33 [2025-03-08 05:09:52,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:09:52,868 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 59 transitions. [2025-03-08 05:09:52,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:09:52,869 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2025-03-08 05:09:52,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 05:09:52,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:09:52,870 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:09:52,876 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-08 05:09:53,070 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,SelfDestructingSolverStorable3 [2025-03-08 05:09:53,071 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:09:53,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:09:53,071 INFO L85 PathProgramCache]: Analyzing trace with hash 987889245, now seen corresponding path program 1 times [2025-03-08 05:09:53,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:09:53,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174807372] [2025-03-08 05:09:53,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:53,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:09:53,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 05:09:53,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 05:09:53,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:53,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:09:53,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [76203297] [2025-03-08 05:09:53,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:53,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:09:53,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:09:53,085 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-08 05:09:53,087 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-08 05:09:53,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 05:09:53,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 05:09:53,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:53,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:53,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 05:09:53,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:09:53,179 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:09:53,179 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:09:53,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:09:53,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174807372] [2025-03-08 05:09:53,179 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:09:53,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76203297] [2025-03-08 05:09:53,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76203297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:09:53,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:09:53,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:09:53,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279187929] [2025-03-08 05:09:53,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:09:53,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:09:53,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:09:53,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:09:53,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:09:53,181 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:09:53,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:09:53,225 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2025-03-08 05:09:53,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:09:53,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2025-03-08 05:09:53,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:09:53,227 INFO L225 Difference]: With dead ends: 58 [2025-03-08 05:09:53,227 INFO L226 Difference]: Without dead ends: 56 [2025-03-08 05:09:53,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 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-08 05:09:53,227 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:09:53,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 100 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:09:53,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-08 05:09:53,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2025-03-08 05:09:53,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 05:09:53,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2025-03-08 05:09:53,241 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 39 [2025-03-08 05:09:53,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:09:53,242 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2025-03-08 05:09:53,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:09:53,242 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2025-03-08 05:09:53,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 05:09:53,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:09:53,242 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:09:53,249 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-08 05:09:53,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:09:53,447 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:09:53,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:09:53,447 INFO L85 PathProgramCache]: Analyzing trace with hash 251057081, now seen corresponding path program 1 times [2025-03-08 05:09:53,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:09:53,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192768380] [2025-03-08 05:09:53,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:53,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:09:53,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 05:09:53,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 05:09:53,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:53,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:09:53,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2000750009] [2025-03-08 05:09:53,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:53,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:09:53,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:09:53,462 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-08 05:09:53,463 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-08 05:09:53,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 05:09:53,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 05:09:53,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:53,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:53,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 05:09:53,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:09:53,578 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 05:09:53,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:09:53,664 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 05:09:53,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:09:53,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192768380] [2025-03-08 05:09:53,665 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:09:53,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000750009] [2025-03-08 05:09:53,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000750009] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 05:09:53,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:09:53,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2025-03-08 05:09:53,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068583127] [2025-03-08 05:09:53,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:09:53,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:09:53,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:09:53,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:09:53,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:09:53,665 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:09:53,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:09:53,720 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2025-03-08 05:09:53,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:09:53,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2025-03-08 05:09:53,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:09:53,723 INFO L225 Difference]: With dead ends: 64 [2025-03-08 05:09:53,724 INFO L226 Difference]: Without dead ends: 62 [2025-03-08 05:09:53,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:09:53,725 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 4 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:09:53,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 110 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:09:53,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-08 05:09:53,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2025-03-08 05:09:53,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 36 states have internal predecessors, (40), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 05:09:53,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 79 transitions. [2025-03-08 05:09:53,754 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 79 transitions. Word has length 49 [2025-03-08 05:09:53,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:09:53,754 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 79 transitions. [2025-03-08 05:09:53,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:09:53,755 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 79 transitions. [2025-03-08 05:09:53,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 05:09:53,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:09:53,757 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 1, 1, 1, 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-08 05:09:53,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 05:09:53,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:09:53,958 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:09:53,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:09:53,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1226234172, now seen corresponding path program 1 times [2025-03-08 05:09:53,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:09:53,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760047242] [2025-03-08 05:09:53,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:53,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:09:53,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 05:09:53,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 05:09:53,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:53,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:54,071 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-08 05:09:54,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:09:54,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760047242] [2025-03-08 05:09:54,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760047242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:09:54,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:09:54,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:09:54,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182225954] [2025-03-08 05:09:54,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:09:54,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:09:54,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:09:54,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:09:54,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:09:54,075 INFO L87 Difference]: Start difference. First operand 61 states and 79 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:09:54,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:09:54,121 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2025-03-08 05:09:54,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:09:54,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 55 [2025-03-08 05:09:54,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:09:54,122 INFO L225 Difference]: With dead ends: 69 [2025-03-08 05:09:54,122 INFO L226 Difference]: Without dead ends: 58 [2025-03-08 05:09:54,122 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-08 05:09:54,123 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:09:54,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 126 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:09:54,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-08 05:09:54,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-08 05:09:54,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 32 states have (on average 1.1875) internal successors, (38), 35 states have internal predecessors, (38), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 05:09:54,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 73 transitions. [2025-03-08 05:09:54,130 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 73 transitions. Word has length 55 [2025-03-08 05:09:54,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:09:54,130 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 73 transitions. [2025-03-08 05:09:54,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:09:54,131 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 73 transitions. [2025-03-08 05:09:54,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 05:09:54,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:09:54,131 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:09:54,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:09:54,132 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:09:54,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:09:54,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1056327704, now seen corresponding path program 1 times [2025-03-08 05:09:54,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:09:54,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958703063] [2025-03-08 05:09:54,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:54,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:09:54,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 05:09:54,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 05:09:54,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:54,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:09:54,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [106088743] [2025-03-08 05:09:54,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:54,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:09:54,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:09:54,155 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:09:54,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 05:09:54,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 05:09:54,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 05:09:54,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:54,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:54,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 05:09:54,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:09:54,620 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-08 05:09:54,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:09:55,987 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-08 05:09:55,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:09:55,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958703063] [2025-03-08 05:09:55,987 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:09:55,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106088743] [2025-03-08 05:09:55,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106088743] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:09:55,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:09:55,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2025-03-08 05:09:55,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851154531] [2025-03-08 05:09:55,988 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 05:09:55,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 05:09:55,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:09:55,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 05:09:55,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2025-03-08 05:09:55,989 INFO L87 Difference]: Start difference. First operand 58 states and 73 transitions. Second operand has 19 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 states have internal predecessors, (27), 9 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 8 states have call predecessors, (20), 7 states have call successors, (20) [2025-03-08 05:09:57,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:09:57,875 INFO L93 Difference]: Finished difference Result 134 states and 191 transitions. [2025-03-08 05:09:57,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 05:09:57,875 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 states have internal predecessors, (27), 9 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 8 states have call predecessors, (20), 7 states have call successors, (20) Word has length 67 [2025-03-08 05:09:57,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:09:57,877 INFO L225 Difference]: With dead ends: 134 [2025-03-08 05:09:57,877 INFO L226 Difference]: Without dead ends: 113 [2025-03-08 05:09:57,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2025-03-08 05:09:57,878 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 54 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:09:57,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 238 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 05:09:57,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-08 05:09:57,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 92. [2025-03-08 05:09:57,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 55 states have internal predecessors, (62), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 05:09:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 119 transitions. [2025-03-08 05:09:57,900 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 119 transitions. Word has length 67 [2025-03-08 05:09:57,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:09:57,900 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 119 transitions. [2025-03-08 05:09:57,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 states have internal predecessors, (27), 9 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 8 states have call predecessors, (20), 7 states have call successors, (20) [2025-03-08 05:09:57,901 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 119 transitions. [2025-03-08 05:09:57,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 05:09:57,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:09:57,901 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:09:57,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 05:09:58,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:09:58,102 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:09:58,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:09:58,103 INFO L85 PathProgramCache]: Analyzing trace with hash 663166422, now seen corresponding path program 1 times [2025-03-08 05:09:58,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:09:58,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482003408] [2025-03-08 05:09:58,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:58,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:09:58,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 05:09:58,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 05:09:58,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:58,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:09:58,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [575084149] [2025-03-08 05:09:58,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:58,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:09:58,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:09:58,126 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:09:58,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 05:09:58,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 05:09:58,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 05:09:58,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:58,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:58,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 05:09:58,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:09:58,512 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-08 05:09:58,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:09:58,936 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-03-08 05:09:58,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:09:58,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482003408] [2025-03-08 05:09:58,937 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:09:58,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575084149] [2025-03-08 05:09:58,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575084149] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:09:58,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:09:58,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2025-03-08 05:09:58,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956108703] [2025-03-08 05:09:58,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 05:09:58,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 05:09:58,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:09:58,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 05:09:58,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2025-03-08 05:09:58,939 INFO L87 Difference]: Start difference. First operand 92 states and 119 transitions. Second operand has 20 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 17 states have internal predecessors, (29), 11 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 10 states have call predecessors, (24), 9 states have call successors, (24) [2025-03-08 05:09:59,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:09:59,310 INFO L93 Difference]: Finished difference Result 130 states and 165 transitions. [2025-03-08 05:09:59,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 05:09:59,310 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 17 states have internal predecessors, (29), 11 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 10 states have call predecessors, (24), 9 states have call successors, (24) Word has length 78 [2025-03-08 05:09:59,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:09:59,311 INFO L225 Difference]: With dead ends: 130 [2025-03-08 05:09:59,311 INFO L226 Difference]: Without dead ends: 99 [2025-03-08 05:09:59,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2025-03-08 05:09:59,312 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 22 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:09:59,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 290 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:09:59,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-08 05:09:59,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 86. [2025-03-08 05:09:59,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 49 states have (on average 1.183673469387755) internal successors, (58), 51 states have internal predecessors, (58), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 05:09:59,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions. [2025-03-08 05:09:59,327 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 107 transitions. Word has length 78 [2025-03-08 05:09:59,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:09:59,327 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 107 transitions. [2025-03-08 05:09:59,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 17 states have internal predecessors, (29), 11 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 10 states have call predecessors, (24), 9 states have call successors, (24) [2025-03-08 05:09:59,327 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2025-03-08 05:09:59,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 05:09:59,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:09:59,328 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:09:59,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 05:09:59,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:09:59,532 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:09:59,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:09:59,532 INFO L85 PathProgramCache]: Analyzing trace with hash -893349057, now seen corresponding path program 2 times [2025-03-08 05:09:59,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:09:59,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489507684] [2025-03-08 05:09:59,533 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:09:59,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:09:59,537 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 79 statements into 2 equivalence classes. [2025-03-08 05:09:59,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 05:09:59,545 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:09:59,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:59,682 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-03-08 05:09:59,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:09:59,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489507684] [2025-03-08 05:09:59,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489507684] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:09:59,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371198071] [2025-03-08 05:09:59,682 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:09:59,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:09:59,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:09:59,685 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:09:59,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 05:09:59,710 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 79 statements into 2 equivalence classes. [2025-03-08 05:09:59,727 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 05:09:59,727 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:09:59,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:59,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 05:09:59,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:09:59,752 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-03-08 05:09:59,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:09:59,819 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-03-08 05:09:59,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371198071] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:09:59,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:09:59,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-08 05:09:59,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771689844] [2025-03-08 05:09:59,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:09:59,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:09:59,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:09:59,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:09:59,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:09:59,823 INFO L87 Difference]: Start difference. First operand 86 states and 107 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 05:09:59,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:09:59,861 INFO L93 Difference]: Finished difference Result 110 states and 141 transitions. [2025-03-08 05:09:59,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:09:59,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 79 [2025-03-08 05:09:59,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:09:59,862 INFO L225 Difference]: With dead ends: 110 [2025-03-08 05:09:59,862 INFO L226 Difference]: Without dead ends: 90 [2025-03-08 05:09:59,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:09:59,863 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:09:59,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:09:59,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-08 05:09:59,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-08 05:09:59,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 53 states have internal predecessors, (60), 27 states have call successors, (27), 11 states have call predecessors, (27), 11 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 05:09:59,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2025-03-08 05:09:59,884 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 79 [2025-03-08 05:09:59,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:09:59,884 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2025-03-08 05:09:59,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 05:09:59,885 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2025-03-08 05:09:59,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 05:09:59,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:09:59,887 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:09:59,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 05:10:00,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:10:00,089 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:10:00,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:10:00,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1665504689, now seen corresponding path program 1 times [2025-03-08 05:10:00,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:10:00,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807045604] [2025-03-08 05:10:00,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:10:00,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:10:00,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 05:10:00,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 05:10:00,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:10:00,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:10:00,333 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-03-08 05:10:00,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:10:00,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807045604] [2025-03-08 05:10:00,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807045604] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:10:00,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485141336] [2025-03-08 05:10:00,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:10:00,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:10:00,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:10:00,335 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:10:00,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 05:10:00,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 05:10:00,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 05:10:00,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:10:00,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:10:00,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 05:10:00,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:10:00,590 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 28 proven. 7 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2025-03-08 05:10:00,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:10:00,861 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-03-08 05:10:00,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485141336] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:10:00,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:10:00,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 8] total 18 [2025-03-08 05:10:00,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131424293] [2025-03-08 05:10:00,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:10:00,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 05:10:00,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:10:00,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 05:10:00,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-03-08 05:10:00,863 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 15 states have internal predecessors, (33), 10 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 11 states have call predecessors, (32), 10 states have call successors, (32) [2025-03-08 05:10:01,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:10:01,099 INFO L93 Difference]: Finished difference Result 104 states and 132 transitions. [2025-03-08 05:10:01,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:10:01,099 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 15 states have internal predecessors, (33), 10 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 11 states have call predecessors, (32), 10 states have call successors, (32) Word has length 83 [2025-03-08 05:10:01,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:10:01,100 INFO L225 Difference]: With dead ends: 104 [2025-03-08 05:10:01,100 INFO L226 Difference]: Without dead ends: 89 [2025-03-08 05:10:01,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2025-03-08 05:10:01,101 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 19 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:10:01,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 329 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:10:01,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-08 05:10:01,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2025-03-08 05:10:01,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 50 states have internal predecessors, (56), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 05:10:01,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2025-03-08 05:10:01,113 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 83 [2025-03-08 05:10:01,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:10:01,113 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2025-03-08 05:10:01,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 15 states have internal predecessors, (33), 10 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 11 states have call predecessors, (32), 10 states have call successors, (32) [2025-03-08 05:10:01,114 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2025-03-08 05:10:01,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 05:10:01,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:10:01,115 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:10:01,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 05:10:01,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 05:10:01,319 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:10:01,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:10:01,320 INFO L85 PathProgramCache]: Analyzing trace with hash 2072974892, now seen corresponding path program 1 times [2025-03-08 05:10:01,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:10:01,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671918840] [2025-03-08 05:10:01,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:10:01,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:10:01,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 05:10:01,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 05:10:01,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:10:01,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:10:01,391 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-08 05:10:01,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:10:01,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671918840] [2025-03-08 05:10:01,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671918840] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:10:01,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559363272] [2025-03-08 05:10:01,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:10:01,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:10:01,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:10:01,393 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:10:01,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 05:10:01,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 05:10:01,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 05:10:01,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:10:01,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:10:01,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 05:10:01,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:10:01,450 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-03-08 05:10:01,450 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:10:01,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559363272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:10:01,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:10:01,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-03-08 05:10:01,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248425417] [2025-03-08 05:10:01,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:10:01,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:10:01,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:10:01,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:10:01,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:10:01,451 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2025-03-08 05:10:01,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:10:01,487 INFO L93 Difference]: Finished difference Result 90 states and 107 transitions. [2025-03-08 05:10:01,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:10:01,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 87 [2025-03-08 05:10:01,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:10:01,488 INFO L225 Difference]: With dead ends: 90 [2025-03-08 05:10:01,488 INFO L226 Difference]: Without dead ends: 78 [2025-03-08 05:10:01,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:10:01,489 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 4 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:10:01,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 76 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:10:01,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-08 05:10:01,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-08 05:10:01,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 46 states have internal predecessors, (51), 22 states have call successors, (22), 10 states have call predecessors, (22), 10 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 05:10:01,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2025-03-08 05:10:01,498 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 87 [2025-03-08 05:10:01,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:10:01,498 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2025-03-08 05:10:01,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2025-03-08 05:10:01,498 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2025-03-08 05:10:01,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 05:10:01,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:10:01,499 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:10:01,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 05:10:01,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:10:01,699 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:10:01,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:10:01,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1734630669, now seen corresponding path program 3 times [2025-03-08 05:10:01,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:10:01,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165543889] [2025-03-08 05:10:01,700 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:10:01,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:10:01,704 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 95 statements into 8 equivalence classes. [2025-03-08 05:10:01,730 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 69 of 95 statements. [2025-03-08 05:10:01,730 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-08 05:10:01,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:10:01,960 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 31 proven. 19 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-03-08 05:10:01,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:10:01,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165543889] [2025-03-08 05:10:01,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165543889] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:10:01,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525843682] [2025-03-08 05:10:01,960 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:10:01,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:10:01,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:10:01,962 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:10:01,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 05:10:01,984 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 95 statements into 8 equivalence classes. [2025-03-08 05:10:02,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 69 of 95 statements. [2025-03-08 05:10:02,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-08 05:10:02,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:10:02,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 05:10:02,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:10:02,498 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 79 proven. 7 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-03-08 05:10:02,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:10:06,941 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (div |c_ULTIMATE.start_main_~p~0#1| 2)) (.cse2 (mod |c_ULTIMATE.start_main_~B~0#1| 4294967296))) (let ((.cse11 (= (mod |c_ULTIMATE.start_main_~p~0#1| 2) 0)) (.cse4 (forall ((|v_ULTIMATE.start_main_~p~0#1_45| Int)) (let ((.cse15 (* .cse2 |v_ULTIMATE.start_main_~p~0#1_45|))) (or (< |v_ULTIMATE.start_main_~p~0#1_45| .cse0) (not (= (mod .cse15 2) 0)) (< |c_ULTIMATE.start_main_~r~0#1| (+ .cse15 (div .cse15 2))))))) (.cse5 (forall ((|v_ULTIMATE.start_main_~p~0#1_45| Int)) (or (< |v_ULTIMATE.start_main_~p~0#1_45| .cse0) (< |c_ULTIMATE.start_main_~r~0#1| (let ((.cse14 (* .cse2 |v_ULTIMATE.start_main_~p~0#1_45|))) (+ .cse14 (div .cse14 2) 1))))))) (and (forall ((|v_ULTIMATE.start_main_~p~0#1_45| Int)) (let ((.cse1 (* .cse2 |v_ULTIMATE.start_main_~p~0#1_45|))) (or (< |v_ULTIMATE.start_main_~p~0#1_45| .cse0) (= .cse0 |v_ULTIMATE.start_main_~p~0#1_45|) (< .cse1 0) (< |c_ULTIMATE.start_main_~r~0#1| (+ .cse1 (div .cse1 2)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1_45| Int)) (or (< |v_ULTIMATE.start_main_~p~0#1_45| .cse0) (= .cse0 |v_ULTIMATE.start_main_~p~0#1_45|) (< |c_ULTIMATE.start_main_~r~0#1| (let ((.cse3 (* .cse2 |v_ULTIMATE.start_main_~p~0#1_45|))) (+ .cse3 (div .cse3 2) 1))))) (or (and .cse4 .cse5 (forall ((|v_ULTIMATE.start_main_~p~0#1_45| Int)) (or (< |v_ULTIMATE.start_main_~p~0#1_45| .cse0) (< |c_ULTIMATE.start_main_~r~0#1| (let ((.cse6 (* .cse2 |v_ULTIMATE.start_main_~p~0#1_45|))) (+ .cse6 (div .cse6 2))))))) (< |c_ULTIMATE.start_main_~p~0#1| 0)) (or (< 0 (+ |c_ULTIMATE.start_main_~p~0#1| 1)) (let ((.cse8 (+ .cse0 1))) (and (forall ((|v_ULTIMATE.start_main_~p~0#1_45| Int)) (or (< |c_ULTIMATE.start_main_~r~0#1| (let ((.cse7 (* .cse2 |v_ULTIMATE.start_main_~p~0#1_45|))) (+ .cse7 (div .cse7 2) 1))) (< |v_ULTIMATE.start_main_~p~0#1_45| .cse8))) (forall ((|v_ULTIMATE.start_main_~p~0#1_45| Int)) (let ((.cse9 (* .cse2 |v_ULTIMATE.start_main_~p~0#1_45|))) (or (< |v_ULTIMATE.start_main_~p~0#1_45| .cse8) (< .cse9 0) (< |c_ULTIMATE.start_main_~r~0#1| (+ .cse9 (div .cse9 2)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1_45| Int)) (let ((.cse10 (* .cse2 |v_ULTIMATE.start_main_~p~0#1_45|))) (or (not (= (mod .cse10 2) 0)) (< |v_ULTIMATE.start_main_~p~0#1_45| .cse8) (< |c_ULTIMATE.start_main_~r~0#1| (+ .cse10 (div .cse10 2)))))))) .cse11) (forall ((|v_ULTIMATE.start_main_~p~0#1_45| Int)) (let ((.cse12 (* .cse2 |v_ULTIMATE.start_main_~p~0#1_45|))) (or (< |v_ULTIMATE.start_main_~p~0#1_45| .cse0) (= .cse0 |v_ULTIMATE.start_main_~p~0#1_45|) (not (= (mod .cse12 2) 0)) (< |c_ULTIMATE.start_main_~r~0#1| (+ .cse12 (div .cse12 2)))))) (or (not .cse11) (and .cse4 .cse5 (forall ((|v_ULTIMATE.start_main_~p~0#1_45| Int)) (let ((.cse13 (* .cse2 |v_ULTIMATE.start_main_~p~0#1_45|))) (or (< |v_ULTIMATE.start_main_~p~0#1_45| .cse0) (< .cse13 0) (< |c_ULTIMATE.start_main_~r~0#1| (+ .cse13 (div .cse13 2))))))))))) is different from false [2025-03-08 05:10:07,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525843682] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:10:07,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:10:07,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2025-03-08 05:10:07,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464421725] [2025-03-08 05:10:07,145 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 05:10:07,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 05:10:07,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:10:07,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 05:10:07,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=485, Unknown=1, NotChecked=44, Total=600 [2025-03-08 05:10:07,146 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 11 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 12 states have call predecessors, (30), 10 states have call successors, (30) [2025-03-08 05:10:08,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:10:08,055 INFO L93 Difference]: Finished difference Result 138 states and 175 transitions. [2025-03-08 05:10:08,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 05:10:08,056 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 11 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 12 states have call predecessors, (30), 10 states have call successors, (30) Word has length 95 [2025-03-08 05:10:08,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:10:08,057 INFO L225 Difference]: With dead ends: 138 [2025-03-08 05:10:08,057 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 05:10:08,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=197, Invalid=928, Unknown=1, NotChecked=64, Total=1190 [2025-03-08 05:10:08,058 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 51 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:10:08,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 314 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:10:08,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 05:10:08,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2025-03-08 05:10:08,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 46 states have (on average 1.108695652173913) internal successors, (51), 47 states have internal predecessors, (51), 22 states have call successors, (22), 10 states have call predecessors, (22), 10 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 05:10:08,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 94 transitions. [2025-03-08 05:10:08,080 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 94 transitions. Word has length 95 [2025-03-08 05:10:08,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:10:08,080 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 94 transitions. [2025-03-08 05:10:08,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 11 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 12 states have call predecessors, (30), 10 states have call successors, (30) [2025-03-08 05:10:08,080 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2025-03-08 05:10:08,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 05:10:08,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:10:08,082 INFO L218 NwaCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:10:08,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 05:10:08,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 05:10:08,282 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:10:08,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:10:08,283 INFO L85 PathProgramCache]: Analyzing trace with hash -760139791, now seen corresponding path program 1 times [2025-03-08 05:10:08,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:10:08,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466565704] [2025-03-08 05:10:08,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:10:08,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:10:08,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 05:10:08,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 05:10:08,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:10:08,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:10:08,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1617638979] [2025-03-08 05:10:08,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:10:08,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:10:08,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:10:08,307 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:10:08,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 05:10:08,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 05:10:08,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 05:10:08,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:10:08,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:10:08,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-08 05:10:08,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:10:08,891 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 27 proven. 66 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2025-03-08 05:10:08,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:10:10,798 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 27 proven. 66 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2025-03-08 05:10:10,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:10:10,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466565704] [2025-03-08 05:10:10,798 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:10:10,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617638979] [2025-03-08 05:10:10,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617638979] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:10:10,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:10:10,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 29 [2025-03-08 05:10:10,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50421727] [2025-03-08 05:10:10,798 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 05:10:10,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-08 05:10:10,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:10:10,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-08 05:10:10,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2025-03-08 05:10:10,800 INFO L87 Difference]: Start difference. First operand 79 states and 94 transitions. Second operand has 29 states, 25 states have (on average 1.64) internal successors, (41), 26 states have internal predecessors, (41), 16 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (34), 13 states have call predecessors, (34), 16 states have call successors, (34) [2025-03-08 05:10:11,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:10:11,713 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. [2025-03-08 05:10:11,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 05:10:11,714 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 1.64) internal successors, (41), 26 states have internal predecessors, (41), 16 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (34), 13 states have call predecessors, (34), 16 states have call successors, (34) Word has length 100 [2025-03-08 05:10:11,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:10:11,714 INFO L225 Difference]: With dead ends: 106 [2025-03-08 05:10:11,714 INFO L226 Difference]: Without dead ends: 86 [2025-03-08 05:10:11,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 05:10:11,715 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 26 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:10:11,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 360 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:10:11,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-08 05:10:11,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-08 05:10:11,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 53 states have internal predecessors, (53), 20 states have call successors, (20), 13 states have call predecessors, (20), 13 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 05:10:11,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2025-03-08 05:10:11,733 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 100 [2025-03-08 05:10:11,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:10:11,734 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2025-03-08 05:10:11,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 1.64) internal successors, (41), 26 states have internal predecessors, (41), 16 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (34), 13 states have call predecessors, (34), 16 states have call successors, (34) [2025-03-08 05:10:11,735 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2025-03-08 05:10:11,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 05:10:11,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:10:11,735 INFO L218 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:10:11,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 05:10:11,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 05:10:11,939 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:10:11,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:10:11,940 INFO L85 PathProgramCache]: Analyzing trace with hash -463975478, now seen corresponding path program 1 times [2025-03-08 05:10:11,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:10:11,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757455300] [2025-03-08 05:10:11,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:10:11,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:10:11,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 05:10:11,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 05:10:11,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:10:11,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:10:11,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [111372964] [2025-03-08 05:10:11,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:10:11,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:10:11,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:10:11,963 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:10:11,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 05:10:11,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 05:10:12,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 05:10:12,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:10:12,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:10:12,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-08 05:10:12,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:10:12,795 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 64 proven. 66 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2025-03-08 05:10:12,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:10:13,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:10:13,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757455300] [2025-03-08 05:10:13,534 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:10:13,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111372964] [2025-03-08 05:10:13,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111372964] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:10:13,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:10:13,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2025-03-08 05:10:13,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870843428] [2025-03-08 05:10:13,534 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 05:10:13,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 05:10:13,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:10:13,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 05:10:13,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2025-03-08 05:10:13,535 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 16 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 9 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) [2025-03-08 05:10:13,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:10:13,869 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2025-03-08 05:10:13,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 05:10:13,869 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 9 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) Word has length 106 [2025-03-08 05:10:13,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:10:13,870 INFO L225 Difference]: With dead ends: 92 [2025-03-08 05:10:13,870 INFO L226 Difference]: Without dead ends: 88 [2025-03-08 05:10:13,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2025-03-08 05:10:13,870 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 4 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:10:13,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 328 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:10:13,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-08 05:10:13,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-08 05:10:13,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 54 states have (on average 1.0) internal successors, (54), 54 states have internal predecessors, (54), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 05:10:13,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2025-03-08 05:10:13,881 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 106 [2025-03-08 05:10:13,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:10:13,881 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2025-03-08 05:10:13,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 9 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) [2025-03-08 05:10:13,881 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2025-03-08 05:10:13,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 05:10:13,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:10:13,882 INFO L218 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:10:13,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-08 05:10:14,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 05:10:14,082 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:10:14,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:10:14,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1526999845, now seen corresponding path program 1 times [2025-03-08 05:10:14,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:10:14,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379188442] [2025-03-08 05:10:14,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:10:14,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:10:14,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 05:10:14,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 05:10:14,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:10:14,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:10:14,408 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 32 proven. 22 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2025-03-08 05:10:14,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:10:14,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379188442] [2025-03-08 05:10:14,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379188442] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:10:14,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778202036] [2025-03-08 05:10:14,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:10:14,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:10:14,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:10:14,411 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:10:14,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 05:10:14,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 05:10:14,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 05:10:14,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:10:14,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:10:14,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 05:10:14,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:10:14,871 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 31 proven. 68 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2025-03-08 05:10:14,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:10:15,534 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 31 proven. 68 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2025-03-08 05:10:15,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778202036] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:10:15,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:10:15,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 12] total 26 [2025-03-08 05:10:15,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665372008] [2025-03-08 05:10:15,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:10:15,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 05:10:15,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:10:15,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 05:10:15,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2025-03-08 05:10:15,535 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 26 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 23 states have internal predecessors, (44), 19 states have call successors, (50), 3 states have call predecessors, (50), 2 states have return successors, (48), 17 states have call predecessors, (48), 19 states have call successors, (48) [2025-03-08 05:10:15,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:10:15,918 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2025-03-08 05:10:15,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 05:10:15,919 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 23 states have internal predecessors, (44), 19 states have call successors, (50), 3 states have call predecessors, (50), 2 states have return successors, (48), 17 states have call predecessors, (48), 19 states have call successors, (48) Word has length 111 [2025-03-08 05:10:15,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:10:15,919 INFO L225 Difference]: With dead ends: 88 [2025-03-08 05:10:15,919 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 05:10:15,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=846, Unknown=0, NotChecked=0, Total=992 [2025-03-08 05:10:15,920 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:10:15,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 251 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:10:15,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 05:10:15,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 05:10:15,921 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-08 05:10:15,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 05:10:15,921 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 111 [2025-03-08 05:10:15,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:10:15,921 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 05:10:15,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 23 states have internal predecessors, (44), 19 states have call successors, (50), 3 states have call predecessors, (50), 2 states have return successors, (48), 17 states have call predecessors, (48), 19 states have call successors, (48) [2025-03-08 05:10:15,921 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 05:10:15,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 05:10:15,924 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 05:10:15,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-08 05:10:16,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 05:10:16,127 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:10:16,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 05:10:17,049 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 05:10:17,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:10:17 BoogieIcfgContainer [2025-03-08 05:10:17,062 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 05:10:17,063 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 05:10:17,063 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 05:10:17,063 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 05:10:17,064 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:09:51" (3/4) ... [2025-03-08 05:10:17,066 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 05:10:17,069 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-08 05:10:17,069 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-08 05:10:17,074 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-08 05:10:17,074 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 05:10:17,074 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 05:10:17,074 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 05:10:17,129 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 05:10:17,130 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 05:10:17,130 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 05:10:17,131 INFO L158 Benchmark]: Toolchain (without parser) took 25868.47ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 111.9MB in the beginning and 114.9MB in the end (delta: -3.1MB). Peak memory consumption was 118.8MB. Max. memory is 16.1GB. [2025-03-08 05:10:17,131 INFO L158 Benchmark]: CDTParser took 1.05ms. Allocated memory is still 226.5MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:10:17,132 INFO L158 Benchmark]: CACSL2BoogieTranslator took 138.47ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 100.4MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:10:17,132 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.04ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 98.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:10:17,132 INFO L158 Benchmark]: Boogie Preprocessor took 16.48ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 97.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:10:17,132 INFO L158 Benchmark]: IcfgBuilder took 202.29ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 85.7MB in the end (delta: 12.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 05:10:17,133 INFO L158 Benchmark]: TraceAbstraction took 25420.66ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 84.7MB in the beginning and 123.0MB in the end (delta: -38.3MB). Peak memory consumption was 128.3MB. Max. memory is 16.1GB. [2025-03-08 05:10:17,133 INFO L158 Benchmark]: Witness Printer took 67.81ms. Allocated memory is still 268.4MB. Free memory was 123.0MB in the beginning and 114.9MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:10:17,134 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.05ms. Allocated memory is still 226.5MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 138.47ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 100.4MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.04ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 98.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.48ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 97.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 202.29ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 85.7MB in the end (delta: 12.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 25420.66ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 84.7MB in the beginning and 123.0MB in the end (delta: -38.3MB). Peak memory consumption was 128.3MB. Max. memory is 16.1GB. * Witness Printer took 67.81ms. Allocated memory is still 268.4MB. Free memory was 123.0MB in the beginning and 114.9MB in the end (delta: 8.1MB). 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: 17]: 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 3 procedures, 31 locations, 55 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.4s, OverallIterations: 16, TraceHistogramMax: 17, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 267 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 221 mSDsluCounter, 3019 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2484 mSDsCounter, 377 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2480 IncrementalHoareTripleChecker+Invalid, 2857 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 377 mSolverCounterUnsat, 535 mSDtfsCounter, 2480 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1659 GetRequests, 1425 SyntacticMatches, 5 SemanticMatches, 229 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 913 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=8, InterpolantAutomatonStates: 152, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 66 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 15.1s InterpolantComputationTime, 2006 NumberOfCodeBlocks, 1954 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 2072 ConstructedInterpolants, 2 QuantifiedInterpolants, 10739 SizeOfPredicates, 28 NumberOfNonLiveVariables, 2109 ConjunctsInSsa, 263 ConjunctsInUnsatCore, 29 InterpolantComputations, 8 PerfectInterpolantSequences, 6358/6821 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: 22]: Location Invariant Derived location invariant: (((((((((((((p == 4) && (r <= 2)) && (q == 0)) && (r == A)) && (((__int128) r + 1) <= d)) && (((d >= 0) ? (d % 2) : ((d % 2) + 2)) == 0)) && (((d >= 0) ? (d / 2) : ((d / 2) - 1)) <= r)) && ((((d >= 0) ? (d / 2) : ((d / 2) - 1)) + A) == ((__int128) ((long long) 2 * B) + r))) || ((((((d == 1) && (p == 1)) && (B == 1)) && (r == 0)) && (2 == q)) && (2 == A))) || ((((((2 == p) && (((long long) 2 * B) == d)) && (q == 0)) && (r == A)) && (((__int128) r + 1) <= d)) && (((d >= 0) ? (d / 2) : ((d / 2) - 1)) <= r))) || ((((((((__int128) r + B) == A) && (p == 1)) && (((long long) A + 1) <= ((__int128) 2 * d))) && (d <= A)) && (q == 1)) && (((__int128) d + A) == ((__int128) ((long long) 2 * B) + r)))) || ((((((2 == p) && (B == 1)) && (r == 0)) && (2 == q)) && (2 == A)) && (2 == d))) || ((((p == 1) && (d == B)) && (q == 0)) && (r == A))) - InvariantResult [Line: 36]: Location Invariant Derived location invariant: (((((((((2 == p) && (((long long) 2 * B) == d)) && (r <= 2)) && (1 <= ((d >= 0) ? (d / 2) : ((d / 2) - 1)))) && (q == 0)) && (r == A)) && (((d >= 0) ? (d / 2) : ((d / 2) - 1)) <= r)) || ((((((p == 1) && (d == B)) && (r <= 2)) && (q == 0)) && (r == A)) && (((__int128) r + 1) <= ((__int128) 3 * d)))) || ((((((((p == 4) && (r <= 2)) && ((((__int128) r * 4) + 4) <= ((__int128) 3 * d))) && (q == 0)) && (r == A)) && (((d >= 0) ? (d % 2) : ((d % 2) + 2)) == 0)) && (((d >= 0) ? (d / 2) : ((d / 2) - 1)) <= r)) && ((((d >= 0) ? (d / 2) : ((d / 2) - 1)) + A) == ((__int128) ((long long) 2 * B) + r)))) RESULT: Ultimate proved your program to be correct! [2025-03-08 05:10:17,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE