./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound50.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/cohencu-ll_valuebound50.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 0bcbcb4a55258889434b8bf703da9ec6fb29d07a2fbacad968a5ab15e005b314 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:54:37,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:54:38,022 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:54:38,028 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:54:38,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:54:38,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:54:38,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:54:38,054 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:54:38,055 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:54:38,055 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:54:38,055 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:54:38,055 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:54:38,055 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:54:38,055 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:54:38,055 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:54:38,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:54:38,055 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:54:38,055 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:54:38,055 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:54:38,055 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:54:38,055 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:54:38,056 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:54:38,056 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:54:38,056 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:54:38,056 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:54:38,056 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:54:38,056 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:54:38,056 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:54:38,056 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:54:38,056 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:54:38,056 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:54:38,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:54:38,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:54:38,056 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:54:38,056 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:54:38,056 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:54:38,056 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:54:38,056 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:54:38,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:54:38,057 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:54:38,057 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:54:38,057 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:54:38,057 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:54:38,057 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 -> 0bcbcb4a55258889434b8bf703da9ec6fb29d07a2fbacad968a5ab15e005b314 [2025-03-08 04:54:38,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:54:38,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:54:38,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:54:38,290 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:54:38,290 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:54:38,291 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound50.c [2025-03-08 04:54:39,361 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f509fec7/71946934069a4171878a9acf5e3257d8/FLAG3d5c90e98 [2025-03-08 04:54:39,554 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:54:39,555 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound50.c [2025-03-08 04:54:39,561 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f509fec7/71946934069a4171878a9acf5e3257d8/FLAG3d5c90e98 [2025-03-08 04:54:39,924 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f509fec7/71946934069a4171878a9acf5e3257d8 [2025-03-08 04:54:39,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:54:39,929 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:54:39,930 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:54:39,930 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:54:39,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:54:39,934 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:54:39" (1/1) ... [2025-03-08 04:54:39,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1950c99f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:39, skipping insertion in model container [2025-03-08 04:54:39,935 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:54:39" (1/1) ... [2025-03-08 04:54:39,943 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:54:40,032 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/cohencu-ll_valuebound50.c[588,601] [2025-03-08 04:54:40,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:54:40,060 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:54:40,067 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/cohencu-ll_valuebound50.c[588,601] [2025-03-08 04:54:40,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:54:40,087 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:54:40,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:40 WrapperNode [2025-03-08 04:54:40,087 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:54:40,088 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:54:40,088 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:54:40,088 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:54:40,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:40" (1/1) ... [2025-03-08 04:54:40,098 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:40" (1/1) ... [2025-03-08 04:54:40,111 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 45 [2025-03-08 04:54:40,112 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:54:40,113 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:54:40,113 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:54:40,113 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:54:40,119 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:40" (1/1) ... [2025-03-08 04:54:40,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:40" (1/1) ... [2025-03-08 04:54:40,121 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:40" (1/1) ... [2025-03-08 04:54:40,130 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 04:54:40,131 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:40" (1/1) ... [2025-03-08 04:54:40,132 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:40" (1/1) ... [2025-03-08 04:54:40,134 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:40" (1/1) ... [2025-03-08 04:54:40,137 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:40" (1/1) ... [2025-03-08 04:54:40,138 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:40" (1/1) ... [2025-03-08 04:54:40,138 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:40" (1/1) ... [2025-03-08 04:54:40,139 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:54:40,140 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:54:40,141 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:54:40,141 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:54:40,141 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:40" (1/1) ... [2025-03-08 04:54:40,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:54:40,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:54:40,164 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 04:54:40,166 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 04:54:40,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:54:40,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:54:40,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:54:40,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:54:40,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 04:54:40,184 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 04:54:40,221 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:54:40,222 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:54:40,354 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-08 04:54:40,354 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:54:40,360 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:54:40,361 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:54:40,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:54:40 BoogieIcfgContainer [2025-03-08 04:54:40,361 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:54:40,363 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:54:40,364 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:54:40,367 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:54:40,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:54:39" (1/3) ... [2025-03-08 04:54:40,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0970da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:54:40, skipping insertion in model container [2025-03-08 04:54:40,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:40" (2/3) ... [2025-03-08 04:54:40,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0970da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:54:40, skipping insertion in model container [2025-03-08 04:54:40,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:54:40" (3/3) ... [2025-03-08 04:54:40,369 INFO L128 eAbstractionObserver]: Analyzing ICFG cohencu-ll_valuebound50.c [2025-03-08 04:54:40,381 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:54:40,383 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cohencu-ll_valuebound50.c that has 2 procedures, 26 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 04:54:40,424 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:54:40,432 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;@475b5e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:54:40,432 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 04:54:40,435 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 04:54:40,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 04:54:40,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:54:40,438 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:40,438 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:54:40,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:54:40,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1735599928, now seen corresponding path program 1 times [2025-03-08 04:54:40,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:54:40,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618575489] [2025-03-08 04:54:40,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:40,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:54:40,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 04:54:40,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 04:54:40,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:40,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:40,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:54:40,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:54:40,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618575489] [2025-03-08 04:54:40,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618575489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:54:40,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:54:40,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 04:54:40,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374009323] [2025-03-08 04:54:40,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:54:40,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 04:54:40,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:54:40,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 04:54:40,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 04:54:40,552 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:54:40,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:54:40,564 INFO L93 Difference]: Finished difference Result 49 states and 85 transitions. [2025-03-08 04:54:40,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 04:54:40,566 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-08 04:54:40,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:54:40,569 INFO L225 Difference]: With dead ends: 49 [2025-03-08 04:54:40,569 INFO L226 Difference]: Without dead ends: 22 [2025-03-08 04:54:40,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 04:54:40,574 INFO L435 NwaCegarLoop]: 36 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, 36 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 04:54:40,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:54:40,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-08 04:54:40,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-08 04:54:40,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 04:54:40,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2025-03-08 04:54:40,597 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 8 [2025-03-08 04:54:40,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:54:40,597 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2025-03-08 04:54:40,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:54:40,598 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2025-03-08 04:54:40,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 04:54:40,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:54:40,598 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:40,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 04:54:40,599 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:54:40,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:54:40,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1706970777, now seen corresponding path program 1 times [2025-03-08 04:54:40,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:54:40,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169593841] [2025-03-08 04:54:40,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:40,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:54:40,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 04:54:40,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 04:54:40,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:40,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:40,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:54:40,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:54:40,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169593841] [2025-03-08 04:54:40,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169593841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:54:40,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:54:40,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:54:40,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410545307] [2025-03-08 04:54:40,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:54:40,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:54:40,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:54:40,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:54:40,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:54:40,767 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:54:40,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:54:40,857 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2025-03-08 04:54:40,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:54:40,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-08 04:54:40,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:54:40,858 INFO L225 Difference]: With dead ends: 28 [2025-03-08 04:54:40,858 INFO L226 Difference]: Without dead ends: 26 [2025-03-08 04:54:40,858 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 04:54:40,858 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:54:40,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 83 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:54:40,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-08 04:54:40,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-08 04:54:40,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 04:54:40,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2025-03-08 04:54:40,867 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 8 [2025-03-08 04:54:40,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:54:40,867 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2025-03-08 04:54:40,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:54:40,867 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2025-03-08 04:54:40,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 04:54:40,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:54:40,869 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:40,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 04:54:40,869 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:54:40,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:54:40,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1634389675, now seen corresponding path program 1 times [2025-03-08 04:54:40,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:54:40,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507680046] [2025-03-08 04:54:40,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:40,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:54:40,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 04:54:40,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 04:54:40,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:40,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 04:54:40,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [419193135] [2025-03-08 04:54:40,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:40,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:40,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:54:40,894 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 04:54:40,895 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 04:54:40,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 04:54:40,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 04:54:40,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:40,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:40,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 04:54:40,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:54:40,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:54:40,987 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:54:40,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:54:40,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507680046] [2025-03-08 04:54:40,988 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 04:54:40,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419193135] [2025-03-08 04:54:40,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419193135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:54:40,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:54:40,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:54:40,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660074049] [2025-03-08 04:54:40,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:54:40,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:54:40,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:54:40,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:54:40,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:54:40,989 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 04:54:41,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:54:41,058 INFO L93 Difference]: Finished difference Result 44 states and 63 transitions. [2025-03-08 04:54:41,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:54:41,061 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-03-08 04:54:41,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:54:41,063 INFO L225 Difference]: With dead ends: 44 [2025-03-08 04:54:41,063 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 04:54:41,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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 04:54:41,064 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:54:41,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 103 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:54:41,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 04:54:41,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2025-03-08 04:54:41,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 states have internal predecessors, (17), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 04:54:41,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2025-03-08 04:54:41,076 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 13 [2025-03-08 04:54:41,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:54:41,078 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2025-03-08 04:54:41,078 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 04:54:41,078 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2025-03-08 04:54:41,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 04:54:41,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:54:41,078 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:41,084 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 04:54:41,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:41,279 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:54:41,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:54:41,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1549967769, now seen corresponding path program 1 times [2025-03-08 04:54:41,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:54:41,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458584939] [2025-03-08 04:54:41,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:41,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:54:41,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 04:54:41,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 04:54:41,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:41,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 04:54:41,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1975326565] [2025-03-08 04:54:41,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:41,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:41,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:54:41,292 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 04:54:41,293 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 04:54:41,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 04:54:41,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 04:54:41,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:41,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:41,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 04:54:41,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:54:41,363 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 04:54:41,363 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:54:41,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:54:41,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458584939] [2025-03-08 04:54:41,363 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 04:54:41,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975326565] [2025-03-08 04:54:41,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975326565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:54:41,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:54:41,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:54:41,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243199089] [2025-03-08 04:54:41,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:54:41,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:54:41,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:54:41,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:54:41,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:54:41,364 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 04:54:41,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:54:41,420 INFO L93 Difference]: Finished difference Result 48 states and 66 transitions. [2025-03-08 04:54:41,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:54:41,421 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), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2025-03-08 04:54:41,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:54:41,422 INFO L225 Difference]: With dead ends: 48 [2025-03-08 04:54:41,422 INFO L226 Difference]: Without dead ends: 46 [2025-03-08 04:54:41,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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 04:54:41,424 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:54:41,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 100 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:54:41,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-08 04:54:41,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2025-03-08 04:54:41,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 04:54:41,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2025-03-08 04:54:41,441 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 18 [2025-03-08 04:54:41,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:54:41,441 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2025-03-08 04:54:41,441 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), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 04:54:41,441 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2025-03-08 04:54:41,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 04:54:41,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:54:41,442 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:41,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 04:54:41,642 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 04:54:41,642 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:54:41,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:54:41,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1816360149, now seen corresponding path program 1 times [2025-03-08 04:54:41,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:54:41,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856634099] [2025-03-08 04:54:41,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:41,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:54:41,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 04:54:41,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 04:54:41,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:41,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 04:54:41,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1485608248] [2025-03-08 04:54:41,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:41,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:41,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:54:41,661 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 04:54:41,662 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 04:54:41,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 04:54:41,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 04:54:41,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:41,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:41,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 04:54:41,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:54:41,747 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 04:54:41,747 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:54:41,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:54:41,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856634099] [2025-03-08 04:54:41,748 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 04:54:41,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485608248] [2025-03-08 04:54:41,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485608248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:54:41,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:54:41,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:54:41,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856537818] [2025-03-08 04:54:41,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:54:41,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:54:41,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:54:41,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:54:41,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:54:41,749 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 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 04:54:41,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:54:41,819 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2025-03-08 04:54:41,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:54:41,819 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), 1 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 04:54:41,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:54:41,820 INFO L225 Difference]: With dead ends: 56 [2025-03-08 04:54:41,820 INFO L226 Difference]: Without dead ends: 44 [2025-03-08 04:54:41,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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 04:54:41,821 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:54:41,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 92 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:54:41,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-08 04:54:41,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-08 04:54:41,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 04:54:41,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2025-03-08 04:54:41,828 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 23 [2025-03-08 04:54:41,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:54:41,828 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2025-03-08 04:54:41,828 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), 1 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 04:54:41,828 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2025-03-08 04:54:41,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 04:54:41,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:54:41,829 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:41,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 04:54:42,033 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 04:54:42,033 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:54:42,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:54:42,033 INFO L85 PathProgramCache]: Analyzing trace with hash 788053417, now seen corresponding path program 1 times [2025-03-08 04:54:42,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:54:42,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961171365] [2025-03-08 04:54:42,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:42,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:54:42,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 04:54:42,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 04:54:42,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:42,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 04:54:42,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [336070581] [2025-03-08 04:54:42,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:42,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:42,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:54:42,051 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 04:54:42,052 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 04:54:42,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 04:54:42,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 04:54:42,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:42,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:42,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 04:54:42,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:54:42,196 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 11 proven. 18 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 04:54:42,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:54:42,337 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 04:54:42,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:54:42,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961171365] [2025-03-08 04:54:42,338 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 04:54:42,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336070581] [2025-03-08 04:54:42,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336070581] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:54:42,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:54:42,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2025-03-08 04:54:42,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368284220] [2025-03-08 04:54:42,338 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:54:42,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 04:54:42,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:54:42,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 04:54:42,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-08 04:54:42,340 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 13 states, 10 states have (on average 2.0) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-08 04:54:42,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:54:42,535 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2025-03-08 04:54:42,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 04:54:42,535 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 2.0) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 39 [2025-03-08 04:54:42,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:54:42,536 INFO L225 Difference]: With dead ends: 66 [2025-03-08 04:54:42,536 INFO L226 Difference]: Without dead ends: 64 [2025-03-08 04:54:42,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-03-08 04:54:42,537 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:54:42,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 123 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:54:42,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-08 04:54:42,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2025-03-08 04:54:42,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 29 states have internal predecessors, (30), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 04:54:42,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2025-03-08 04:54:42,548 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 39 [2025-03-08 04:54:42,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:54:42,548 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2025-03-08 04:54:42,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 2.0) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-08 04:54:42,548 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2025-03-08 04:54:42,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 04:54:42,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:54:42,549 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:42,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 04:54:42,750 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 04:54:42,750 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:54:42,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:54:42,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1323853459, now seen corresponding path program 2 times [2025-03-08 04:54:42,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:54:42,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830019079] [2025-03-08 04:54:42,750 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:54:42,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:54:42,758 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-08 04:54:42,777 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 04:54:42,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:54:42,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 04:54:42,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [719193527] [2025-03-08 04:54:42,779 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:54:42,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:42,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:54:42,784 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 04:54:42,785 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 04:54:42,810 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-08 04:54:42,824 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 04:54:42,824 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:54:42,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:42,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 04:54:42,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:54:42,921 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 28 proven. 7 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-08 04:54:42,924 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:54:43,078 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 28 proven. 7 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-08 04:54:43,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:54:43,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830019079] [2025-03-08 04:54:43,079 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 04:54:43,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719193527] [2025-03-08 04:54:43,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719193527] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:54:43,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:54:43,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2025-03-08 04:54:43,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678133633] [2025-03-08 04:54:43,079 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:54:43,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 04:54:43,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:54:43,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 04:54:43,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-08 04:54:43,080 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 14 states, 10 states have (on average 2.0) internal successors, (20), 11 states have internal predecessors, (20), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-08 04:54:43,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:54:43,294 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2025-03-08 04:54:43,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 04:54:43,295 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.0) internal successors, (20), 11 states have internal predecessors, (20), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) Word has length 44 [2025-03-08 04:54:43,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:54:43,296 INFO L225 Difference]: With dead ends: 79 [2025-03-08 04:54:43,297 INFO L226 Difference]: Without dead ends: 74 [2025-03-08 04:54:43,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-03-08 04:54:43,298 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:54:43,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 133 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:54:43,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-08 04:54:43,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2025-03-08 04:54:43,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 40 states have internal predecessors, (41), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 04:54:43,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2025-03-08 04:54:43,315 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 44 [2025-03-08 04:54:43,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:54:43,315 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2025-03-08 04:54:43,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 2.0) internal successors, (20), 11 states have internal predecessors, (20), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-08 04:54:43,315 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2025-03-08 04:54:43,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 04:54:43,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:54:43,316 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:43,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 04:54:43,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:43,520 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:54:43,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:54:43,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1450305035, now seen corresponding path program 1 times [2025-03-08 04:54:43,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:54:43,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724342524] [2025-03-08 04:54:43,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:43,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:54:43,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 04:54:43,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 04:54:43,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:43,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 04:54:43,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [339572201] [2025-03-08 04:54:43,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:43,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:43,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:54:43,549 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 04:54:43,550 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 04:54:43,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 04:54:43,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 04:54:43,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:43,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:43,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 04:54:43,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:54:43,722 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 04:54:43,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:54:43,854 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 04:54:43,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:54:43,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724342524] [2025-03-08 04:54:43,854 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 04:54:43,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339572201] [2025-03-08 04:54:43,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339572201] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:54:43,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:54:43,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-08 04:54:43,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470264888] [2025-03-08 04:54:43,854 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:54:43,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 04:54:43,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:54:43,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 04:54:43,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-08 04:54:43,855 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. Second operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2025-03-08 04:54:44,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:54:44,072 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2025-03-08 04:54:44,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 04:54:44,073 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 65 [2025-03-08 04:54:44,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:54:44,075 INFO L225 Difference]: With dead ends: 99 [2025-03-08 04:54:44,075 INFO L226 Difference]: Without dead ends: 97 [2025-03-08 04:54:44,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-08 04:54:44,075 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:54:44,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 192 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 04:54:44,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-08 04:54:44,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2025-03-08 04:54:44,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 51 states have internal predecessors, (52), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 04:54:44,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112 transitions. [2025-03-08 04:54:44,103 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 112 transitions. Word has length 65 [2025-03-08 04:54:44,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:54:44,103 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 112 transitions. [2025-03-08 04:54:44,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2025-03-08 04:54:44,103 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 112 transitions. [2025-03-08 04:54:44,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 04:54:44,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:54:44,104 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:44,110 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 04:54:44,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:44,304 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:54:44,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:54:44,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1469357305, now seen corresponding path program 1 times [2025-03-08 04:54:44,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:54:44,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190028914] [2025-03-08 04:54:44,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:44,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:54:44,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 04:54:44,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 04:54:44,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:44,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 04:54:44,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2088864074] [2025-03-08 04:54:44,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:44,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:44,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:54:44,327 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 04:54:44,328 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 04:54:44,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 04:54:44,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 04:54:44,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:44,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:44,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 04:54:44,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:54:44,492 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 04:54:44,492 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:54:44,602 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 04:54:44,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:54:44,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190028914] [2025-03-08 04:54:44,603 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 04:54:44,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088864074] [2025-03-08 04:54:44,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088864074] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:54:44,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:54:44,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-08 04:54:44,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309267945] [2025-03-08 04:54:44,603 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:54:44,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 04:54:44,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:54:44,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 04:54:44,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-08 04:54:44,604 INFO L87 Difference]: Start difference. First operand 93 states and 112 transitions. Second operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 6 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2025-03-08 04:54:44,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:54:44,918 INFO L93 Difference]: Finished difference Result 119 states and 150 transitions. [2025-03-08 04:54:44,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 04:54:44,918 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 6 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) Word has length 70 [2025-03-08 04:54:44,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:54:44,920 INFO L225 Difference]: With dead ends: 119 [2025-03-08 04:54:44,920 INFO L226 Difference]: Without dead ends: 110 [2025-03-08 04:54:44,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-03-08 04:54:44,921 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:54:44,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 164 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 04:54:44,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-08 04:54:44,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 103. [2025-03-08 04:54:44,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 55 states have internal predecessors, (56), 36 states have call successors, (36), 14 states have call predecessors, (36), 14 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 04:54:44,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 127 transitions. [2025-03-08 04:54:44,947 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 127 transitions. Word has length 70 [2025-03-08 04:54:44,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:54:44,948 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 127 transitions. [2025-03-08 04:54:44,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 6 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2025-03-08 04:54:44,948 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2025-03-08 04:54:44,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 04:54:44,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:54:44,948 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:44,956 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 04:54:45,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:45,149 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:54:45,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:54:45,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1622041987, now seen corresponding path program 3 times [2025-03-08 04:54:45,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:54:45,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806862144] [2025-03-08 04:54:45,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:54:45,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:54:45,154 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 75 statements into 11 equivalence classes. [2025-03-08 04:54:45,180 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 04:54:45,181 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-08 04:54:45,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 04:54:45,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [315895359] [2025-03-08 04:54:45,182 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:54:45,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:45,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:54:45,183 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 04:54:45,185 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 04:54:45,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 75 statements into 11 equivalence classes. [2025-03-08 04:54:45,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 75 statements. [2025-03-08 04:54:45,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 04:54:45,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:45,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 04:54:45,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:54:57,393 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 116 proven. 9 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2025-03-08 04:54:57,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:55:15,700 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 116 proven. 9 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2025-03-08 04:55:15,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:55:15,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806862144] [2025-03-08 04:55:15,700 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 04:55:15,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315895359] [2025-03-08 04:55:15,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315895359] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:55:15,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:55:15,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2025-03-08 04:55:15,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509474180] [2025-03-08 04:55:15,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:55:15,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 04:55:15,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:55:15,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 04:55:15,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=166, Unknown=3, NotChecked=0, Total=210 [2025-03-08 04:55:15,702 INFO L87 Difference]: Start difference. First operand 103 states and 127 transitions. Second operand has 15 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 7 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-08 04:55:21,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 04:55:26,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 04:55:28,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 04:55:32,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 04:55:38,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 04:55:43,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 04:55:44,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 04:55:44,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:55:44,336 INFO L93 Difference]: Finished difference Result 109 states and 132 transitions. [2025-03-08 04:55:44,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 04:55:44,336 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 7 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) Word has length 75 [2025-03-08 04:55:44,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:55:44,337 INFO L225 Difference]: With dead ends: 109 [2025-03-08 04:55:44,337 INFO L226 Difference]: Without dead ends: 93 [2025-03-08 04:55:44,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 26.8s TimeCoverageRelationStatistics Valid=58, Invalid=211, Unknown=3, NotChecked=0, Total=272 [2025-03-08 04:55:44,338 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 60 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:55:44,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 128 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 118 Invalid, 3 Unknown, 0 Unchecked, 25.0s Time] [2025-03-08 04:55:44,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-08 04:55:44,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-08 04:55:44,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 51 states have internal predecessors, (52), 30 states have call successors, (30), 13 states have call predecessors, (30), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 04:55:44,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 110 transitions. [2025-03-08 04:55:44,367 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 110 transitions. Word has length 75 [2025-03-08 04:55:44,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:55:44,367 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 110 transitions. [2025-03-08 04:55:44,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 7 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-08 04:55:44,367 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 110 transitions. [2025-03-08 04:55:44,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 04:55:44,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:55:44,368 INFO L218 NwaCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:55:44,374 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 04:55:44,569 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,SelfDestructingSolverStorable9 [2025-03-08 04:55:44,569 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:55:44,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:55:44,569 INFO L85 PathProgramCache]: Analyzing trace with hash 319729053, now seen corresponding path program 2 times [2025-03-08 04:55:44,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:55:44,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131993742] [2025-03-08 04:55:44,570 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:55:44,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:55:44,574 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 117 statements into 2 equivalence classes. [2025-03-08 04:55:44,603 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 04:55:44,603 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:55:44,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 04:55:44,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1182257065] [2025-03-08 04:55:44,604 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:55:44,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:55:44,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:55:44,607 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 04:55:44,608 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 04:55:44,635 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 117 statements into 2 equivalence classes. [2025-03-08 04:55:44,659 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 04:55:44,659 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:55:44,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:55:44,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 04:55:44,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:55:44,801 INFO L134 CoverageAnalysis]: Checked inductivity of 918 backedges. 86 proven. 52 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-08 04:55:44,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:55:44,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:55:44,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131993742] [2025-03-08 04:55:44,849 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 04:55:44,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182257065] [2025-03-08 04:55:44,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182257065] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:55:44,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 04:55:44,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-03-08 04:55:44,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574948869] [2025-03-08 04:55:44,850 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 04:55:44,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 04:55:44,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:55:44,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 04:55:44,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-08 04:55:44,851 INFO L87 Difference]: Start difference. First operand 93 states and 110 transitions. Second operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 6 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2025-03-08 04:55:45,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:55:45,051 INFO L93 Difference]: Finished difference Result 103 states and 118 transitions. [2025-03-08 04:55:45,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 04:55:45,051 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 6 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) Word has length 117 [2025-03-08 04:55:45,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:55:45,052 INFO L225 Difference]: With dead ends: 103 [2025-03-08 04:55:45,052 INFO L226 Difference]: Without dead ends: 95 [2025-03-08 04:55:45,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-08 04:55:45,053 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:55:45,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 205 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 04:55:45,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-08 04:55:45,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-08 04:55:45,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 53 states have internal predecessors, (54), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 04:55:45,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2025-03-08 04:55:45,069 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 117 [2025-03-08 04:55:45,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:55:45,069 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2025-03-08 04:55:45,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 6 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2025-03-08 04:55:45,069 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2025-03-08 04:55:45,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 04:55:45,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:55:45,070 INFO L218 NwaCegarLoop]: trace histogram [27, 26, 26, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:55:45,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 04:55:45,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:55:45,271 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:55:45,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:55:45,271 INFO L85 PathProgramCache]: Analyzing trace with hash 35108337, now seen corresponding path program 3 times [2025-03-08 04:55:45,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:55:45,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055743961] [2025-03-08 04:55:45,271 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:55:45,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:55:45,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 143 statements into 21 equivalence classes. [2025-03-08 04:55:45,341 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 04:55:45,341 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2025-03-08 04:55:45,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 04:55:45,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1550237386] [2025-03-08 04:55:45,342 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:55:45,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:55:45,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:55:45,346 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 04:55:45,350 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 04:55:45,372 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 143 statements into 21 equivalence classes. [2025-03-08 04:55:45,381 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 30 of 143 statements. [2025-03-08 04:55:45,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 04:55:45,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:55:45,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 04:55:45,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:55:45,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1412 backedges. 135 proven. 16 refuted. 0 times theorem prover too weak. 1261 trivial. 0 not checked. [2025-03-08 04:55:45,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:55:45,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1412 backedges. 135 proven. 16 refuted. 0 times theorem prover too weak. 1261 trivial. 0 not checked. [2025-03-08 04:55:45,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:55:45,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055743961] [2025-03-08 04:55:45,612 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 04:55:45,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550237386] [2025-03-08 04:55:45,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550237386] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:55:45,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:55:45,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2025-03-08 04:55:45,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317834131] [2025-03-08 04:55:45,612 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:55:45,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 04:55:45,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:55:45,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 04:55:45,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-08 04:55:45,613 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2025-03-08 04:55:45,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:55:45,756 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2025-03-08 04:55:45,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 04:55:45,756 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) Word has length 143 [2025-03-08 04:55:45,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:55:45,757 INFO L225 Difference]: With dead ends: 101 [2025-03-08 04:55:45,757 INFO L226 Difference]: Without dead ends: 97 [2025-03-08 04:55:45,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 272 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-08 04:55:45,757 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:55:45,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 152 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:55:45,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-08 04:55:45,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-08 04:55:45,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 28 states have call successors, (28), 15 states have call predecessors, (28), 14 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 04:55:45,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2025-03-08 04:55:45,773 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 143 [2025-03-08 04:55:45,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:55:45,773 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2025-03-08 04:55:45,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2025-03-08 04:55:45,773 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2025-03-08 04:55:45,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 04:55:45,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:55:45,774 INFO L218 NwaCegarLoop]: trace histogram [28, 27, 27, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:55:45,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 04:55:45,974 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,SelfDestructingSolverStorable11 [2025-03-08 04:55:45,975 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:55:45,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:55:45,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1789912203, now seen corresponding path program 2 times [2025-03-08 04:55:45,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:55:45,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291471202] [2025-03-08 04:55:45,975 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:55:45,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:55:45,981 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 148 statements into 2 equivalence classes. [2025-03-08 04:55:46,002 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 04:55:46,002 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:55:46,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 04:55:46,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1551952938] [2025-03-08 04:55:46,008 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:55:46,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:55:46,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:55:46,009 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 04:55:46,010 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 04:55:46,044 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 148 statements into 2 equivalence classes. [2025-03-08 04:55:46,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 04:55:46,083 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:55:46,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:55:46,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-08 04:55:46,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:55:46,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1518 backedges. 128 proven. 64 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2025-03-08 04:55:46,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:55:46,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1518 backedges. 128 proven. 28 refuted. 0 times theorem prover too weak. 1362 trivial. 0 not checked. [2025-03-08 04:55:46,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:55:46,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291471202] [2025-03-08 04:55:46,727 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 04:55:46,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551952938] [2025-03-08 04:55:46,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551952938] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:55:46,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:55:46,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 19 [2025-03-08 04:55:46,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804065918] [2025-03-08 04:55:46,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:55:46,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 04:55:46,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:55:46,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 04:55:46,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2025-03-08 04:55:46,729 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand has 19 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 16 states have internal predecessors, (26), 11 states have call successors, (41), 3 states have call predecessors, (41), 2 states have return successors, (39), 9 states have call predecessors, (39), 11 states have call successors, (39) [2025-03-08 04:55:47,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:55:47,143 INFO L93 Difference]: Finished difference Result 118 states and 136 transitions. [2025-03-08 04:55:47,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 04:55:47,143 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 16 states have internal predecessors, (26), 11 states have call successors, (41), 3 states have call predecessors, (41), 2 states have return successors, (39), 9 states have call predecessors, (39), 11 states have call successors, (39) Word has length 148 [2025-03-08 04:55:47,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:55:47,143 INFO L225 Difference]: With dead ends: 118 [2025-03-08 04:55:47,143 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 04:55:47,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 275 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2025-03-08 04:55:47,144 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 04:55:47,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 301 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 04:55:47,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 04:55:47,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 04:55:47,145 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 04:55:47,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 04:55:47,145 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 148 [2025-03-08 04:55:47,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:55:47,145 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 04:55:47,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 16 states have internal predecessors, (26), 11 states have call successors, (41), 3 states have call predecessors, (41), 2 states have return successors, (39), 9 states have call predecessors, (39), 11 states have call successors, (39) [2025-03-08 04:55:47,145 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 04:55:47,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 04:55:47,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 04:55:47,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-08 04:55:47,349 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,SelfDestructingSolverStorable12 [2025-03-08 04:55:47,351 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1] [2025-03-08 04:55:47,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 04:55:48,536 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 04:55:48,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:55:48 BoogieIcfgContainer [2025-03-08 04:55:48,554 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 04:55:48,554 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 04:55:48,554 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 04:55:48,554 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 04:55:48,555 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:54:40" (3/4) ... [2025-03-08 04:55:48,556 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 04:55:48,559 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-08 04:55:48,561 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-08 04:55:48,561 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 04:55:48,562 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 04:55:48,562 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 04:55:48,610 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 04:55:48,611 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 04:55:48,611 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 04:55:48,611 INFO L158 Benchmark]: Toolchain (without parser) took 68681.91ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 113.1MB in the beginning and 77.1MB in the end (delta: 36.0MB). Peak memory consumption was 68.9MB. Max. memory is 16.1GB. [2025-03-08 04:55:48,611 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 121.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:55:48,611 INFO L158 Benchmark]: CACSL2BoogieTranslator took 157.53ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 101.7MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:55:48,611 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.63ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 100.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:55:48,612 INFO L158 Benchmark]: Boogie Preprocessor took 26.07ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 99.4MB in the end (delta: 944.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:55:48,612 INFO L158 Benchmark]: IcfgBuilder took 221.28ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 86.3MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 04:55:48,612 INFO L158 Benchmark]: TraceAbstraction took 68190.18ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 85.9MB in the beginning and 83.5MB in the end (delta: 2.4MB). Peak memory consumption was 69.9MB. Max. memory is 16.1GB. [2025-03-08 04:55:48,612 INFO L158 Benchmark]: Witness Printer took 56.61ms. Allocated memory is still 176.2MB. Free memory was 83.5MB in the beginning and 77.1MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:55:48,613 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 121.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 157.53ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 101.7MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.63ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 100.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.07ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 99.4MB in the end (delta: 944.1kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 221.28ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 86.3MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 68190.18ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 85.9MB in the beginning and 83.5MB in the end (delta: 2.4MB). Peak memory consumption was 69.9MB. Max. memory is 16.1GB. * Witness Printer took 56.61ms. Allocated memory is still 176.2MB. Free memory was 83.5MB in the beginning and 77.1MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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 2 procedures, 26 locations, 50 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 66.9s, OverallIterations: 13, TraceHistogramMax: 28, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 30.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 112 SdHoareTripleChecker+Valid, 26.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 68 mSDsluCounter, 1812 SdHoareTripleChecker+Invalid, 26.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1461 mSDsCounter, 285 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1910 IncrementalHoareTripleChecker+Invalid, 2198 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 285 mSolverCounterUnsat, 351 mSDtfsCounter, 1910 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1367 GetRequests, 1225 SyntacticMatches, 4 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 27.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=9, InterpolantAutomatonStates: 103, 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, 13 MinimizatonAttempts, 38 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 32.8s InterpolantComputationTime, 1526 NumberOfCodeBlocks, 1367 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 1335 ConstructedInterpolants, 0 QuantifiedInterpolants, 4578 SizeOfPredicates, 35 NumberOfNonLiveVariables, 1499 ConjunctsInSsa, 244 ConjunctsInUnsatCore, 20 InterpolantComputations, 5 PerfectInterpolantSequences, 8677/8944 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: 33]: Location Invariant Derived location invariant: ((((y == ((((__int128) 3 * n) + (3 * ((__int128) n * n))) + 1)) && (z == (6 + ((__int128) 6 * n)))) && ((n < (a + 1)) || (((((__int128) 2 * y) + (6 * a)) + 10) == (((__int128) a * z) + ((__int128) 2 * z))))) && ((((((__int128) 3 * n) + (3 * ((__int128) n * n))) + (((__int128) n * n) * n)) + 1) == ((__int128) x + y))) RESULT: Ultimate proved your program to be correct! [2025-03-08 04:55:48,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE