./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound100.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/divbin_valuebound100.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 918183af41ed822b080517d21adc4e88771d95d1ab967de55d618cd7a5912a2d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:49:24,972 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:49:25,022 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:49:25,026 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:49:25,026 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:49:25,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:49:25,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:49:25,050 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:49:25,050 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:49:25,050 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:49:25,050 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:49:25,050 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:49:25,050 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:49:25,050 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:49:25,050 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:49:25,051 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:49:25,051 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:49:25,051 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:49:25,051 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:49:25,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:49:25,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:49:25,051 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:49:25,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:49:25,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:49:25,051 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:49:25,051 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:49:25,051 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:49:25,051 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:49:25,051 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:49:25,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:49:25,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:49:25,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:49:25,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:49:25,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:49:25,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:49:25,052 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:49:25,052 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:49:25,052 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:49:25,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:49:25,052 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:49:25,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:49:25,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:49:25,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:49:25,052 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 -> 918183af41ed822b080517d21adc4e88771d95d1ab967de55d618cd7a5912a2d [2025-03-03 13:49:25,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:49:25,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:49:25,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:49:25,274 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:49:25,274 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:49:25,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound100.i [2025-03-03 13:49:26,351 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/408cf32fc/eb2a0c006e20458dbc8e0eff8446ad5e/FLAG5f5ca585f [2025-03-03 13:49:26,550 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:49:26,550 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound100.i [2025-03-03 13:49:26,555 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/408cf32fc/eb2a0c006e20458dbc8e0eff8446ad5e/FLAG5f5ca585f [2025-03-03 13:49:26,931 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/408cf32fc/eb2a0c006e20458dbc8e0eff8446ad5e [2025-03-03 13:49:26,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:49:26,933 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:49:26,934 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:49:26,934 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:49:26,937 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:49:26,937 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:49:26" (1/1) ... [2025-03-03 13:49:26,938 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58d265d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:49:26, skipping insertion in model container [2025-03-03 13:49:26,938 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:49:26" (1/1) ... [2025-03-03 13:49:26,948 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:49:27,058 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/divbin_valuebound100.i[950,963] [2025-03-03 13:49:27,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:49:27,078 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:49:27,087 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/divbin_valuebound100.i[950,963] [2025-03-03 13:49:27,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:49:27,105 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:49:27,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:49:27 WrapperNode [2025-03-03 13:49:27,106 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:49:27,107 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:49:27,107 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:49:27,107 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:49:27,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:49:27" (1/1) ... [2025-03-03 13:49:27,116 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:49:27" (1/1) ... [2025-03-03 13:49:27,127 INFO L138 Inliner]: procedures = 16, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2025-03-03 13:49:27,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:49:27,127 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:49:27,128 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:49:27,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:49:27,132 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:49:27" (1/1) ... [2025-03-03 13:49:27,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:49:27" (1/1) ... [2025-03-03 13:49:27,137 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:49:27" (1/1) ... [2025-03-03 13:49:27,144 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-03 13:49:27,145 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:49:27" (1/1) ... [2025-03-03 13:49:27,145 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:49:27" (1/1) ... [2025-03-03 13:49:27,146 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:49:27" (1/1) ... [2025-03-03 13:49:27,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:49:27" (1/1) ... [2025-03-03 13:49:27,151 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:49:27" (1/1) ... [2025-03-03 13:49:27,152 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:49:27" (1/1) ... [2025-03-03 13:49:27,152 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:49:27,153 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:49:27,153 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:49:27,153 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:49:27,154 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:49:27" (1/1) ... [2025-03-03 13:49:27,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:49:27,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:49:27,181 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-03 13:49:27,187 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-03 13:49:27,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:49:27,202 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 13:49:27,202 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 13:49:27,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:49:27,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:49:27,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:49:27,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 13:49:27,202 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 13:49:27,246 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:49:27,247 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:49:27,368 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-03 13:49:27,368 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:49:27,374 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:49:27,374 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:49:27,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:49:27 BoogieIcfgContainer [2025-03-03 13:49:27,375 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:49:27,376 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:49:27,376 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:49:27,380 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:49:27,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:49:26" (1/3) ... [2025-03-03 13:49:27,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f74760d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:49:27, skipping insertion in model container [2025-03-03 13:49:27,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:49:27" (2/3) ... [2025-03-03 13:49:27,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f74760d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:49:27, skipping insertion in model container [2025-03-03 13:49:27,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:49:27" (3/3) ... [2025-03-03 13:49:27,383 INFO L128 eAbstractionObserver]: Analyzing ICFG divbin_valuebound100.i [2025-03-03 13:49:27,393 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:49:27,394 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG divbin_valuebound100.i that has 3 procedures, 27 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 13:49:27,424 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:49:27,433 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;@badb82a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:49:27,435 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:49:27,437 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 13:49:27,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 13:49:27,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:49:27,443 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:49:27,444 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:49:27,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:49:27,448 INFO L85 PathProgramCache]: Analyzing trace with hash -162508135, now seen corresponding path program 1 times [2025-03-03 13:49:27,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:49:27,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898983886] [2025-03-03 13:49:27,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:49:27,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:49:27,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-03 13:49:27,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 13:49:27,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:49:27,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:49:27,565 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 13:49:27,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:49:27,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898983886] [2025-03-03 13:49:27,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898983886] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:49:27,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187511148] [2025-03-03 13:49:27,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:49:27,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:49:27,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:49:27,569 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-03 13:49:27,571 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-03 13:49:27,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-03 13:49:27,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 13:49:27,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:49:27,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:49:27,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 13:49:27,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:49:27,638 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 13:49:27,638 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:49:27,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187511148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:49:27,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:49:27,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 13:49:27,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034198642] [2025-03-03 13:49:27,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:49:27,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 13:49:27,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:49:27,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 13:49:27,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:49:27,659 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 13:49:27,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:49:27,670 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2025-03-03 13:49:27,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 13:49:27,672 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2025-03-03 13:49:27,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:49:27,675 INFO L225 Difference]: With dead ends: 51 [2025-03-03 13:49:27,676 INFO L226 Difference]: Without dead ends: 23 [2025-03-03 13:49:27,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 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-03 13:49:27,679 INFO L435 NwaCegarLoop]: 33 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, 33 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-03 13:49:27,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:49:27,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-03 13:49:27,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-03 13:49:27,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 13:49:27,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2025-03-03 13:49:27,700 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 29 [2025-03-03 13:49:27,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:49:27,700 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2025-03-03 13:49:27,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 13:49:27,701 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2025-03-03 13:49:27,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 13:49:27,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:49:27,702 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:49:27,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 13:49:27,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 13:49:27,906 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:49:27,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:49:27,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1105005704, now seen corresponding path program 1 times [2025-03-03 13:49:27,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:49:27,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898367437] [2025-03-03 13:49:27,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:49:27,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:49:27,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-03 13:49:27,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 13:49:27,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:49:27,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:49:27,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1446579756] [2025-03-03 13:49:27,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:49:27,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:49:27,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:49:27,958 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-03 13:49:27,960 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-03 13:49:27,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-03 13:49:28,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 13:49:28,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:49:28,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:49:28,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 13:49:28,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:49:28,300 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 13:49:28,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:49:28,545 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 13:49:28,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:49:28,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898367437] [2025-03-03 13:49:28,547 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:49:28,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446579756] [2025-03-03 13:49:28,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446579756] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 13:49:28,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:49:28,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2025-03-03 13:49:28,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365071243] [2025-03-03 13:49:28,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:49:28,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:49:28,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:49:28,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:49:28,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-03 13:49:28,549 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 13:49:28,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:49:28,877 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2025-03-03 13:49:28,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:49:28,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2025-03-03 13:49:28,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:49:28,878 INFO L225 Difference]: With dead ends: 33 [2025-03-03 13:49:28,878 INFO L226 Difference]: Without dead ends: 30 [2025-03-03 13:49:28,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:49:28,878 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:49:28,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 83 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:49:28,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-03 13:49:28,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-03 13:49:28,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 13:49:28,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2025-03-03 13:49:28,887 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 29 [2025-03-03 13:49:28,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:49:28,888 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2025-03-03 13:49:28,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 13:49:28,889 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2025-03-03 13:49:28,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 13:49:28,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:49:28,891 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:49:28,897 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-03 13:49:29,096 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,SelfDestructingSolverStorable1 [2025-03-03 13:49:29,096 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:49:29,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:49:29,097 INFO L85 PathProgramCache]: Analyzing trace with hash 138852969, now seen corresponding path program 1 times [2025-03-03 13:49:29,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:49:29,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901691512] [2025-03-03 13:49:29,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:49:29,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:49:29,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-03 13:49:29,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 13:49:29,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:49:29,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:49:29,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1757856019] [2025-03-03 13:49:29,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:49:29,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:49:29,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:49:29,133 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-03 13:49:29,134 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-03 13:49:29,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-03 13:49:29,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 13:49:29,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:49:29,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:49:29,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 13:49:29,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:49:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 13:49:29,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:49:29,341 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 13:49:29,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:49:29,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901691512] [2025-03-03 13:49:29,343 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:49:29,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757856019] [2025-03-03 13:49:29,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757856019] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 13:49:29,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:49:29,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2025-03-03 13:49:29,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337257334] [2025-03-03 13:49:29,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:49:29,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:49:29,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:49:29,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:49:29,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 13:49:29,345 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 13:49:33,378 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 [1] [2025-03-03 13:49:37,402 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 [1] [2025-03-03 13:49:37,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:49:37,411 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2025-03-03 13:49:37,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:49:37,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 30 [2025-03-03 13:49:37,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:49:37,412 INFO L225 Difference]: With dead ends: 39 [2025-03-03 13:49:37,412 INFO L226 Difference]: Without dead ends: 37 [2025-03-03 13:49:37,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 13:49:37,413 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:49:37,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 87 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 2 Unknown, 0 Unchecked, 8.0s Time] [2025-03-03 13:49:37,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-03 13:49:37,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2025-03-03 13:49:37,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 24 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 13:49:37,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2025-03-03 13:49:37,418 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 30 [2025-03-03 13:49:37,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:49:37,419 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-03-03 13:49:37,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 13:49:37,419 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2025-03-03 13:49:37,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 13:49:37,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:49:37,420 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:49:37,425 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-03 13:49:37,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:49:37,620 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:49:37,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:49:37,621 INFO L85 PathProgramCache]: Analyzing trace with hash 960799810, now seen corresponding path program 1 times [2025-03-03 13:49:37,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:49:37,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807144510] [2025-03-03 13:49:37,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:49:37,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:49:37,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 13:49:37,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 13:49:37,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:49:37,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:49:37,997 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 13:49:37,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:49:37,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807144510] [2025-03-03 13:49:37,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807144510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:49:37,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:49:37,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:49:37,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502483474] [2025-03-03 13:49:37,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:49:37,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:49:37,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:49:37,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:49:37,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:49:37,999 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 13:49:38,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:49:38,031 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2025-03-03 13:49:38,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 13:49:38,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2025-03-03 13:49:38,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:49:38,034 INFO L225 Difference]: With dead ends: 45 [2025-03-03 13:49:38,035 INFO L226 Difference]: Without dead ends: 29 [2025-03-03 13:49:38,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:49:38,035 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:49:38,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:49:38,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-03 13:49:38,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-03 13:49:38,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 13:49:38,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2025-03-03 13:49:38,045 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 36 [2025-03-03 13:49:38,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:49:38,045 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-03-03 13:49:38,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 13:49:38,045 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2025-03-03 13:49:38,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 13:49:38,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:49:38,047 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:49:38,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 13:49:38,047 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:49:38,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:49:38,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1279514807, now seen corresponding path program 1 times [2025-03-03 13:49:38,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:49:38,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773295043] [2025-03-03 13:49:38,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:49:38,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:49:38,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 13:49:38,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 13:49:38,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:49:38,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:49:38,204 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 13:49:38,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:49:38,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773295043] [2025-03-03 13:49:38,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773295043] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:49:38,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117940275] [2025-03-03 13:49:38,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:49:38,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:49:38,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:49:38,207 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-03 13:49:38,208 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-03 13:49:38,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 13:49:38,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 13:49:38,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:49:38,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:49:38,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 13:49:38,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:49:38,313 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 13:49:38,313 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:49:38,385 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 13:49:38,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117940275] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:49:38,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:49:38,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 12 [2025-03-03 13:49:38,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118448512] [2025-03-03 13:49:38,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:49:38,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 13:49:38,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:49:38,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 13:49:38,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-03 13:49:38,387 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 13:49:38,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:49:38,627 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2025-03-03 13:49:38,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 13:49:38,627 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 36 [2025-03-03 13:49:38,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:49:38,628 INFO L225 Difference]: With dead ends: 43 [2025-03-03 13:49:38,628 INFO L226 Difference]: Without dead ends: 31 [2025-03-03 13:49:38,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-03 13:49:38,628 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:49:38,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 197 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:49:38,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-03 13:49:38,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2025-03-03 13:49:38,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 13:49:38,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2025-03-03 13:49:38,633 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 36 [2025-03-03 13:49:38,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:49:38,634 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2025-03-03 13:49:38,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 13:49:38,634 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2025-03-03 13:49:38,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 13:49:38,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:49:38,634 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:49:38,640 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-03 13:49:38,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:49:38,839 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:49:38,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:49:38,839 INFO L85 PathProgramCache]: Analyzing trace with hash -982426575, now seen corresponding path program 1 times [2025-03-03 13:49:38,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:49:38,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545950303] [2025-03-03 13:49:38,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:49:38,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:49:38,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 13:49:38,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 13:49:38,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:49:38,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:49:38,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [968250224] [2025-03-03 13:49:38,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:49:38,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:49:38,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:49:38,857 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-03 13:49:38,858 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-03 13:49:38,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 13:49:38,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 13:49:38,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:49:38,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:49:38,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 13:49:38,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:49:39,071 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 13:49:39,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:49:39,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:49:39,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545950303] [2025-03-03 13:49:39,215 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:49:39,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968250224] [2025-03-03 13:49:39,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968250224] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:49:39,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:49:39,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-03-03 13:49:39,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011540553] [2025-03-03 13:49:39,215 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 13:49:39,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 13:49:39,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:49:39,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 13:49:39,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-03 13:49:39,217 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 13:49:39,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:49:39,326 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2025-03-03 13:49:39,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 13:49:39,326 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2025-03-03 13:49:39,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:49:39,327 INFO L225 Difference]: With dead ends: 40 [2025-03-03 13:49:39,327 INFO L226 Difference]: Without dead ends: 38 [2025-03-03 13:49:39,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:49:39,328 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 9 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:49:39,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 102 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:49:39,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-03 13:49:39,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-03-03 13:49:39,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 13:49:39,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2025-03-03 13:49:39,333 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 37 [2025-03-03 13:49:39,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:49:39,333 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2025-03-03 13:49:39,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 13:49:39,333 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2025-03-03 13:49:39,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 13:49:39,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:49:39,334 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:49:39,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 13:49:39,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:49:39,535 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:49:39,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:49:39,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1976915607, now seen corresponding path program 2 times [2025-03-03 13:49:39,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:49:39,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294358183] [2025-03-03 13:49:39,535 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:49:39,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:49:39,540 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-03 13:49:39,572 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 13:49:39,573 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:49:39,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:49:40,039 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 13:49:40,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:49:40,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294358183] [2025-03-03 13:49:40,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294358183] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:49:40,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348251417] [2025-03-03 13:49:40,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:49:40,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:49:40,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:49:40,042 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-03 13:49:40,042 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-03 13:49:40,061 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-03 13:49:40,106 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 13:49:40,106 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:49:40,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:49:40,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-03 13:49:40,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:49:40,444 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 13:49:40,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:49:41,052 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 13:49:41,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348251417] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:49:41,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:49:41,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2025-03-03 13:49:41,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418978507] [2025-03-03 13:49:41,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:49:41,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 13:49:41,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:49:41,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 13:49:41,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2025-03-03 13:49:41,054 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 24 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 19 states have internal predecessors, (38), 11 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (16), 11 states have call predecessors, (16), 10 states have call successors, (16) [2025-03-03 13:49:41,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:49:41,893 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2025-03-03 13:49:41,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 13:49:41,893 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 19 states have internal predecessors, (38), 11 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (16), 11 states have call predecessors, (16), 10 states have call successors, (16) Word has length 44 [2025-03-03 13:49:41,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:49:41,894 INFO L225 Difference]: With dead ends: 63 [2025-03-03 13:49:41,894 INFO L226 Difference]: Without dead ends: 41 [2025-03-03 13:49:41,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=166, Invalid=704, Unknown=0, NotChecked=0, Total=870 [2025-03-03 13:49:41,895 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 16 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 13:49:41,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 245 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 13:49:41,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-03 13:49:41,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2025-03-03 13:49:41,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 26 states have internal predecessors, (28), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 13:49:41,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2025-03-03 13:49:41,901 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 44 [2025-03-03 13:49:41,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:49:41,901 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2025-03-03 13:49:41,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 19 states have internal predecessors, (38), 11 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (16), 11 states have call predecessors, (16), 10 states have call successors, (16) [2025-03-03 13:49:41,901 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2025-03-03 13:49:41,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 13:49:41,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:49:41,902 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:49:41,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 13:49:42,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:49:42,102 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:49:42,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:49:42,103 INFO L85 PathProgramCache]: Analyzing trace with hash -2121006504, now seen corresponding path program 3 times [2025-03-03 13:49:42,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:49:42,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174607188] [2025-03-03 13:49:42,103 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:49:42,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:49:42,106 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 4 equivalence classes. [2025-03-03 13:49:42,164 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 13:49:42,164 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 13:49:42,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:49:42,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1197704389] [2025-03-03 13:49:42,167 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:49:42,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:49:42,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:49:42,169 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-03 13:49:42,171 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-03 13:49:42,190 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 4 equivalence classes. [2025-03-03 13:49:42,348 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 39 of 45 statements. [2025-03-03 13:49:42,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 13:49:42,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:49:42,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-03 13:49:42,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:49:44,418 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 13:49:44,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:49:55,029 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 13:49:55,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:49:55,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174607188] [2025-03-03 13:49:55,030 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:49:55,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197704389] [2025-03-03 13:49:55,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197704389] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:49:55,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:49:55,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 24 [2025-03-03 13:49:55,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050132762] [2025-03-03 13:49:55,030 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:49:55,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 13:49:55,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:49:55,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 13:49:55,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2025-03-03 13:49:55,034 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 8 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12)