./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound20.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 cc20d196113d3ae541f6b6d9413b3adf505f83f475b90cd277ec788090ea4b3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 18:05:55,986 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 18:05:56,040 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 18:05:56,044 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 18:05:56,044 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 18:05:56,060 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 18:05:56,061 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 18:05:56,061 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 18:05:56,062 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 18:05:56,062 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 18:05:56,062 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 18:05:56,062 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 18:05:56,062 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 18:05:56,063 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 18:05:56,063 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 18:05:56,063 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 18:05:56,063 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 18:05:56,063 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 18:05:56,063 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 18:05:56,063 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 18:05:56,064 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 18:05:56,064 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 18:05:56,064 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 18:05:56,064 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 18:05:56,064 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 18:05:56,064 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 18:05:56,064 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 18:05:56,065 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 18:05:56,065 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 18:05:56,065 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 18:05:56,065 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 18:05:56,065 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 18:05:56,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:05:56,065 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 18:05:56,065 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 18:05:56,065 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 18:05:56,065 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 18:05:56,065 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 18:05:56,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 18:05:56,065 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 18:05:56,065 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 18:05:56,065 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 18:05:56,065 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 18:05:56,065 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 -> cc20d196113d3ae541f6b6d9413b3adf505f83f475b90cd277ec788090ea4b3d [2025-03-16 18:05:56,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 18:05:56,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 18:05:56,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 18:05:56,334 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 18:05:56,334 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 18:05:56,335 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound20.i [2025-03-16 18:05:57,535 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9110228c/7a2e7638fbb946829016cacb56e12ce7/FLAGc63a3d903 [2025-03-16 18:05:57,759 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 18:05:57,765 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound20.i [2025-03-16 18:05:57,772 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9110228c/7a2e7638fbb946829016cacb56e12ce7/FLAGc63a3d903 [2025-03-16 18:05:57,790 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9110228c/7a2e7638fbb946829016cacb56e12ce7 [2025-03-16 18:05:57,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 18:05:57,794 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 18:05:57,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 18:05:57,797 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 18:05:57,800 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 18:05:57,800 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:05:57" (1/1) ... [2025-03-16 18:05:57,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@260b0bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:05:57, skipping insertion in model container [2025-03-16 18:05:57,801 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:05:57" (1/1) ... [2025-03-16 18:05:57,814 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 18:05:57,930 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/divbin2_unwindbound20.i[951,964] [2025-03-16 18:05:57,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:05:57,952 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 18:05:57,960 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/divbin2_unwindbound20.i[951,964] [2025-03-16 18:05:57,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:05:57,978 INFO L204 MainTranslator]: Completed translation [2025-03-16 18:05:57,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:05:57 WrapperNode [2025-03-16 18:05:57,979 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 18:05:57,979 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 18:05:57,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 18:05:57,979 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 18:05:57,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:05:57" (1/1) ... [2025-03-16 18:05:57,991 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:05:57" (1/1) ... [2025-03-16 18:05:58,001 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2025-03-16 18:05:58,001 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 18:05:58,002 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 18:05:58,002 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 18:05:58,002 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 18:05:58,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:05:57" (1/1) ... [2025-03-16 18:05:58,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:05:57" (1/1) ... [2025-03-16 18:05:58,007 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:05:57" (1/1) ... [2025-03-16 18:05:58,014 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 18:05:58,014 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:05:57" (1/1) ... [2025-03-16 18:05:58,014 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:05:57" (1/1) ... [2025-03-16 18:05:58,016 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:05:57" (1/1) ... [2025-03-16 18:05:58,016 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:05:57" (1/1) ... [2025-03-16 18:05:58,021 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:05:57" (1/1) ... [2025-03-16 18:05:58,021 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:05:57" (1/1) ... [2025-03-16 18:05:58,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 18:05:58,026 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 18:05:58,027 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 18:05:58,027 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 18:05:58,028 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:05:57" (1/1) ... [2025-03-16 18:05:58,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:05:58,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:05:58,053 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 18:05:58,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 18:05:58,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 18:05:58,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 18:05:58,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 18:05:58,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 18:05:58,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-16 18:05:58,071 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-16 18:05:58,108 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 18:05:58,109 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 18:05:58,230 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-03-16 18:05:58,230 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 18:05:58,238 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 18:05:58,240 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 18:05:58,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:05:58 BoogieIcfgContainer [2025-03-16 18:05:58,241 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 18:05:58,242 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 18:05:58,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 18:05:58,246 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 18:05:58,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 06:05:57" (1/3) ... [2025-03-16 18:05:58,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ab0226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:05:58, skipping insertion in model container [2025-03-16 18:05:58,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:05:57" (2/3) ... [2025-03-16 18:05:58,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ab0226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:05:58, skipping insertion in model container [2025-03-16 18:05:58,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:05:58" (3/3) ... [2025-03-16 18:05:58,248 INFO L128 eAbstractionObserver]: Analyzing ICFG divbin2_unwindbound20.i [2025-03-16 18:05:58,260 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 18:05:58,261 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG divbin2_unwindbound20.i that has 2 procedures, 19 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-16 18:05:58,300 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 18:05:58,308 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;@79d9b574, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 18:05:58,311 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 18:05:58,314 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 18:05:58,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 18:05:58,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:05:58,319 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:05:58,319 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:05:58,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:05:58,324 INFO L85 PathProgramCache]: Analyzing trace with hash -509892887, now seen corresponding path program 1 times [2025-03-16 18:05:58,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:05:58,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191249638] [2025-03-16 18:05:58,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:05:58,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:05:58,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 18:05:58,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 18:05:58,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:05:58,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:05:58,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:05:58,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:05:58,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191249638] [2025-03-16 18:05:58,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191249638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:05:58,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:05:58,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 18:05:58,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187212849] [2025-03-16 18:05:58,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:05:58,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 18:05:58,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:05:58,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 18:05:58,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 18:05:58,443 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 18:05:58,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:05:58,454 INFO L93 Difference]: Finished difference Result 34 states and 49 transitions. [2025-03-16 18:05:58,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 18:05:58,456 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-16 18:05:58,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:05:58,460 INFO L225 Difference]: With dead ends: 34 [2025-03-16 18:05:58,460 INFO L226 Difference]: Without dead ends: 16 [2025-03-16 18:05:58,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 18:05:58,464 INFO L435 NwaCegarLoop]: 24 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, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:05:58,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:05:58,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-16 18:05:58,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-16 18:05:58,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 18:05:58,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2025-03-16 18:05:58,488 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 7 [2025-03-16 18:05:58,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:05:58,488 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2025-03-16 18:05:58,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 18:05:58,489 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2025-03-16 18:05:58,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-16 18:05:58,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:05:58,489 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:05:58,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 18:05:58,490 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:05:58,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:05:58,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1625313876, now seen corresponding path program 1 times [2025-03-16 18:05:58,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:05:58,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412335063] [2025-03-16 18:05:58,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:05:58,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:05:58,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-16 18:05:58,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-16 18:05:58,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:05:58,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:05:58,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:05:58,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:05:58,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412335063] [2025-03-16 18:05:58,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412335063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:05:58,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:05:58,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 18:05:58,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226299812] [2025-03-16 18:05:58,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:05:58,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:05:58,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:05:58,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:05:58,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:05:58,558 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 18:05:58,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:05:58,576 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2025-03-16 18:05:58,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:05:58,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-16 18:05:58,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:05:58,577 INFO L225 Difference]: With dead ends: 30 [2025-03-16 18:05:58,577 INFO L226 Difference]: Without dead ends: 18 [2025-03-16 18:05:58,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:05:58,578 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:05:58,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:05:58,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-16 18:05:58,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-16 18:05:58,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 18:05:58,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2025-03-16 18:05:58,581 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 9 [2025-03-16 18:05:58,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:05:58,581 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2025-03-16 18:05:58,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 18:05:58,581 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2025-03-16 18:05:58,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-16 18:05:58,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:05:58,581 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:05:58,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 18:05:58,582 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:05:58,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:05:58,582 INFO L85 PathProgramCache]: Analyzing trace with hash 2111640085, now seen corresponding path program 1 times [2025-03-16 18:05:58,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:05:58,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142272719] [2025-03-16 18:05:58,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:05:58,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:05:58,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-16 18:05:58,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-16 18:05:58,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:05:58,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 18:05:58,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [526459308] [2025-03-16 18:05:58,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:05:58,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:05:58,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:05:58,615 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:05:58,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 18:05:58,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-16 18:05:58,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-16 18:05:58,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:05:58,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:05:58,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 18:05:58,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:05:58,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:05:58,781 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:05:58,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:05:58,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142272719] [2025-03-16 18:05:58,782 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 18:05:58,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526459308] [2025-03-16 18:05:58,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526459308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:05:58,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:05:58,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:05:58,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59357016] [2025-03-16 18:05:58,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:05:58,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:05:58,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:05:58,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:05:58,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:05:58,784 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 18:05:58,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:05:58,845 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2025-03-16 18:05:58,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:05:58,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-16 18:05:58,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:05:58,846 INFO L225 Difference]: With dead ends: 30 [2025-03-16 18:05:58,846 INFO L226 Difference]: Without dead ends: 27 [2025-03-16 18:05:58,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:05:58,847 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 8 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:05:58,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 47 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:05:58,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-16 18:05:58,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-16 18:05:58,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 18:05:58,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2025-03-16 18:05:58,851 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 10 [2025-03-16 18:05:58,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:05:58,852 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2025-03-16 18:05:58,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 18:05:58,852 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2025-03-16 18:05:58,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 18:05:58,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:05:58,852 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:05:58,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 18:05:59,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:05:59,057 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:05:59,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:05:59,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1100816348, now seen corresponding path program 1 times [2025-03-16 18:05:59,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:05:59,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542159709] [2025-03-16 18:05:59,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:05:59,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:05:59,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 18:05:59,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 18:05:59,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:05:59,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:05:59,296 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:05:59,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:05:59,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542159709] [2025-03-16 18:05:59,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542159709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:05:59,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:05:59,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 18:05:59,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549115382] [2025-03-16 18:05:59,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:05:59,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 18:05:59,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:05:59,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 18:05:59,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:05:59,301 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 18:05:59,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:05:59,318 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2025-03-16 18:05:59,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 18:05:59,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-03-16 18:05:59,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:05:59,319 INFO L225 Difference]: With dead ends: 53 [2025-03-16 18:05:59,319 INFO L226 Difference]: Without dead ends: 28 [2025-03-16 18:05:59,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:05:59,321 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:05:59,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:05:59,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-16 18:05:59,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-16 18:05:59,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 18:05:59,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2025-03-16 18:05:59,329 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 19 [2025-03-16 18:05:59,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:05:59,329 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-03-16 18:05:59,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 18:05:59,329 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2025-03-16 18:05:59,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 18:05:59,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:05:59,330 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:05:59,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 18:05:59,331 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:05:59,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:05:59,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1119086885, now seen corresponding path program 1 times [2025-03-16 18:05:59,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:05:59,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322030349] [2025-03-16 18:05:59,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:05:59,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:05:59,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 18:05:59,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 18:05:59,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:05:59,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:05:59,394 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:05:59,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:05:59,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322030349] [2025-03-16 18:05:59,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322030349] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:05:59,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114490744] [2025-03-16 18:05:59,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:05:59,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:05:59,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:05:59,397 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:05:59,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 18:05:59,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 18:05:59,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 18:05:59,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:05:59,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:05:59,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 18:05:59,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:05:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 18:05:59,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:05:59,487 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:05:59,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114490744] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:05:59,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:05:59,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2025-03-16 18:05:59,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129074141] [2025-03-16 18:05:59,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:05:59,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 18:05:59,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:05:59,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 18:05:59,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:05:59,490 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 18:05:59,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:05:59,555 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2025-03-16 18:05:59,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 18:05:59,558 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-03-16 18:05:59,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:05:59,559 INFO L225 Difference]: With dead ends: 68 [2025-03-16 18:05:59,560 INFO L226 Difference]: Without dead ends: 47 [2025-03-16 18:05:59,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 18:05:59,561 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 13 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:05:59,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 112 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:05:59,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-16 18:05:59,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2025-03-16 18:05:59,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 18:05:59,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2025-03-16 18:05:59,565 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 21 [2025-03-16 18:05:59,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:05:59,565 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2025-03-16 18:05:59,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 18:05:59,565 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2025-03-16 18:05:59,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-16 18:05:59,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:05:59,566 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:05:59,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 18:05:59,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:05:59,766 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:05:59,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:05:59,767 INFO L85 PathProgramCache]: Analyzing trace with hash -102056474, now seen corresponding path program 1 times [2025-03-16 18:05:59,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:05:59,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355207455] [2025-03-16 18:05:59,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:05:59,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:05:59,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-16 18:05:59,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-16 18:05:59,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:05:59,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 18:05:59,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [630882553] [2025-03-16 18:05:59,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:05:59,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:05:59,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:05:59,790 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:05:59,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 18:05:59,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-16 18:05:59,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-16 18:05:59,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:05:59,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:05:59,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-16 18:05:59,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:06:00,090 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:06:00,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:06:28,252 WARN L286 SmtUtils]: Spent 16.06s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 18:06:44,302 WARN L286 SmtUtils]: Spent 16.05s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 18:06:48,311 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~A~0#1| 4294967296)) (.cse2 (mod |c_ULTIMATE.start_main_~b~0#1| 2147483648)) (.cse1 (mod |c_ULTIMATE.start_main_~r~0#1| 4294967296))) (or (not (= (mod (+ (* 2 |c_ULTIMATE.start_main_~b~0#1| |c_ULTIMATE.start_main_~q~0#1|) |c_ULTIMATE.start_main_~r~0#1|) 4294967296) .cse0)) (< .cse1 (mod |c_ULTIMATE.start_main_~b~0#1| 4294967296)) (= (mod (+ |c_ULTIMATE.start_main_~r~0#1| (* 2 .cse2 |c_ULTIMATE.start_main_~q~0#1|)) 4294967296) .cse0) (< (* 2 .cse2) (+ .cse1 1)))) is different from true [2025-03-16 18:07:00,700 WARN L286 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 18:07:16,747 WARN L286 SmtUtils]: Spent 16.05s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 18:07:32,788 WARN L286 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)