./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_valuebound2.c --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/bresenham-ll_valuebound2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 72cd0a4215707a62376e213156123902caf611a87605e41064b672632b6ef1f9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:44:01,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:44:01,880 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:44:01,886 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:44:01,886 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:44:01,903 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:44:01,907 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:44:01,907 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:44:01,908 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:44:01,908 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:44:01,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:44:01,909 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:44:01,909 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:44:01,909 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:44:01,909 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:44:01,909 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:44:01,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:44:01,910 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:44:01,910 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:44:01,910 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:44:01,910 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:44:01,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:44:01,910 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:44:01,911 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:44:01,911 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:44:01,911 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:44:01,911 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:44:01,911 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:44:01,911 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:44:01,911 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:44:01,911 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:44:01,911 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:44:01,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:44:01,911 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:44:01,912 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:44:01,912 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:44:01,912 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:44:01,912 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:44:01,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:44:01,912 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:44:01,912 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:44:01,912 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:44:01,912 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:44:01,912 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 -> 72cd0a4215707a62376e213156123902caf611a87605e41064b672632b6ef1f9 [2025-03-03 13:44:02,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:44:02,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:44:02,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:44:02,163 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:44:02,163 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:44:02,164 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_valuebound2.c [2025-03-03 13:44:03,281 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01f013a2b/ca420e75b45c4842b936e2696e9b3718/FLAGc86b1e562 [2025-03-03 13:44:03,557 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:44:03,557 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_valuebound2.c [2025-03-03 13:44:03,564 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01f013a2b/ca420e75b45c4842b936e2696e9b3718/FLAGc86b1e562 [2025-03-03 13:44:03,855 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01f013a2b/ca420e75b45c4842b936e2696e9b3718 [2025-03-03 13:44:03,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:44:03,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:44:03,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:44:03,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:44:03,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:44:03,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:44:03" (1/1) ... [2025-03-03 13:44:03,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1708ffdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:44:03, skipping insertion in model container [2025-03-03 13:44:03,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:44:03" (1/1) ... [2025-03-03 13:44:03,870 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:44:03,966 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/bresenham-ll_valuebound2.c[597,610] [2025-03-03 13:44:03,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:44:03,992 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:44:03,999 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/bresenham-ll_valuebound2.c[597,610] [2025-03-03 13:44:04,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:44:04,014 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:44:04,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:44:04 WrapperNode [2025-03-03 13:44:04,015 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:44:04,016 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:44:04,016 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:44:04,016 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:44:04,022 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:44:04" (1/1) ... [2025-03-03 13:44:04,026 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:44:04" (1/1) ... [2025-03-03 13:44:04,037 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2025-03-03 13:44:04,038 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:44:04,039 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:44:04,039 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:44:04,039 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:44:04,044 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:44:04" (1/1) ... [2025-03-03 13:44:04,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:44:04" (1/1) ... [2025-03-03 13:44:04,045 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:44:04" (1/1) ... [2025-03-03 13:44:04,057 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:44:04,057 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:44:04" (1/1) ... [2025-03-03 13:44:04,057 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:44:04" (1/1) ... [2025-03-03 13:44:04,059 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:44:04" (1/1) ... [2025-03-03 13:44:04,059 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:44:04" (1/1) ... [2025-03-03 13:44:04,059 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:44:04" (1/1) ... [2025-03-03 13:44:04,060 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:44:04" (1/1) ... [2025-03-03 13:44:04,061 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:44:04,062 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:44:04,062 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:44:04,062 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:44:04,063 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:44:04" (1/1) ... [2025-03-03 13:44:04,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:44:04,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:44:04,086 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:44:04,088 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:44:04,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:44:04,104 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 13:44:04,104 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 13:44:04,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:44:04,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:44:04,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:44:04,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 13:44:04,104 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 13:44:04,139 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:44:04,140 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:44:04,267 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-03 13:44:04,267 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:44:04,272 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:44:04,273 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:44:04,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:44:04 BoogieIcfgContainer [2025-03-03 13:44:04,273 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:44:04,275 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:44:04,275 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:44:04,278 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:44:04,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:44:03" (1/3) ... [2025-03-03 13:44:04,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693bb68a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:44:04, skipping insertion in model container [2025-03-03 13:44:04,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:44:04" (2/3) ... [2025-03-03 13:44:04,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693bb68a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:44:04, skipping insertion in model container [2025-03-03 13:44:04,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:44:04" (3/3) ... [2025-03-03 13:44:04,281 INFO L128 eAbstractionObserver]: Analyzing ICFG bresenham-ll_valuebound2.c [2025-03-03 13:44:04,291 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:44:04,292 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bresenham-ll_valuebound2.c that has 3 procedures, 27 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 13:44:04,331 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:44:04,339 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;@6517b104, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:44:04,341 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:44:04,343 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 13:44:04,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 13:44:04,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:44:04,348 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:44:04,349 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:44:04,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:44:04,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1673088518, now seen corresponding path program 1 times [2025-03-03 13:44:04,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:44:04,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114673673] [2025-03-03 13:44:04,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:44:04,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:44:04,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 13:44:04,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 13:44:04,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:04,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:04,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:44:04,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:44:04,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114673673] [2025-03-03 13:44:04,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114673673] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:44:04,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946680661] [2025-03-03 13:44:04,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:44:04,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:04,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:44:04,453 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:44:04,455 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:44:04,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 13:44:04,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 13:44:04,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:04,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:04,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 13:44:04,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:44:04,506 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:44:04,506 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:44:04,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946680661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:44:04,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:44:04,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 13:44:04,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248173834] [2025-03-03 13:44:04,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:44:04,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 13:44:04,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:44:04,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 13:44:04,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:44:04,522 INFO L87 Difference]: Start difference. First operand has 27 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:44:04,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:44:04,532 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2025-03-03 13:44:04,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 13:44:04,533 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2025-03-03 13:44:04,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:44:04,536 INFO L225 Difference]: With dead ends: 51 [2025-03-03 13:44:04,536 INFO L226 Difference]: Without dead ends: 23 [2025-03-03 13:44:04,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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:44:04,539 INFO L435 NwaCegarLoop]: 30 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, 30 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:44:04,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:44:04,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-03 13:44:04,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-03 13:44:04,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 13:44:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-03-03 13:44:04,559 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 19 [2025-03-03 13:44:04,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:44:04,559 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-03-03 13:44:04,560 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:44:04,560 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2025-03-03 13:44:04,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 13:44:04,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:44:04,560 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:44:04,566 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:44:04,761 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:44:04,761 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:44:04,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:44:04,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1373185864, now seen corresponding path program 1 times [2025-03-03 13:44:04,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:44:04,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027640269] [2025-03-03 13:44:04,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:44:04,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:44:04,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 13:44:04,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 13:44:04,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:04,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:44:04,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1488083590] [2025-03-03 13:44:04,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:44:04,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:04,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:44:04,794 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:44:04,794 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:44:04,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 13:44:04,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 13:44:04,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:04,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:04,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 13:44:04,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:44:04,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:44:04,922 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:44:04,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:44:04,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027640269] [2025-03-03 13:44:04,923 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:44:04,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488083590] [2025-03-03 13:44:04,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488083590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:44:04,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:44:04,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:44:04,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720979698] [2025-03-03 13:44:04,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:44:04,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:44:04,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:44:04,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:44:04,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:44:04,925 INFO L87 Difference]: Start difference. First operand 23 states and 26 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:44:04,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:44:04,997 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2025-03-03 13:44:04,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 13:44:04,997 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-03-03 13:44:04,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:44:04,998 INFO L225 Difference]: With dead ends: 35 [2025-03-03 13:44:04,998 INFO L226 Difference]: Without dead ends: 33 [2025-03-03 13:44:04,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:44:04,999 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:44:04,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 78 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:44:05,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-03 13:44:05,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2025-03-03 13:44:05,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 13:44:05,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2025-03-03 13:44:05,004 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 19 [2025-03-03 13:44:05,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:44:05,005 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2025-03-03 13:44:05,005 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:44:05,005 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2025-03-03 13:44:05,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 13:44:05,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:44:05,010 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:44:05,016 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-03 13:44:05,210 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:44:05,211 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:44:05,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:44:05,211 INFO L85 PathProgramCache]: Analyzing trace with hash 815108111, now seen corresponding path program 1 times [2025-03-03 13:44:05,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:44:05,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232064912] [2025-03-03 13:44:05,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:44:05,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:44:05,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 13:44:05,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 13:44:05,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:05,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:05,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:44:05,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:44:05,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232064912] [2025-03-03 13:44:05,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232064912] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:44:05,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665291350] [2025-03-03 13:44:05,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:44:05,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:05,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:44:05,410 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:44:05,412 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:44:05,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 13:44:05,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 13:44:05,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:05,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:05,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 13:44:05,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:44:05,544 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:44:05,545 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:44:05,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665291350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:44:05,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:44:05,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-03-03 13:44:05,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307187816] [2025-03-03 13:44:05,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:44:05,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:44:05,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:44:05,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:44:05,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 13:44:05,546 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 13:44:05,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:44:05,618 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2025-03-03 13:44:05,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 13:44:05,618 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2025-03-03 13:44:05,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:44:05,619 INFO L225 Difference]: With dead ends: 39 [2025-03-03 13:44:05,620 INFO L226 Difference]: Without dead ends: 31 [2025-03-03 13:44:05,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-03 13:44:05,621 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:44:05,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 78 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:44:05,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-03 13:44:05,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2025-03-03 13:44:05,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 13:44:05,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2025-03-03 13:44:05,628 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 26 [2025-03-03 13:44:05,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:44:05,629 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2025-03-03 13:44:05,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 13:44:05,629 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2025-03-03 13:44:05,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 13:44:05,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:44:05,630 INFO L218 NwaCegarLoop]: trace histogram [2, 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:44:05,636 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:44:05,835 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:44:05,835 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:44:05,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:44:05,836 INFO L85 PathProgramCache]: Analyzing trace with hash 126451028, now seen corresponding path program 1 times [2025-03-03 13:44:05,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:44:05,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933570028] [2025-03-03 13:44:05,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:44:05,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:44:05,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-03 13:44:05,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 13:44:05,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:05,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:44:05,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2090611851] [2025-03-03 13:44:05,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:44:05,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:05,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:44:05,877 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:44:05,878 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:44:05,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-03 13:44:05,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 13:44:05,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:05,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:05,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-03 13:44:05,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:44:06,194 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:44:06,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:44:06,393 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:44:06,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:44:06,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933570028] [2025-03-03 13:44:06,393 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:44:06,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090611851] [2025-03-03 13:44:06,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090611851] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:44:06,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:44:06,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 22 [2025-03-03 13:44:06,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371733161] [2025-03-03 13:44:06,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:44:06,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 13:44:06,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:44:06,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 13:44:06,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2025-03-03 13:44:06,397 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 20 states have internal predecessors, (32), 6 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-03 13:44:06,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:44:06,822 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2025-03-03 13:44:06,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 13:44:06,823 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 20 states have internal predecessors, (32), 6 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2025-03-03 13:44:06,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:44:06,823 INFO L225 Difference]: With dead ends: 61 [2025-03-03 13:44:06,823 INFO L226 Difference]: Without dead ends: 33 [2025-03-03 13:44:06,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=652, Unknown=0, NotChecked=0, Total=812 [2025-03-03 13:44:06,824 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 42 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:44:06,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 148 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:44:06,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-03 13:44:06,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-03 13:44:06,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 13:44:06,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2025-03-03 13:44:06,832 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 28 [2025-03-03 13:44:06,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:44:06,832 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2025-03-03 13:44:06,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 20 states have internal predecessors, (32), 6 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-03 13:44:06,833 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2025-03-03 13:44:06,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 13:44:06,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:44:06,834 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 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:44:06,840 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:44:07,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:07,035 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:44:07,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:44:07,035 INFO L85 PathProgramCache]: Analyzing trace with hash 442785314, now seen corresponding path program 1 times [2025-03-03 13:44:07,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:44:07,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406109761] [2025-03-03 13:44:07,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:44:07,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:44:07,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 13:44:07,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 13:44:07,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:07,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:44:07,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [45769991] [2025-03-03 13:44:07,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:44:07,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:07,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:44:07,051 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:44:07,053 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:44:07,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 13:44:07,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 13:44:07,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:07,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:07,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-03 13:44:07,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:44:07,462 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:44:07,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:44:08,319 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 13:44:08,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:44:08,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406109761] [2025-03-03 13:44:08,319 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:44:08,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45769991] [2025-03-03 13:44:08,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45769991] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:44:08,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:44:08,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 26 [2025-03-03 13:44:08,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232208905] [2025-03-03 13:44:08,320 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:44:08,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 13:44:08,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:44:08,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 13:44:08,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2025-03-03 13:44:08,321 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 26 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 23 states have internal predecessors, (39), 8 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-03 13:44:09,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:44:09,793 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2025-03-03 13:44:09,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 13:44:09,794 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 23 states have internal predecessors, (39), 8 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 35 [2025-03-03 13:44:09,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:44:09,794 INFO L225 Difference]: With dead ends: 52 [2025-03-03 13:44:09,794 INFO L226 Difference]: Without dead ends: 44 [2025-03-03 13:44:09,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=266, Invalid=1216, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 13:44:09,795 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 13:44:09,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 141 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 13:44:09,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-03 13:44:09,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2025-03-03 13:44:09,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 7 states have call successors, (7), 4 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:44:09,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2025-03-03 13:44:09,801 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 35 [2025-03-03 13:44:09,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:44:09,801 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2025-03-03 13:44:09,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 23 states have internal predecessors, (39), 8 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-03 13:44:09,801 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2025-03-03 13:44:09,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 13:44:09,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:44:09,802 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:44:09,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 13:44:10,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:10,003 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:44:10,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:44:10,003 INFO L85 PathProgramCache]: Analyzing trace with hash 392028642, now seen corresponding path program 1 times [2025-03-03 13:44:10,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:44:10,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880892742] [2025-03-03 13:44:10,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:44:10,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:44:10,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 13:44:10,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 13:44:10,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:10,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:10,109 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 13:44:10,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:44:10,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880892742] [2025-03-03 13:44:10,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880892742] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:44:10,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155687670] [2025-03-03 13:44:10,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:44:10,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:10,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:44:10,111 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:44:10,112 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:44:10,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 13:44:10,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 13:44:10,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:10,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:10,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 13:44:10,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:44:10,169 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 13:44:10,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:44:10,218 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 13:44:10,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155687670] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:44:10,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:44:10,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-03-03 13:44:10,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915812598] [2025-03-03 13:44:10,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:44:10,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:44:10,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:44:10,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:44:10,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:44:10,220 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-03 13:44:10,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:44:10,281 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2025-03-03 13:44:10,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:44:10,281 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 53 [2025-03-03 13:44:10,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:44:10,282 INFO L225 Difference]: With dead ends: 69 [2025-03-03 13:44:10,282 INFO L226 Difference]: Without dead ends: 54 [2025-03-03 13:44:10,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:44:10,283 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:44:10,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 104 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:44:10,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-03 13:44:10,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2025-03-03 13:44:10,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 13:44:10,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2025-03-03 13:44:10,293 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 53 [2025-03-03 13:44:10,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:44:10,293 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2025-03-03 13:44:10,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-03 13:44:10,294 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2025-03-03 13:44:10,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 13:44:10,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:44:10,295 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:44:10,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 13:44:10,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:10,496 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:44:10,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:44:10,496 INFO L85 PathProgramCache]: Analyzing trace with hash -113529983, now seen corresponding path program 2 times [2025-03-03 13:44:10,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:44:10,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059679326] [2025-03-03 13:44:10,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:44:10,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:44:10,501 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-03-03 13:44:10,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 13:44:10,519 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:44:10,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:44:10,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1991475992] [2025-03-03 13:44:10,520 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:44:10,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:10,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:44:10,524 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:44:10,526 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:44:10,548 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-03-03 13:44:10,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 13:44:10,568 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:44:10,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:10,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-03 13:44:10,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:44:10,885 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 34 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 13:44:10,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:44:11,329 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 31 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 13:44:11,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:44:11,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059679326] [2025-03-03 13:44:11,329 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:44:11,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991475992] [2025-03-03 13:44:11,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991475992] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:44:11,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:44:11,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 30 [2025-03-03 13:44:11,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227070711] [2025-03-03 13:44:11,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:44:11,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 13:44:11,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:44:11,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 13:44:11,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2025-03-03 13:44:11,331 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 30 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 29 states have internal predecessors, (51), 11 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2025-03-03 13:44:12,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:44:12,664 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2025-03-03 13:44:12,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-03 13:44:12,664 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 29 states have internal predecessors, (51), 11 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 53 [2025-03-03 13:44:12,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:44:12,665 INFO L225 Difference]: With dead ends: 86 [2025-03-03 13:44:12,665 INFO L226 Difference]: Without dead ends: 78 [2025-03-03 13:44:12,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=511, Invalid=2681, Unknown=0, NotChecked=0, Total=3192 [2025-03-03 13:44:12,666 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:44:12,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 303 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:44:12,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-03 13:44:12,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2025-03-03 13:44:12,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 59 states have internal predecessors, (70), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 13:44:12,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 97 transitions. [2025-03-03 13:44:12,682 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 97 transitions. Word has length 53 [2025-03-03 13:44:12,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:44:12,682 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 97 transitions. [2025-03-03 13:44:12,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 29 states have internal predecessors, (51), 11 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2025-03-03 13:44:12,683 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2025-03-03 13:44:12,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 13:44:12,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:44:12,683 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:44:12,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 13:44:12,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:12,885 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:44:12,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:44:12,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1636793123, now seen corresponding path program 3 times [2025-03-03 13:44:12,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:44:12,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118153841] [2025-03-03 13:44:12,886 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:44:12,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:44:12,894 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 4 equivalence classes. [2025-03-03 13:44:12,910 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 13:44:12,912 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 13:44:12,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:13,113 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 13:44:13,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:44:13,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118153841] [2025-03-03 13:44:13,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118153841] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:44:13,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677736851] [2025-03-03 13:44:13,113 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:44:13,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:13,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:44:13,115 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:44:13,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 13:44:13,135 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 4 equivalence classes. [2025-03-03 13:44:13,156 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 35 of 53 statements. [2025-03-03 13:44:13,156 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 13:44:13,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:13,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-03 13:44:13,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:44:13,539 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 13:44:13,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:44:17,990 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 13:44:17,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677736851] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:44:17,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:44:17,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 12] total 32 [2025-03-03 13:44:17,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948729116] [2025-03-03 13:44:17,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:44:17,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-03 13:44:17,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:44:17,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-03 13:44:17,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=859, Unknown=1, NotChecked=0, Total=992 [2025-03-03 13:44:17,991 INFO L87 Difference]: Start difference. First operand 77 states and 97 transitions. Second operand has 32 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 29 states have internal predecessors, (64), 13 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2025-03-03 13:44:20,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:44:20,296 INFO L93 Difference]: Finished difference Result 135 states and 175 transitions. [2025-03-03 13:44:20,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-03 13:44:20,296 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 29 states have internal predecessors, (64), 13 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) Word has length 53 [2025-03-03 13:44:20,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:44:20,297 INFO L225 Difference]: With dead ends: 135 [2025-03-03 13:44:20,297 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 13:44:20,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=531, Invalid=3008, Unknown=1, NotChecked=0, Total=3540 [2025-03-03 13:44:20,299 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 38 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:44:20,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 210 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 13:44:20,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 13:44:20,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 13:44:20,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:44:20,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 13:44:20,299 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2025-03-03 13:44:20,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:44:20,299 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 13:44:20,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 29 states have internal predecessors, (64), 13 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2025-03-03 13:44:20,299 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 13:44:20,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 13:44:20,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 13:44:20,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 13:44:20,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-03 13:44:20,505 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2025-03-03 13:44:20,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 13:44:21,985 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 13:44:21,993 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-03 13:44:21,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 01:44:21 BoogieIcfgContainer [2025-03-03 13:44:21,998 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 13:44:21,999 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 13:44:21,999 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 13:44:21,999 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 13:44:21,999 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:44:04" (3/4) ... [2025-03-03 13:44:22,000 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 13:44:22,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-03 13:44:22,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-03 13:44:22,006 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-03 13:44:22,006 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 13:44:22,006 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 13:44:22,006 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 13:44:22,053 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 13:44:22,053 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 13:44:22,053 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 13:44:22,053 INFO L158 Benchmark]: Toolchain (without parser) took 18195.62ms. Allocated memory is still 201.3MB. Free memory was 155.0MB in the beginning and 103.8MB in the end (delta: 51.2MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. [2025-03-03 13:44:22,053 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:44:22,054 INFO L158 Benchmark]: CACSL2BoogieTranslator took 156.78ms. Allocated memory is still 201.3MB. Free memory was 155.0MB in the beginning and 143.6MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:44:22,054 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.58ms. Allocated memory is still 201.3MB. Free memory was 143.6MB in the beginning and 142.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:44:22,054 INFO L158 Benchmark]: Boogie Preprocessor took 22.22ms. Allocated memory is still 201.3MB. Free memory was 142.4MB in the beginning and 141.6MB in the end (delta: 814.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:44:22,054 INFO L158 Benchmark]: IcfgBuilder took 211.30ms. Allocated memory is still 201.3MB. Free memory was 141.3MB in the beginning and 129.2MB in the end (delta: 12.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 13:44:22,054 INFO L158 Benchmark]: TraceAbstraction took 17723.61ms. Allocated memory is still 201.3MB. Free memory was 128.8MB in the beginning and 108.1MB in the end (delta: 20.6MB). Peak memory consumption was 73.5MB. Max. memory is 16.1GB. [2025-03-03 13:44:22,055 INFO L158 Benchmark]: Witness Printer took 54.32ms. Allocated memory is still 201.3MB. Free memory was 108.1MB in the beginning and 103.8MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:44:22,056 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 156.78ms. Allocated memory is still 201.3MB. Free memory was 155.0MB in the beginning and 143.6MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.58ms. Allocated memory is still 201.3MB. Free memory was 143.6MB in the beginning and 142.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.22ms. Allocated memory is still 201.3MB. Free memory was 142.4MB in the beginning and 141.6MB in the end (delta: 814.1kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 211.30ms. Allocated memory is still 201.3MB. Free memory was 141.3MB in the beginning and 129.2MB in the end (delta: 12.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17723.61ms. Allocated memory is still 201.3MB. Free memory was 128.8MB in the beginning and 108.1MB in the end (delta: 20.6MB). Peak memory consumption was 73.5MB. Max. memory is 16.1GB. * Witness Printer took 54.32ms. Allocated memory is still 201.3MB. Free memory was 108.1MB in the beginning and 103.8MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.2s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 147 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 142 mSDsluCounter, 1092 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 939 mSDsCounter, 133 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2022 IncrementalHoareTripleChecker+Invalid, 2155 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 133 mSolverCounterUnsat, 153 mSDtfsCounter, 2022 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 602 GetRequests, 402 SyntacticMatches, 1 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1854 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=7, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 10 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 572 NumberOfCodeBlocks, 554 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 642 ConstructedInterpolants, 3 QuantifiedInterpolants, 3955 SizeOfPredicates, 22 NumberOfNonLiveVariables, 745 ConjunctsInSsa, 188 ConjunctsInUnsatCore, 17 InterpolantComputations, 3 PerfectInterpolantSequences, 399/550 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 32]: Location Invariant Derived location invariant: ((((((((((__int128) X * y) * 2) + X) + v) == ((((__int128) Y * x) * 2) + ((long long) 2 * Y))) && (X <= 2)) && (0 <= Y)) && (Y <= 2)) && (0 <= X)) RESULT: Ultimate proved your program to be correct! [2025-03-03 13:44:22,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE