./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/nested3-2.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/loops-crafted-1/nested3-2.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 0397e1839c0d761fe403b06501425acc9e7bddc9f103e53ae177509d148aabf4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:48:43,090 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:48:43,143 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:48:43,149 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:48:43,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:48:43,171 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:48:43,172 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:48:43,172 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:48:43,173 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:48:43,173 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:48:43,174 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:48:43,174 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:48:43,174 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:48:43,174 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:48:43,175 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:48:43,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:48:43,175 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:48:43,175 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:48:43,175 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:48:43,175 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:48:43,175 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:48:43,175 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:48:43,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:48:43,176 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:48:43,176 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:48:43,176 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:48:43,176 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:48:43,176 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:48:43,176 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:48:43,176 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:48:43,176 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:48:43,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:48:43,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:48:43,177 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:48:43,177 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:48:43,177 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:48:43,177 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:48:43,177 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:48:43,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:48:43,177 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:48:43,177 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:48:43,177 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:48:43,177 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:48:43,178 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 -> 0397e1839c0d761fe403b06501425acc9e7bddc9f103e53ae177509d148aabf4 [2025-03-08 04:48:43,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:48:43,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:48:43,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:48:43,432 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:48:43,433 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:48:43,434 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/nested3-2.c [2025-03-08 04:48:44,558 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29bd36487/6219a7d843f04ead84951325f2c1fcb2/FLAGfe53d7d0a [2025-03-08 04:48:44,751 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:48:44,751 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/nested3-2.c [2025-03-08 04:48:44,756 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29bd36487/6219a7d843f04ead84951325f2c1fcb2/FLAGfe53d7d0a [2025-03-08 04:48:45,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29bd36487/6219a7d843f04ead84951325f2c1fcb2 [2025-03-08 04:48:45,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:48:45,118 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:48:45,119 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:48:45,119 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:48:45,122 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:48:45,122 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:48:45" (1/1) ... [2025-03-08 04:48:45,123 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b45938f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:48:45, skipping insertion in model container [2025-03-08 04:48:45,123 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:48:45" (1/1) ... [2025-03-08 04:48:45,131 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:48:45,215 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/loops-crafted-1/nested3-2.c[321,334] [2025-03-08 04:48:45,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:48:45,236 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:48:45,243 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/loops-crafted-1/nested3-2.c[321,334] [2025-03-08 04:48:45,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:48:45,255 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:48:45,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:48:45 WrapperNode [2025-03-08 04:48:45,256 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:48:45,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:48:45,258 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:48:45,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:48:45,262 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:48:45" (1/1) ... [2025-03-08 04:48:45,266 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:48:45" (1/1) ... [2025-03-08 04:48:45,275 INFO L138 Inliner]: procedures = 12, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2025-03-08 04:48:45,276 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:48:45,276 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:48:45,276 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:48:45,276 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:48:45,281 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:48:45" (1/1) ... [2025-03-08 04:48:45,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:48:45" (1/1) ... [2025-03-08 04:48:45,285 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:48:45" (1/1) ... [2025-03-08 04:48:45,291 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:48:45,293 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:48:45" (1/1) ... [2025-03-08 04:48:45,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:48:45" (1/1) ... [2025-03-08 04:48:45,297 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:48:45" (1/1) ... [2025-03-08 04:48:45,297 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:48:45" (1/1) ... [2025-03-08 04:48:45,298 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:48:45" (1/1) ... [2025-03-08 04:48:45,298 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:48:45" (1/1) ... [2025-03-08 04:48:45,299 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:48:45,299 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:48:45,299 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:48:45,301 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:48:45,302 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:48:45" (1/1) ... [2025-03-08 04:48:45,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:48:45,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:48:45,327 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:48:45,330 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:48:45,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:48:45,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:48:45,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:48:45,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:48:45,349 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 04:48:45,349 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 04:48:45,384 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:48:45,386 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:48:45,478 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-03-08 04:48:45,478 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:48:45,484 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:48:45,484 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:48:45,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:48:45 BoogieIcfgContainer [2025-03-08 04:48:45,484 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:48:45,486 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:48:45,486 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:48:45,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:48:45,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:48:45" (1/3) ... [2025-03-08 04:48:45,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13fb487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:48:45, skipping insertion in model container [2025-03-08 04:48:45,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:48:45" (2/3) ... [2025-03-08 04:48:45,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13fb487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:48:45, skipping insertion in model container [2025-03-08 04:48:45,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:48:45" (3/3) ... [2025-03-08 04:48:45,490 INFO L128 eAbstractionObserver]: Analyzing ICFG nested3-2.c [2025-03-08 04:48:45,500 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:48:45,502 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nested3-2.c that has 2 procedures, 20 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-08 04:48:45,538 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:48:45,544 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;@9abada8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:48:45,544 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 04:48:45,547 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 04:48:45,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 04:48:45,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:48:45,552 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:48:45,552 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:48:45,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:48:45,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1710983766, now seen corresponding path program 1 times [2025-03-08 04:48:45,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:48:45,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390593521] [2025-03-08 04:48:45,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:48:45,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:48:45,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 04:48:45,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 04:48:45,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:48:45,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:48:45,732 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:48:45,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:48:45,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390593521] [2025-03-08 04:48:45,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390593521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:48:45,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:48:45,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:48:45,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632111814] [2025-03-08 04:48:45,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:48:45,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:48:45,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:48:45,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:48:45,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:48:45,750 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:48:45,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:48:45,769 INFO L93 Difference]: Finished difference Result 45 states and 65 transitions. [2025-03-08 04:48:45,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:48:45,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2025-03-08 04:48:45,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:48:45,774 INFO L225 Difference]: With dead ends: 45 [2025-03-08 04:48:45,774 INFO L226 Difference]: Without dead ends: 23 [2025-03-08 04:48:45,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:48:45,777 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:48:45,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 41 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:48:45,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-08 04:48:45,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2025-03-08 04:48:45,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 04:48:45,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2025-03-08 04:48:45,798 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 7 [2025-03-08 04:48:45,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:48:45,798 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-03-08 04:48:45,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:48:45,799 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2025-03-08 04:48:45,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 04:48:45,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:48:45,799 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:48:45,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 04:48:45,799 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:48:45,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:48:45,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1540479462, now seen corresponding path program 1 times [2025-03-08 04:48:45,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:48:45,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050028102] [2025-03-08 04:48:45,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:48:45,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:48:45,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 04:48:45,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 04:48:45,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:48:45,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:48:45,878 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:48:45,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:48:45,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050028102] [2025-03-08 04:48:45,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050028102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:48:45,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:48:45,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:48:45,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040886429] [2025-03-08 04:48:45,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:48:45,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:48:45,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:48:45,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:48:45,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:48:45,880 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:48:45,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:48:45,892 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2025-03-08 04:48:45,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:48:45,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:48:45,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:48:45,893 INFO L225 Difference]: With dead ends: 35 [2025-03-08 04:48:45,893 INFO L226 Difference]: Without dead ends: 21 [2025-03-08 04:48:45,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:48:45,893 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:48:45,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 34 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:48:45,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-08 04:48:45,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2025-03-08 04:48:45,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 04:48:45,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-08 04:48:45,896 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 8 [2025-03-08 04:48:45,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:48:45,896 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-08 04:48:45,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:48:45,897 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-08 04:48:45,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 04:48:45,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:48:45,897 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:48:45,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 04:48:45,897 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:48:45,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:48:45,898 INFO L85 PathProgramCache]: Analyzing trace with hash -553447836, now seen corresponding path program 1 times [2025-03-08 04:48:45,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:48:45,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731317228] [2025-03-08 04:48:45,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:48:45,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:48:45,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 04:48:45,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 04:48:45,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:48:45,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:48:45,948 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:48:45,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:48:45,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731317228] [2025-03-08 04:48:45,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731317228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:48:45,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:48:45,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:48:45,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286280644] [2025-03-08 04:48:45,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:48:45,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:48:45,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:48:45,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:48:45,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:48:45,950 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:48:45,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:48:45,955 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2025-03-08 04:48:45,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:48:45,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-08 04:48:45,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:48:45,956 INFO L225 Difference]: With dead ends: 34 [2025-03-08 04:48:45,956 INFO L226 Difference]: Without dead ends: 19 [2025-03-08 04:48:45,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:48:45,957 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:48:45,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:48:45,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-08 04:48:45,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-08 04:48:45,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 04:48:45,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-03-08 04:48:45,960 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 9 [2025-03-08 04:48:45,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:48:45,961 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-03-08 04:48:45,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:48:45,961 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-03-08 04:48:45,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 04:48:45,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:48:45,961 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:48:45,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 04:48:45,961 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:48:45,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:48:45,961 INFO L85 PathProgramCache]: Analyzing trace with hash -22085544, now seen corresponding path program 1 times [2025-03-08 04:48:45,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:48:45,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489038886] [2025-03-08 04:48:45,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:48:45,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:48:45,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 04:48:45,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 04:48:45,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:48:45,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:48:46,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:48:46,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:48:46,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489038886] [2025-03-08 04:48:46,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489038886] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:48:46,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041269813] [2025-03-08 04:48:46,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:48:46,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:48:46,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:48:46,062 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:48:46,064 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:48:46,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 04:48:46,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 04:48:46,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:48:46,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:48:46,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 04:48:46,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:48:46,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:48:46,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:48:46,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:48:46,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041269813] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:48:46,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:48:46,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 04:48:46,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476024162] [2025-03-08 04:48:46,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:48:46,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 04:48:46,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:48:46,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 04:48:46,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:48:46,155 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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:48:46,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:48:46,192 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2025-03-08 04:48:46,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 04:48:46,194 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 04:48:46,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:48:46,194 INFO L225 Difference]: With dead ends: 38 [2025-03-08 04:48:46,194 INFO L226 Difference]: Without dead ends: 22 [2025-03-08 04:48:46,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2025-03-08 04:48:46,196 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:48:46,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:48:46,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-08 04:48:46,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-08 04:48:46,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 04:48:46,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-03-08 04:48:46,203 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 10 [2025-03-08 04:48:46,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:48:46,204 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-03-08 04:48:46,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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:48:46,204 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-03-08 04:48:46,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 04:48:46,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:48:46,205 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:48:46,211 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:48:46,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:48:46,405 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:48:46,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:48:46,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1667885924, now seen corresponding path program 2 times [2025-03-08 04:48:46,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:48:46,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371634853] [2025-03-08 04:48:46,407 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:48:46,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:48:46,413 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-08 04:48:46,425 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 04:48:46,425 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:48:46,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:48:46,576 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:48:46,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:48:46,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371634853] [2025-03-08 04:48:46,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371634853] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:48:46,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21554668] [2025-03-08 04:48:46,576 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:48:46,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:48:46,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:48:46,579 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:48:46,580 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:48:46,604 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-08 04:48:46,613 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 04:48:46,614 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:48:46,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:48:46,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 04:48:46,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:48:46,632 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:48:46,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:48:46,718 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:48:46,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21554668] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:48:46,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:48:46,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2025-03-08 04:48:46,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909850519] [2025-03-08 04:48:46,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:48:46,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 04:48:46,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:48:46,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 04:48:46,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-03-08 04:48:46,721 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:48:46,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:48:46,871 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2025-03-08 04:48:46,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 04:48:46,872 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-08 04:48:46,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:48:46,873 INFO L225 Difference]: With dead ends: 47 [2025-03-08 04:48:46,873 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 04:48:46,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 04:48:46,875 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:48:46,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:48:46,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 04:48:46,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-08 04:48:46,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 04:48:46,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-03-08 04:48:46,881 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 13 [2025-03-08 04:48:46,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:48:46,881 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-03-08 04:48:46,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:48:46,881 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2025-03-08 04:48:46,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 04:48:46,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:48:46,882 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:48:46,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 04:48:47,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:48:47,086 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:48:47,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:48:47,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1145960732, now seen corresponding path program 3 times [2025-03-08 04:48:47,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:48:47,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143527739] [2025-03-08 04:48:47,086 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:48:47,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:48:47,094 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 6 equivalence classes. [2025-03-08 04:48:47,105 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 04:48:47,105 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-08 04:48:47,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:48:47,253 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:48:47,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:48:47,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143527739] [2025-03-08 04:48:47,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143527739] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:48:47,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651112778] [2025-03-08 04:48:47,254 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:48:47,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:48:47,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:48:47,255 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:48:47,257 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:48:47,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 6 equivalence classes. [2025-03-08 04:48:47,287 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 04:48:47,288 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-08 04:48:47,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:48:47,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 04:48:47,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:48:47,317 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:48:47,317 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:48:47,556 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:48:47,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651112778] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:48:47,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:48:47,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-08 04:48:47,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137857884] [2025-03-08 04:48:47,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:48:47,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 04:48:47,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:48:47,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 04:48:47,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2025-03-08 04:48:47,560 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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:48:49,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:48:49,740 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2025-03-08 04:48:49,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 04:48:49,740 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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 19 [2025-03-08 04:48:49,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:48:49,741 INFO L225 Difference]: With dead ends: 65 [2025-03-08 04:48:49,741 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 04:48:49,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=440, Invalid=750, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 04:48:49,742 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:48:49,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:48:49,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 04:48:49,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-08 04:48:49,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 04:48:49,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2025-03-08 04:48:49,747 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 19 [2025-03-08 04:48:49,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:48:49,747 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2025-03-08 04:48:49,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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:48:49,747 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2025-03-08 04:48:49,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 04:48:49,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:48:49,747 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:48:49,753 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:48:49,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:48:49,948 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:48:49,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:48:49,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1194172956, now seen corresponding path program 4 times [2025-03-08 04:48:49,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:48:49,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697640254] [2025-03-08 04:48:49,949 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 04:48:49,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:48:49,961 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-08 04:48:49,972 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 04:48:49,975 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 04:48:49,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:48:50,532 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:48:50,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:48:50,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697640254] [2025-03-08 04:48:50,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697640254] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:48:50,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777035627] [2025-03-08 04:48:50,533 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 04:48:50,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:48:50,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:48:50,535 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:48:50,536 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:48:50,557 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-08 04:48:50,577 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 04:48:50,577 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 04:48:50,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:48:50,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-08 04:48:50,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:48:50,635 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:48:50,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:48:51,509 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:48:51,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777035627] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:48:51,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:48:51,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25, 25] total 52 [2025-03-08 04:48:51,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197570390] [2025-03-08 04:48:51,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:48:51,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-08 04:48:51,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:48:51,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-08 04:48:51,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=660, Invalid=1992, Unknown=0, NotChecked=0, Total=2652 [2025-03-08 04:48:51,511 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 52 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 51 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:50:03,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:50:03,538 INFO L93 Difference]: Finished difference Result 101 states and 133 transitions. [2025-03-08 04:50:03,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-08 04:50:03,539 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 51 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-08 04:50:03,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:50:03,540 INFO L225 Difference]: With dead ends: 101 [2025-03-08 04:50:03,540 INFO L226 Difference]: Without dead ends: 64 [2025-03-08 04:50:03,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 72.8s TimeCoverageRelationStatistics Valid=1716, Invalid=3686, Unknown=0, NotChecked=0, Total=5402 [2025-03-08 04:50:03,545 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:50:03,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 458 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 04:50:03,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-08 04:50:03,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-08 04:50:03,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 60 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 04:50:03,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2025-03-08 04:50:03,556 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 31 [2025-03-08 04:50:03,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:50:03,556 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2025-03-08 04:50:03,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 51 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:50:03,556 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2025-03-08 04:50:03,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 04:50:03,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:50:03,557 INFO L218 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:50:03,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 04:50:03,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:50:03,758 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:50:03,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:50:03,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1804366876, now seen corresponding path program 5 times [2025-03-08 04:50:03,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:50:03,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604522468] [2025-03-08 04:50:03,758 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 04:50:03,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:50:03,769 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 24 equivalence classes. [2025-03-08 04:50:03,789 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 04:50:03,790 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-03-08 04:50:03,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:50:04,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:50:04,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:50:04,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604522468] [2025-03-08 04:50:04,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604522468] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:50:04,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597377201] [2025-03-08 04:50:04,887 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 04:50:04,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:50:04,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:50:04,889 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:50:04,889 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:50:04,913 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 24 equivalence classes. [2025-03-08 04:50:05,916 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 04:50:05,917 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-03-08 04:50:05,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:50:05,918 WARN L254 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-03-08 04:50:05,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:50:06,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:50:06,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:50:08,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:50:08,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597377201] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:50:08,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:50:08,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2025-03-08 04:50:08,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768524531] [2025-03-08 04:50:08,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:50:08,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2025-03-08 04:50:08,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:50:08,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2025-03-08 04:50:08,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2494, Invalid=6818, Unknown=0, NotChecked=0, Total=9312 [2025-03-08 04:50:08,563 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 97 states, 97 states have (on average 1.0721649484536082) internal successors, (104), 97 states have internal predecessors, (104), 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:50:20,686 WARN L286 SmtUtils]: Spent 11.28s on a formula simplification. DAG size of input: 190 DAG size of output: 10 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)