./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul8.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul8.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 64bit --witnessprinter.graph.data.programhash 2c23b24996a641290a5102e8d144e57f15ff0408b05b341b054ce62885ea247c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:32:28,482 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:32:28,530 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 23:32:28,533 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:32:28,533 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:32:28,547 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:32:28,548 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:32:28,548 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:32:28,549 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:32:28,549 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:32:28,550 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:32:28,550 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:32:28,550 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:32:28,550 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:32:28,550 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:32:28,551 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:32:28,551 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:32:28,551 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 23:32:28,551 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:32:28,551 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:32:28,551 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:32:28,551 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:32:28,552 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:32:28,552 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:32:28,552 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:32:28,552 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:32:28,552 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:32:28,552 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:32:28,552 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:32:28,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:32:28,552 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:32:28,552 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:32:28,552 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:32:28,552 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:32:28,552 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 23:32:28,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 23:32:28,552 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:32:28,552 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:32:28,553 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:32:28,553 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:32:28,553 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-jdk21/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2c23b24996a641290a5102e8d144e57f15ff0408b05b341b054ce62885ea247c [2025-02-07 23:32:28,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:32:28,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:32:28,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:32:28,776 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:32:28,776 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:32:28,778 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul8.c [2025-02-07 23:32:29,985 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8148f97a8/d05f814a3f7c49b6a69647bc43d6796e/FLAG4fb1fd2fe [2025-02-07 23:32:30,244 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:32:30,244 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul8.c [2025-02-07 23:32:30,252 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8148f97a8/d05f814a3f7c49b6a69647bc43d6796e/FLAG4fb1fd2fe [2025-02-07 23:32:30,263 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8148f97a8/d05f814a3f7c49b6a69647bc43d6796e [2025-02-07 23:32:30,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:32:30,265 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:32:30,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:32:30,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:32:30,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:32:30,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:32:30" (1/1) ... [2025-02-07 23:32:30,270 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51952da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:30, skipping insertion in model container [2025-02-07 23:32:30,270 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:32:30" (1/1) ... [2025-02-07 23:32:30,300 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:32:30,416 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul8.c[1244,1257] [2025-02-07 23:32:30,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:32:30,573 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:32:30,584 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul8.c[1244,1257] [2025-02-07 23:32:30,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:32:30,652 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:32:30,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:30 WrapperNode [2025-02-07 23:32:30,653 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:32:30,653 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:32:30,653 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:32:30,653 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:32:30,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:30" (1/1) ... [2025-02-07 23:32:30,674 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:30" (1/1) ... [2025-02-07 23:32:30,767 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1761 [2025-02-07 23:32:30,768 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:32:30,768 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:32:30,768 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:32:30,768 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:32:30,774 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:30" (1/1) ... [2025-02-07 23:32:30,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:30" (1/1) ... [2025-02-07 23:32:30,790 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:30" (1/1) ... [2025-02-07 23:32:30,910 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-02-07 23:32:30,910 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:30" (1/1) ... [2025-02-07 23:32:30,910 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:30" (1/1) ... [2025-02-07 23:32:30,958 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:30" (1/1) ... [2025-02-07 23:32:30,970 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:30" (1/1) ... [2025-02-07 23:32:30,985 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:30" (1/1) ... [2025-02-07 23:32:30,993 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:30" (1/1) ... [2025-02-07 23:32:31,019 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:32:31,021 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:32:31,021 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:32:31,021 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:32:31,022 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:30" (1/1) ... [2025-02-07 23:32:31,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:32:31,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:32:31,047 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 23:32:31,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 23:32:31,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:32:31,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 23:32:31,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 23:32:31,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:32:31,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:32:31,217 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:32:31,219 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:32:32,619 INFO L? ?]: Removed 894 outVars from TransFormulas that were not future-live. [2025-02-07 23:32:32,620 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:32:32,708 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:32:32,710 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:32:32,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:32:32 BoogieIcfgContainer [2025-02-07 23:32:32,711 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:32:32,712 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:32:32,713 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:32:32,716 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:32:32,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:32:30" (1/3) ... [2025-02-07 23:32:32,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3a6d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:32:32, skipping insertion in model container [2025-02-07 23:32:32,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:30" (2/3) ... [2025-02-07 23:32:32,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3a6d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:32:32, skipping insertion in model container [2025-02-07 23:32:32,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:32:32" (3/3) ... [2025-02-07 23:32:32,719 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul8.c [2025-02-07 23:32:32,729 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:32:32,731 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.mul8.c that has 1 procedures, 521 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:32:32,786 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:32:32,798 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;@23f2fd99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:32:32,798 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:32:32,802 INFO L276 IsEmpty]: Start isEmpty. Operand has 521 states, 519 states have (on average 1.51252408477842) internal successors, (785), 520 states have internal predecessors, (785), 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-02-07 23:32:32,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-07 23:32:32,808 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:32:32,809 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:32:32,809 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:32:32,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:32:32,813 INFO L85 PathProgramCache]: Analyzing trace with hash -109109535, now seen corresponding path program 1 times [2025-02-07 23:32:32,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:32:32,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457342327] [2025-02-07 23:32:32,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:32:32,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:32:32,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-07 23:32:33,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-07 23:32:33,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:32:33,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:32:33,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:32:33,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:32:33,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457342327] [2025-02-07 23:32:33,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457342327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:32:33,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:32:33,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:32:33,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132850032] [2025-02-07 23:32:33,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:32:33,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:32:33,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:32:33,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:32:33,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:32:33,642 INFO L87 Difference]: Start difference. First operand has 521 states, 519 states have (on average 1.51252408477842) internal successors, (785), 520 states have internal predecessors, (785), 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) Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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-02-07 23:32:33,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:32:34,000 INFO L93 Difference]: Finished difference Result 925 states and 1397 transitions. [2025-02-07 23:32:34,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:32:34,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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) Word has length 94 [2025-02-07 23:32:34,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:32:34,012 INFO L225 Difference]: With dead ends: 925 [2025-02-07 23:32:34,016 INFO L226 Difference]: Without dead ends: 521 [2025-02-07 23:32:34,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:32:34,024 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 0 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1960 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:32:34,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1960 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:32:34,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-02-07 23:32:34,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 521. [2025-02-07 23:32:34,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 520 states have (on average 1.5076923076923077) internal successors, (784), 520 states have internal predecessors, (784), 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-02-07 23:32:34,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 784 transitions. [2025-02-07 23:32:34,088 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 784 transitions. Word has length 94 [2025-02-07 23:32:34,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:32:34,089 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 784 transitions. [2025-02-07 23:32:34,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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-02-07 23:32:34,089 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 784 transitions. [2025-02-07 23:32:34,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-07 23:32:34,092 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:32:34,093 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:32:34,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 23:32:34,093 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:32:34,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:32:34,097 INFO L85 PathProgramCache]: Analyzing trace with hash 917251440, now seen corresponding path program 1 times [2025-02-07 23:32:34,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:32:34,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246530527] [2025-02-07 23:32:34,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:32:34,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:32:34,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-07 23:32:34,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-07 23:32:34,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:32:34,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:32:34,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:32:34,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:32:34,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246530527] [2025-02-07 23:32:34,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246530527] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:32:34,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:32:34,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:32:34,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549741304] [2025-02-07 23:32:34,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:32:34,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:32:34,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:32:34,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:32:34,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:32:34,396 INFO L87 Difference]: Start difference. First operand 521 states and 784 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-02-07 23:32:34,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:32:34,639 INFO L93 Difference]: Finished difference Result 927 states and 1396 transitions. [2025-02-07 23:32:34,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:32:34,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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) Word has length 95 [2025-02-07 23:32:34,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:32:34,643 INFO L225 Difference]: With dead ends: 927 [2025-02-07 23:32:34,643 INFO L226 Difference]: Without dead ends: 523 [2025-02-07 23:32:34,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:32:34,647 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 0 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1957 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:32:34,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1957 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:32:34,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-02-07 23:32:34,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2025-02-07 23:32:34,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 522 states have (on average 1.5057471264367817) internal successors, (786), 522 states have internal predecessors, (786), 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-02-07 23:32:34,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 786 transitions. [2025-02-07 23:32:34,668 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 786 transitions. Word has length 95 [2025-02-07 23:32:34,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:32:34,671 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 786 transitions. [2025-02-07 23:32:34,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-02-07 23:32:34,672 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 786 transitions. [2025-02-07 23:32:34,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-07 23:32:34,673 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:32:34,673 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:32:34,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 23:32:34,673 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:32:34,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:32:34,674 INFO L85 PathProgramCache]: Analyzing trace with hash 301533372, now seen corresponding path program 1 times [2025-02-07 23:32:34,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:32:34,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405820122] [2025-02-07 23:32:34,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:32:34,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:32:34,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-07 23:32:34,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-07 23:32:34,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:32:34,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:32:35,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:32:35,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:32:35,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405820122] [2025-02-07 23:32:35,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405820122] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:32:35,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:32:35,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:32:35,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651559794] [2025-02-07 23:32:35,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:32:35,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:32:35,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:32:35,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:32:35,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:32:35,072 INFO L87 Difference]: Start difference. First operand 523 states and 786 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 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-02-07 23:32:35,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:32:35,380 INFO L93 Difference]: Finished difference Result 933 states and 1403 transitions. [2025-02-07 23:32:35,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:32:35,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 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) Word has length 96 [2025-02-07 23:32:35,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:32:35,383 INFO L225 Difference]: With dead ends: 933 [2025-02-07 23:32:35,383 INFO L226 Difference]: Without dead ends: 527 [2025-02-07 23:32:35,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:32:35,384 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 700 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:32:35,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1940 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:32:35,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-02-07 23:32:35,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 526. [2025-02-07 23:32:35,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.502857142857143) internal successors, (789), 525 states have internal predecessors, (789), 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-02-07 23:32:35,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 789 transitions. [2025-02-07 23:32:35,395 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 789 transitions. Word has length 96 [2025-02-07 23:32:35,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:32:35,395 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 789 transitions. [2025-02-07 23:32:35,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 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-02-07 23:32:35,396 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 789 transitions. [2025-02-07 23:32:35,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-07 23:32:35,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:32:35,397 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:32:35,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 23:32:35,398 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:32:35,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:32:35,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1649004267, now seen corresponding path program 1 times [2025-02-07 23:32:35,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:32:35,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532984200] [2025-02-07 23:32:35,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:32:35,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:32:35,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-07 23:32:35,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-07 23:32:35,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:32:35,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:32:35,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:32:35,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:32:35,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532984200] [2025-02-07 23:32:35,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532984200] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:32:35,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:32:35,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:32:35,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506255061] [2025-02-07 23:32:35,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:32:35,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:32:35,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:32:35,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:32:35,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:32:35,625 INFO L87 Difference]: Start difference. First operand 526 states and 789 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-02-07 23:32:35,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:32:35,912 INFO L93 Difference]: Finished difference Result 945 states and 1418 transitions. [2025-02-07 23:32:35,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:32:35,913 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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) Word has length 97 [2025-02-07 23:32:35,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:32:35,915 INFO L225 Difference]: With dead ends: 945 [2025-02-07 23:32:35,915 INFO L226 Difference]: Without dead ends: 536 [2025-02-07 23:32:35,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:32:35,916 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 8 mSDsluCounter, 1952 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2606 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:32:35,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2606 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:32:35,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-02-07 23:32:35,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-02-07 23:32:35,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 535 states have (on average 1.5009345794392523) internal successors, (803), 535 states have internal predecessors, (803), 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-02-07 23:32:35,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 803 transitions. [2025-02-07 23:32:35,926 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 803 transitions. Word has length 97 [2025-02-07 23:32:35,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:32:35,926 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 803 transitions. [2025-02-07 23:32:35,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-02-07 23:32:35,926 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 803 transitions. [2025-02-07 23:32:35,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-07 23:32:35,927 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:32:35,927 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:32:35,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 23:32:35,927 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:32:35,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:32:35,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1622186902, now seen corresponding path program 1 times [2025-02-07 23:32:35,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:32:35,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828789804] [2025-02-07 23:32:35,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:32:35,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:32:35,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-07 23:32:35,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-07 23:32:35,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:32:35,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:32:36,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:32:36,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:32:36,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828789804] [2025-02-07 23:32:36,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828789804] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:32:36,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:32:36,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-07 23:32:36,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866333757] [2025-02-07 23:32:36,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:32:36,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 23:32:36,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:32:36,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 23:32:36,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:32:36,789 INFO L87 Difference]: Start difference. First operand 536 states and 803 transitions. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 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-02-07 23:32:37,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:32:37,279 INFO L93 Difference]: Finished difference Result 978 states and 1464 transitions. [2025-02-07 23:32:37,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 23:32:37,279 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 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) Word has length 97 [2025-02-07 23:32:37,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:32:37,281 INFO L225 Difference]: With dead ends: 978 [2025-02-07 23:32:37,282 INFO L226 Difference]: Without dead ends: 559 [2025-02-07 23:32:37,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:32:37,284 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 24 mSDsluCounter, 3240 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 3890 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:32:37,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 3890 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:32:37,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-02-07 23:32:37,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 544. [2025-02-07 23:32:37,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 543 states have (on average 1.4990791896869244) internal successors, (814), 543 states have internal predecessors, (814), 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-02-07 23:32:37,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 814 transitions. [2025-02-07 23:32:37,294 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 814 transitions. Word has length 97 [2025-02-07 23:32:37,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:32:37,295 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 814 transitions. [2025-02-07 23:32:37,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 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-02-07 23:32:37,295 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 814 transitions. [2025-02-07 23:32:37,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-07 23:32:37,297 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:32:37,297 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:32:37,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 23:32:37,297 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:32:37,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:32:37,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1443566391, now seen corresponding path program 1 times [2025-02-07 23:32:37,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:32:37,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182352102] [2025-02-07 23:32:37,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:32:37,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:32:37,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-07 23:32:37,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-07 23:32:37,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:32:37,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:32:37,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:32:37,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:32:37,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182352102] [2025-02-07 23:32:37,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182352102] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:32:37,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:32:37,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:32:37,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271771327] [2025-02-07 23:32:37,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:32:37,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:32:37,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:32:37,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:32:37,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:32:37,693 INFO L87 Difference]: Start difference. First operand 544 states and 814 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 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-02-07 23:32:38,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:32:38,078 INFO L93 Difference]: Finished difference Result 1244 states and 1861 transitions. [2025-02-07 23:32:38,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:32:38,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 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) Word has length 98 [2025-02-07 23:32:38,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:32:38,081 INFO L225 Difference]: With dead ends: 1244 [2025-02-07 23:32:38,081 INFO L226 Difference]: Without dead ends: 817 [2025-02-07 23:32:38,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:32:38,082 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 1080 mSDsluCounter, 1880 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 2529 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:32:38,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1080 Valid, 2529 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:32:38,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2025-02-07 23:32:38,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 588. [2025-02-07 23:32:38,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 587 states have (on average 1.495741056218058) internal successors, (878), 587 states have internal predecessors, (878), 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-02-07 23:32:38,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 878 transitions. [2025-02-07 23:32:38,092 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 878 transitions. Word has length 98 [2025-02-07 23:32:38,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:32:38,093 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 878 transitions. [2025-02-07 23:32:38,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 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-02-07 23:32:38,093 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 878 transitions. [2025-02-07 23:32:38,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-07 23:32:38,093 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:32:38,093 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:32:38,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 23:32:38,094 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:32:38,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:32:38,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1368689357, now seen corresponding path program 1 times [2025-02-07 23:32:38,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:32:38,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910977324] [2025-02-07 23:32:38,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:32:38,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:32:38,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-07 23:32:38,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-07 23:32:38,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:32:38,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:32:38,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:32:38,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:32:38,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910977324] [2025-02-07 23:32:38,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910977324] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:32:38,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:32:38,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:32:38,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831842115] [2025-02-07 23:32:38,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:32:38,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:32:38,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:32:38,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:32:38,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:32:38,526 INFO L87 Difference]: Start difference. First operand 588 states and 878 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 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-02-07 23:32:38,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:32:38,849 INFO L93 Difference]: Finished difference Result 1013 states and 1515 transitions. [2025-02-07 23:32:38,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 23:32:38,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 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) Word has length 98 [2025-02-07 23:32:38,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:32:38,851 INFO L225 Difference]: With dead ends: 1013 [2025-02-07 23:32:38,852 INFO L226 Difference]: Without dead ends: 586 [2025-02-07 23:32:38,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:32:38,853 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 690 mSDsluCounter, 1923 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 2566 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:32:38,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 2566 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:32:38,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-02-07 23:32:38,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 583. [2025-02-07 23:32:38,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 582 states have (on average 1.4965635738831615) internal successors, (871), 582 states have internal predecessors, (871), 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-02-07 23:32:38,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 871 transitions. [2025-02-07 23:32:38,863 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 871 transitions. Word has length 98 [2025-02-07 23:32:38,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:32:38,863 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 871 transitions. [2025-02-07 23:32:38,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 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-02-07 23:32:38,863 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 871 transitions. [2025-02-07 23:32:38,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-07 23:32:38,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:32:38,864 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:32:38,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 23:32:38,864 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:32:38,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:32:38,865 INFO L85 PathProgramCache]: Analyzing trace with hash 344913230, now seen corresponding path program 1 times [2025-02-07 23:32:38,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:32:38,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809956629] [2025-02-07 23:32:38,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:32:38,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:32:38,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-07 23:32:38,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-07 23:32:38,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:32:38,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:32:39,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:32:39,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:32:39,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809956629] [2025-02-07 23:32:39,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809956629] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:32:39,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:32:39,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-07 23:32:39,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247805570] [2025-02-07 23:32:39,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:32:39,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 23:32:39,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:32:39,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 23:32:39,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:32:39,387 INFO L87 Difference]: Start difference. First operand 583 states and 871 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 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-02-07 23:32:39,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:32:39,780 INFO L93 Difference]: Finished difference Result 1023 states and 1529 transitions. [2025-02-07 23:32:39,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 23:32:39,780 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 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) Word has length 98 [2025-02-07 23:32:39,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:32:39,782 INFO L225 Difference]: With dead ends: 1023 [2025-02-07 23:32:39,782 INFO L226 Difference]: Without dead ends: 601 [2025-02-07 23:32:39,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:32:39,783 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 21 mSDsluCounter, 2589 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3236 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:32:39,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3236 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:32:39,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-02-07 23:32:39,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 589. [2025-02-07 23:32:39,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 588 states have (on average 1.4948979591836735) internal successors, (879), 588 states have internal predecessors, (879), 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-02-07 23:32:39,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 879 transitions. [2025-02-07 23:32:39,794 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 879 transitions. Word has length 98 [2025-02-07 23:32:39,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:32:39,794 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 879 transitions. [2025-02-07 23:32:39,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 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-02-07 23:32:39,794 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 879 transitions. [2025-02-07 23:32:39,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-07 23:32:39,795 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:32:39,795 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:32:39,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 23:32:39,795 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:32:39,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:32:39,795 INFO L85 PathProgramCache]: Analyzing trace with hash 2109403524, now seen corresponding path program 1 times [2025-02-07 23:32:39,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:32:39,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007505633] [2025-02-07 23:32:39,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:32:39,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:32:39,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-07 23:32:39,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-07 23:32:39,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:32:39,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:32:40,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:32:40,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:32:40,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007505633] [2025-02-07 23:32:40,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007505633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:32:40,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:32:40,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:32:40,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236693408] [2025-02-07 23:32:40,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:32:40,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:32:40,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:32:40,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:32:40,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:32:40,051 INFO L87 Difference]: Start difference. First operand 589 states and 879 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 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-02-07 23:32:40,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:32:40,444 INFO L93 Difference]: Finished difference Result 1201 states and 1792 transitions. [2025-02-07 23:32:40,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:32:40,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 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) Word has length 98 [2025-02-07 23:32:40,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:32:40,448 INFO L225 Difference]: With dead ends: 1201 [2025-02-07 23:32:40,448 INFO L226 Difference]: Without dead ends: 769 [2025-02-07 23:32:40,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:32:40,449 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 1282 mSDsluCounter, 1875 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1282 SdHoareTripleChecker+Valid, 2523 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:32:40,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1282 Valid, 2523 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:32:40,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2025-02-07 23:32:40,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 587. [2025-02-07 23:32:40,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 586 states have (on average 1.4914675767918089) internal successors, (874), 586 states have internal predecessors, (874), 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-02-07 23:32:40,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 874 transitions. [2025-02-07 23:32:40,461 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 874 transitions. Word has length 98 [2025-02-07 23:32:40,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:32:40,461 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 874 transitions. [2025-02-07 23:32:40,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 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-02-07 23:32:40,461 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 874 transitions. [2025-02-07 23:32:40,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-07 23:32:40,462 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:32:40,462 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:32:40,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 23:32:40,462 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:32:40,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:32:40,463 INFO L85 PathProgramCache]: Analyzing trace with hash 2014491519, now seen corresponding path program 1 times [2025-02-07 23:32:40,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:32:40,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017174632] [2025-02-07 23:32:40,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:32:40,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:32:40,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-07 23:32:40,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-07 23:32:40,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:32:40,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:32:40,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:32:40,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:32:40,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017174632] [2025-02-07 23:32:40,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017174632] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:32:40,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:32:40,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:32:40,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402763799] [2025-02-07 23:32:40,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:32:40,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:32:40,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:32:40,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:32:40,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:32:40,703 INFO L87 Difference]: Start difference. First operand 587 states and 874 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 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-02-07 23:32:40,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:32:40,981 INFO L93 Difference]: Finished difference Result 1237 states and 1843 transitions. [2025-02-07 23:32:40,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:32:40,982 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 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) Word has length 98 [2025-02-07 23:32:40,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:32:40,985 INFO L225 Difference]: With dead ends: 1237 [2025-02-07 23:32:40,985 INFO L226 Difference]: Without dead ends: 803 [2025-02-07 23:32:40,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:32:40,986 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 1054 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:32:40,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1054 Valid, 1941 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:32:40,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-02-07 23:32:40,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 585. [2025-02-07 23:32:40,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 584 states have (on average 1.4880136986301369) internal successors, (869), 584 states have internal predecessors, (869), 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-02-07 23:32:40,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 869 transitions. [2025-02-07 23:32:40,997 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 869 transitions. Word has length 98 [2025-02-07 23:32:40,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:32:40,997 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 869 transitions. [2025-02-07 23:32:40,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 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-02-07 23:32:40,997 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 869 transitions. [2025-02-07 23:32:40,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-07 23:32:40,998 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:32:40,998 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:32:40,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 23:32:40,998 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:32:40,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:32:40,999 INFO L85 PathProgramCache]: Analyzing trace with hash 998367930, now seen corresponding path program 1 times [2025-02-07 23:32:40,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:32:40,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998328404] [2025-02-07 23:32:40,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:32:40,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:32:41,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-07 23:32:41,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-07 23:32:41,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:32:41,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:32:41,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:32:41,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:32:41,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998328404] [2025-02-07 23:32:41,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998328404] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:32:41,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:32:41,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:32:41,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245205924] [2025-02-07 23:32:41,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:32:41,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:32:41,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:32:41,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:32:41,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:32:41,243 INFO L87 Difference]: Start difference. First operand 585 states and 869 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 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-02-07 23:32:41,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:32:41,494 INFO L93 Difference]: Finished difference Result 1013 states and 1509 transitions. [2025-02-07 23:32:41,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:32:41,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 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) Word has length 98 [2025-02-07 23:32:41,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:32:41,496 INFO L225 Difference]: With dead ends: 1013 [2025-02-07 23:32:41,496 INFO L226 Difference]: Without dead ends: 577 [2025-02-07 23:32:41,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:32:41,497 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 747 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 1939 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:32:41,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 1939 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:32:41,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-02-07 23:32:41,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2025-02-07 23:32:41,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 576 states have (on average 1.4913194444444444) internal successors, (859), 576 states have internal predecessors, (859), 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-02-07 23:32:41,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 859 transitions. [2025-02-07 23:32:41,507 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 859 transitions. Word has length 98 [2025-02-07 23:32:41,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:32:41,507 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 859 transitions. [2025-02-07 23:32:41,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 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-02-07 23:32:41,508 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 859 transitions. [2025-02-07 23:32:41,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-07 23:32:41,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:32:41,508 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:32:41,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 23:32:41,509 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:32:41,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:32:41,509 INFO L85 PathProgramCache]: Analyzing trace with hash -594003877, now seen corresponding path program 1 times [2025-02-07 23:32:41,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:32:41,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632548402] [2025-02-07 23:32:41,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:32:41,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:32:41,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-07 23:32:41,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-07 23:32:41,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:32:41,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:32:41,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:32:41,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:32:41,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632548402] [2025-02-07 23:32:41,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632548402] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:32:41,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:32:41,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:32:41,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562546816] [2025-02-07 23:32:41,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:32:41,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:32:41,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:32:41,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:32:41,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:32:41,738 INFO L87 Difference]: Start difference. First operand 577 states and 859 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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-02-07 23:32:42,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:32:42,122 INFO L93 Difference]: Finished difference Result 1177 states and 1756 transitions. [2025-02-07 23:32:42,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:32:42,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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) Word has length 99 [2025-02-07 23:32:42,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:32:42,125 INFO L225 Difference]: With dead ends: 1177 [2025-02-07 23:32:42,125 INFO L226 Difference]: Without dead ends: 749 [2025-02-07 23:32:42,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:32:42,127 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 988 mSDsluCounter, 1875 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 2523 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:32:42,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 2523 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:32:42,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2025-02-07 23:32:42,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 585. [2025-02-07 23:32:42,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 584 states have (on average 1.4863013698630136) internal successors, (868), 584 states have internal predecessors, (868), 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-02-07 23:32:42,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 868 transitions. [2025-02-07 23:32:42,139 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 868 transitions. Word has length 99 [2025-02-07 23:32:42,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:32:42,139 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 868 transitions. [2025-02-07 23:32:42,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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-02-07 23:32:42,140 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 868 transitions. [2025-02-07 23:32:42,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-07 23:32:42,141 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:32:42,141 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:32:42,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 23:32:42,141 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:32:42,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:32:42,142 INFO L85 PathProgramCache]: Analyzing trace with hash 344284069, now seen corresponding path program 1 times [2025-02-07 23:32:42,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:32:42,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215626998] [2025-02-07 23:32:42,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:32:42,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:32:42,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-07 23:32:42,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-07 23:32:42,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:32:42,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:32:42,182 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 23:32:42,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-07 23:32:42,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-07 23:32:42,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:32:42,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:32:42,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 23:32:42,261 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 23:32:42,262 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 23:32:42,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 23:32:42,266 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:32:42,309 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:32:42,324 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 23:32:42,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 11:32:42 BoogieIcfgContainer [2025-02-07 23:32:42,327 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 23:32:42,327 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 23:32:42,327 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 23:32:42,328 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 23:32:42,350 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:32:32" (3/4) ... [2025-02-07 23:32:42,351 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 23:32:42,352 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 23:32:42,353 INFO L158 Benchmark]: Toolchain (without parser) took 12086.98ms. Allocated memory was 142.6MB in the beginning and 637.5MB in the end (delta: 494.9MB). Free memory was 113.8MB in the beginning and 574.5MB in the end (delta: -460.8MB). Peak memory consumption was 307.1MB. Max. memory is 16.1GB. [2025-02-07 23:32:42,353 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:32:42,353 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.72ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 81.8MB in the end (delta: 32.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-07 23:32:42,353 INFO L158 Benchmark]: Boogie Procedure Inliner took 114.53ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 47.4MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-07 23:32:42,353 INFO L158 Benchmark]: Boogie Preprocessor took 251.36ms. Allocated memory is still 142.6MB. Free memory was 47.4MB in the beginning and 83.5MB in the end (delta: -36.2MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2025-02-07 23:32:42,354 INFO L158 Benchmark]: IcfgBuilder took 1689.96ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 82.8MB in the beginning and 146.4MB in the end (delta: -63.6MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. [2025-02-07 23:32:42,354 INFO L158 Benchmark]: TraceAbstraction took 9614.42ms. Allocated memory was 318.8MB in the beginning and 486.5MB in the end (delta: 167.8MB). Free memory was 146.4MB in the beginning and 155.5MB in the end (delta: -9.1MB). Peak memory consumption was 151.1MB. Max. memory is 16.1GB. [2025-02-07 23:32:42,354 INFO L158 Benchmark]: Witness Printer took 24.46ms. Allocated memory was 486.5MB in the beginning and 637.5MB in the end (delta: 151.0MB). Free memory was 155.5MB in the beginning and 574.5MB in the end (delta: -419.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 23:32:42,355 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.26ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.72ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 81.8MB in the end (delta: 32.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 114.53ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 47.4MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 251.36ms. Allocated memory is still 142.6MB. Free memory was 47.4MB in the beginning and 83.5MB in the end (delta: -36.2MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * IcfgBuilder took 1689.96ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 82.8MB in the beginning and 146.4MB in the end (delta: -63.6MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. * TraceAbstraction took 9614.42ms. Allocated memory was 318.8MB in the beginning and 486.5MB in the end (delta: 167.8MB). Free memory was 146.4MB in the beginning and 155.5MB in the end (delta: -9.1MB). Peak memory consumption was 151.1MB. Max. memory is 16.1GB. * Witness Printer took 24.46ms. Allocated memory was 486.5MB in the beginning and 637.5MB in the end (delta: 151.0MB). Free memory was 155.5MB in the beginning and 574.5MB in the end (delta: -419.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 212. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 32); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (32 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 64); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (64 - 1); [L35] const SORT_215 mask_SORT_215 = (SORT_215)-1 >> (sizeof(SORT_215) * 8 - 4); [L36] const SORT_215 msb_SORT_215 = (SORT_215)1 << (4 - 1); [L38] const SORT_217 mask_SORT_217 = (SORT_217)-1 >> (sizeof(SORT_217) * 8 - 60); [L39] const SORT_217 msb_SORT_217 = (SORT_217)1 << (60 - 1); [L41] const SORT_10 var_11 = 0; [L42] const SORT_1 var_14 = 0; [L43] const SORT_3 var_24 = 0; [L44] const SORT_1 var_51 = 1; [L45] const SORT_3 var_204 = 1; [L46] const SORT_3 var_208 = 3735928559; [L47] const SORT_3 var_211 = 12245771; [L48] const SORT_215 var_216 = 0; [L50] SORT_1 input_2; [L51] SORT_3 input_4; [L52] SORT_3 input_5; [L53] SORT_1 input_6; [L54] SORT_1 input_7; [L55] SORT_1 input_8; [L56] SORT_1 input_9; [L58] EXPR __VERIFIER_nondet_ulong() & mask_SORT_10 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L58] SORT_10 state_12 = __VERIFIER_nondet_ulong() & mask_SORT_10; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L59] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] EXPR __VERIFIER_nondet_ulong() & mask_SORT_10 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L60] SORT_10 state_18 = __VERIFIER_nondet_ulong() & mask_SORT_10; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L61] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L62] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L62] SORT_3 state_25 = __VERIFIER_nondet_uint() & mask_SORT_3; [L63] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L63] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L64] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L64] SORT_3 state_30 = __VERIFIER_nondet_uint() & mask_SORT_3; [L65] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L65] SORT_1 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L66] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L66] SORT_3 state_37 = __VERIFIER_nondet_uint() & mask_SORT_3; [L67] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L67] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L68] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L68] SORT_3 state_42 = __VERIFIER_nondet_uint() & mask_SORT_3; [L69] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L69] SORT_1 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L70] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L71] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L71] SORT_1 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L72] SORT_1 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L73] SORT_1 state_67 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L74] SORT_1 state_69 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L75] SORT_1 state_71 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L76] SORT_1 state_73 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L77] SORT_1 state_75 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L78] SORT_1 state_77 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L79] SORT_1 state_79 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L80] SORT_1 state_81 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L81] SORT_1 state_83 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L82] SORT_1 state_85 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L83] SORT_1 state_220 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L84] SORT_1 state_251 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L85] SORT_1 state_264 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L86] SORT_1 state_269 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] SORT_10 init_13_arg_1 = var_11; [L89] state_12 = init_13_arg_1 [L90] SORT_1 init_16_arg_1 = var_14; [L91] state_15 = init_16_arg_1 [L92] SORT_10 init_19_arg_1 = var_11; [L93] state_18 = init_19_arg_1 [L94] SORT_1 init_21_arg_1 = var_14; [L95] state_20 = init_21_arg_1 [L96] SORT_3 init_26_arg_1 = var_24; [L97] state_25 = init_26_arg_1 [L98] SORT_1 init_28_arg_1 = var_14; [L99] state_27 = init_28_arg_1 [L100] SORT_3 init_31_arg_1 = var_24; [L101] state_30 = init_31_arg_1 [L102] SORT_1 init_33_arg_1 = var_14; [L103] state_32 = init_33_arg_1 [L104] SORT_3 init_38_arg_1 = var_24; [L105] state_37 = init_38_arg_1 [L106] SORT_1 init_40_arg_1 = var_14; [L107] state_39 = init_40_arg_1 [L108] SORT_3 init_43_arg_1 = var_24; [L109] state_42 = init_43_arg_1 [L110] SORT_1 init_45_arg_1 = var_14; [L111] state_44 = init_45_arg_1 [L112] SORT_1 init_62_arg_1 = var_14; [L113] state_61 = init_62_arg_1 [L114] SORT_1 init_64_arg_1 = var_14; [L115] state_63 = init_64_arg_1 [L116] SORT_1 init_66_arg_1 = var_14; [L117] state_65 = init_66_arg_1 [L118] SORT_1 init_68_arg_1 = var_14; [L119] state_67 = init_68_arg_1 [L120] SORT_1 init_70_arg_1 = var_14; [L121] state_69 = init_70_arg_1 [L122] SORT_1 init_72_arg_1 = var_14; [L123] state_71 = init_72_arg_1 [L124] SORT_1 init_74_arg_1 = var_14; [L125] state_73 = init_74_arg_1 [L126] SORT_1 init_76_arg_1 = var_14; [L127] state_75 = init_76_arg_1 [L128] SORT_1 init_78_arg_1 = var_14; [L129] state_77 = init_78_arg_1 [L130] SORT_1 init_80_arg_1 = var_14; [L131] state_79 = init_80_arg_1 [L132] SORT_1 init_82_arg_1 = var_14; [L133] state_81 = init_82_arg_1 [L134] SORT_1 init_84_arg_1 = var_14; [L135] state_83 = init_84_arg_1 [L136] SORT_1 init_86_arg_1 = var_14; [L137] state_85 = init_86_arg_1 [L138] SORT_1 init_221_arg_1 = var_14; [L139] state_220 = init_221_arg_1 [L140] SORT_1 init_252_arg_1 = var_14; [L141] state_251 = init_252_arg_1 [L142] SORT_1 init_265_arg_1 = var_14; [L143] state_264 = init_265_arg_1 [L144] SORT_1 init_270_arg_1 = var_14; [L145] state_269 = init_270_arg_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_12=0, state_15=0, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L148] input_2 = __VERIFIER_nondet_uchar() [L149] input_4 = __VERIFIER_nondet_uint() [L150] EXPR input_4 & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_12=0, state_15=0, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L150] input_4 = input_4 & mask_SORT_3 [L151] input_5 = __VERIFIER_nondet_uint() [L152] EXPR input_5 & mask_SORT_3 VAL [input_4=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_12=0, state_15=0, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L152] input_5 = input_5 & mask_SORT_3 [L153] input_6 = __VERIFIER_nondet_uchar() [L154] EXPR input_6 & mask_SORT_1 VAL [input_4=0, input_5=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_12=0, state_15=0, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L154] input_6 = input_6 & mask_SORT_1 [L155] input_7 = __VERIFIER_nondet_uchar() [L156] EXPR input_7 & mask_SORT_1 VAL [input_4=0, input_5=0, input_6=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_12=0, state_15=0, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L156] input_7 = input_7 & mask_SORT_1 [L157] input_8 = __VERIFIER_nondet_uchar() [L158] EXPR input_8 & mask_SORT_1 VAL [input_4=0, input_5=0, input_6=0, input_7=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_12=0, state_15=0, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L158] input_8 = input_8 & mask_SORT_1 [L159] input_9 = __VERIFIER_nondet_uchar() [L160] EXPR input_9 & mask_SORT_1 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_12=0, state_15=0, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L160] input_9 = input_9 & mask_SORT_1 [L163] SORT_1 var_17_arg_0 = state_15; [L164] SORT_10 var_17_arg_1 = state_12; [L165] SORT_10 var_17_arg_2 = var_11; [L166] SORT_10 var_17 = var_17_arg_0 ? var_17_arg_1 : var_17_arg_2; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_17=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L167] EXPR var_17 & mask_SORT_10 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L167] var_17 = var_17 & mask_SORT_10 [L168] SORT_1 var_22_arg_0 = state_20; [L169] SORT_10 var_22_arg_1 = state_18; [L170] SORT_10 var_22_arg_2 = var_11; [L171] SORT_10 var_22 = var_22_arg_0 ? var_22_arg_1 : var_22_arg_2; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_17=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_22=0, var_24=0, var_51=1] [L172] EXPR var_22 & mask_SORT_10 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_17=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L172] var_22 = var_22 & mask_SORT_10 [L173] SORT_10 var_23_arg_0 = var_17; [L174] SORT_10 var_23_arg_1 = var_22; [L175] SORT_1 var_23 = var_23_arg_0 == var_23_arg_1; [L176] SORT_1 var_29_arg_0 = state_27; [L177] SORT_3 var_29_arg_1 = state_25; [L178] SORT_3 var_29_arg_2 = var_24; [L179] SORT_3 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_23=1, var_24=0, var_29=0, var_51=1] [L180] EXPR var_29 & mask_SORT_3 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_23=1, var_24=0, var_51=1] [L180] var_29 = var_29 & mask_SORT_3 [L181] SORT_1 var_34_arg_0 = state_32; [L182] SORT_3 var_34_arg_1 = state_30; [L183] SORT_3 var_34_arg_2 = var_24; [L184] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_23=1, var_24=0, var_29=0, var_34=0, var_51=1] [L185] EXPR var_34 & mask_SORT_3 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_23=1, var_24=0, var_29=0, var_51=1] [L185] var_34 = var_34 & mask_SORT_3 [L186] SORT_3 var_35_arg_0 = var_29; [L187] SORT_3 var_35_arg_1 = var_34; [L188] SORT_1 var_35 = var_35_arg_0 == var_35_arg_1; [L189] SORT_1 var_36_arg_0 = var_23; [L190] SORT_1 var_36_arg_1 = var_35; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_36_arg_0=1, var_36_arg_1=1, var_51=1] [L191] EXPR var_36_arg_0 & var_36_arg_1 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L191] SORT_1 var_36 = var_36_arg_0 & var_36_arg_1; [L192] SORT_1 var_41_arg_0 = state_39; [L193] SORT_3 var_41_arg_1 = state_37; [L194] SORT_3 var_41_arg_2 = var_24; [L195] SORT_3 var_41 = var_41_arg_0 ? var_41_arg_1 : var_41_arg_2; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_36=1, var_41=0, var_51=1] [L196] EXPR var_41 & mask_SORT_3 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_36=1, var_51=1] [L196] var_41 = var_41 & mask_SORT_3 [L197] SORT_1 var_46_arg_0 = state_44; [L198] SORT_3 var_46_arg_1 = state_42; [L199] SORT_3 var_46_arg_2 = var_24; [L200] SORT_3 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_36=1, var_41=0, var_46=0, var_51=1] [L201] EXPR var_46 & mask_SORT_3 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_36=1, var_41=0, var_51=1] [L201] var_46 = var_46 & mask_SORT_3 [L202] SORT_3 var_47_arg_0 = var_41; [L203] SORT_3 var_47_arg_1 = var_46; [L204] SORT_1 var_47 = var_47_arg_0 == var_47_arg_1; [L205] SORT_1 var_48_arg_0 = var_36; [L206] SORT_1 var_48_arg_1 = var_47; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_48_arg_0=1, var_48_arg_1=1, var_51=1] [L207] EXPR var_48_arg_0 & var_48_arg_1 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L207] SORT_1 var_48 = var_48_arg_0 & var_48_arg_1; [L208] SORT_1 var_52_arg_0 = var_48; [L209] SORT_1 var_52 = ~var_52_arg_0; [L210] SORT_1 var_53_arg_0 = var_51; [L211] SORT_1 var_53_arg_1 = var_52; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1, var_53_arg_0=1, var_53_arg_1=-2] [L212] EXPR var_53_arg_0 & var_53_arg_1 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L212] SORT_1 var_53 = var_53_arg_0 & var_53_arg_1; [L213] EXPR var_53 & mask_SORT_1 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L213] var_53 = var_53 & mask_SORT_1 [L214] SORT_1 bad_54_arg_0 = var_53; [L215] CALL __VERIFIER_assert(!(bad_54_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 521 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6594 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6594 mSDsluCounter, 29610 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21814 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6363 IncrementalHoareTripleChecker+Invalid, 6373 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 7796 mSDtfsCounter, 6363 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=589occurred in iteration=8, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 824 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1265 NumberOfCodeBlocks, 1265 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1154 ConstructedInterpolants, 0 QuantifiedInterpolants, 2865 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-07 23:32:42,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul8.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 64bit --witnessprinter.graph.data.programhash 2c23b24996a641290a5102e8d144e57f15ff0408b05b341b054ce62885ea247c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:32:44,405 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:32:44,489 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-07 23:32:44,493 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:32:44,493 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:32:44,517 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:32:44,518 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:32:44,518 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:32:44,518 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:32:44,518 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:32:44,519 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:32:44,519 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:32:44,519 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:32:44,519 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:32:44,520 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:32:44,520 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:32:44,520 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:32:44,520 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:32:44,520 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:32:44,520 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:32:44,521 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:32:44,521 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 23:32:44,521 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 23:32:44,521 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 23:32:44,521 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:32:44,521 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:32:44,521 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:32:44,521 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:32:44,521 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:32:44,522 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:32:44,522 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:32:44,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:32:44,522 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:32:44,522 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:32:44,522 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:32:44,522 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:32:44,523 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 23:32:44,523 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 23:32:44,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:32:44,523 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:32:44,523 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:32:44,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:32:44,524 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-jdk21/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2c23b24996a641290a5102e8d144e57f15ff0408b05b341b054ce62885ea247c [2025-02-07 23:32:44,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:32:44,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:32:44,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:32:44,797 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:32:44,797 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:32:44,798 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul8.c [2025-02-07 23:32:46,042 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9828e0699/150195215f344176b1a9688d9f3387e9/FLAG3fbc75f5e [2025-02-07 23:32:46,295 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:32:46,295 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul8.c [2025-02-07 23:32:46,308 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9828e0699/150195215f344176b1a9688d9f3387e9/FLAG3fbc75f5e [2025-02-07 23:32:46,325 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9828e0699/150195215f344176b1a9688d9f3387e9 [2025-02-07 23:32:46,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:32:46,329 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:32:46,332 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:32:46,332 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:32:46,336 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:32:46,337 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:32:46" (1/1) ... [2025-02-07 23:32:46,337 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a9e2e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:46, skipping insertion in model container [2025-02-07 23:32:46,337 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:32:46" (1/1) ... [2025-02-07 23:32:46,371 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:32:46,496 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul8.c[1244,1257] [2025-02-07 23:32:46,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:32:46,613 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:32:46,623 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul8.c[1244,1257] [2025-02-07 23:32:46,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:32:46,729 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:32:46,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:46 WrapperNode [2025-02-07 23:32:46,730 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:32:46,732 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:32:46,736 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:32:46,737 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:32:46,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:46" (1/1) ... [2025-02-07 23:32:46,757 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:46" (1/1) ... [2025-02-07 23:32:46,788 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 735 [2025-02-07 23:32:46,788 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:32:46,789 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:32:46,789 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:32:46,789 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:32:46,796 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:46" (1/1) ... [2025-02-07 23:32:46,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:46" (1/1) ... [2025-02-07 23:32:46,801 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:46" (1/1) ... [2025-02-07 23:32:46,821 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-02-07 23:32:46,822 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:46" (1/1) ... [2025-02-07 23:32:46,822 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:46" (1/1) ... [2025-02-07 23:32:46,833 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:46" (1/1) ... [2025-02-07 23:32:46,835 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:46" (1/1) ... [2025-02-07 23:32:46,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:46" (1/1) ... [2025-02-07 23:32:46,841 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:46" (1/1) ... [2025-02-07 23:32:46,845 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:32:46,846 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:32:46,846 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:32:46,847 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:32:46,847 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:46" (1/1) ... [2025-02-07 23:32:46,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:32:46,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:32:46,887 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 23:32:46,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 23:32:46,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:32:46,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 23:32:46,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-07 23:32:46,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:32:46,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:32:47,082 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:32:47,084 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:32:47,899 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2025-02-07 23:32:47,899 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:32:47,906 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:32:47,907 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:32:47,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:32:47 BoogieIcfgContainer [2025-02-07 23:32:47,907 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:32:47,908 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:32:47,908 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:32:47,912 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:32:47,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:32:46" (1/3) ... [2025-02-07 23:32:47,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3781f606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:32:47, skipping insertion in model container [2025-02-07 23:32:47,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:46" (2/3) ... [2025-02-07 23:32:47,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3781f606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:32:47, skipping insertion in model container [2025-02-07 23:32:47,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:32:47" (3/3) ... [2025-02-07 23:32:47,914 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul8.c [2025-02-07 23:32:47,925 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:32:47,926 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.mul8.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:32:47,959 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:32:47,967 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;@438ef581, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:32:47,968 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:32:47,971 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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-02-07 23:32:47,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 23:32:47,975 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:32:47,976 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 23:32:47,976 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:32:47,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:32:47,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-07 23:32:47,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:32:47,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1322794544] [2025-02-07 23:32:47,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:32:47,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:32:47,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:32:47,993 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 23:32:47,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 23:32:48,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 23:32:48,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 23:32:48,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:32:48,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:32:48,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-02-07 23:32:48,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:32:48,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:32:48,622 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 23:32:48,623 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 23:32:48,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322794544] [2025-02-07 23:32:48,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322794544] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:32:48,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:32:48,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 23:32:48,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529655159] [2025-02-07 23:32:48,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:32:48,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:32:48,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 23:32:48,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:32:48,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:32:48,643 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-02-07 23:32:48,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:32:48,810 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2025-02-07 23:32:48,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:32:48,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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) Word has length 4 [2025-02-07 23:32:48,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:32:48,816 INFO L225 Difference]: With dead ends: 15 [2025-02-07 23:32:48,817 INFO L226 Difference]: Without dead ends: 8 [2025-02-07 23:32:48,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:32:48,820 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:32:48,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:32:48,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2025-02-07 23:32:48,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-02-07 23:32:48,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-02-07 23:32:48,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-07 23:32:48,841 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-07 23:32:48,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:32:48,841 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-07 23:32:48,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-02-07 23:32:48,841 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-07 23:32:48,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 23:32:48,842 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:32:48,842 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-07 23:32:48,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 23:32:49,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:32:49,044 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:32:49,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:32:49,045 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-07 23:32:49,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:32:49,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1149539086] [2025-02-07 23:32:49,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:32:49,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:32:49,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:32:49,049 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 23:32:49,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 23:32:49,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 23:32:49,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 23:32:49,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:32:49,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:32:49,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-02-07 23:32:49,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:32:50,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:32:50,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:33:11,524 WARN L249 Executor]: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-02-07 23:33:11,524 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 23:33:11,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149539086] [2025-02-07 23:33:11,525 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-02-07 23:33:11,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2025-02-07 23:33:11,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 23:33:11,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:33:11,726 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:912) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:555) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 45 more [2025-02-07 23:33:11,732 INFO L158 Benchmark]: Toolchain (without parser) took 25402.66ms. Allocated memory was 117.4MB in the beginning and 528.5MB in the end (delta: 411.0MB). Free memory was 90.6MB in the beginning and 402.0MB in the end (delta: -311.3MB). Peak memory consumption was 96.8MB. Max. memory is 16.1GB. [2025-02-07 23:33:11,732 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory was 61.7MB in the beginning and 61.7MB in the end (delta: 34.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:33:11,732 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.17ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 64.0MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-07 23:33:11,732 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.96ms. Allocated memory is still 117.4MB. Free memory was 64.0MB in the beginning and 58.3MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 23:33:11,732 INFO L158 Benchmark]: Boogie Preprocessor took 56.92ms. Allocated memory is still 117.4MB. Free memory was 58.3MB in the beginning and 52.5MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 23:33:11,733 INFO L158 Benchmark]: IcfgBuilder took 1060.77ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 52.5MB in the beginning and 133.9MB in the end (delta: -81.3MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2025-02-07 23:33:11,733 INFO L158 Benchmark]: TraceAbstraction took 23822.83ms. Allocated memory was 167.8MB in the beginning and 528.5MB in the end (delta: 360.7MB). Free memory was 132.8MB in the beginning and 402.0MB in the end (delta: -269.2MB). Peak memory consumption was 87.8MB. Max. memory is 16.1GB. [2025-02-07 23:33:11,734 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.20ms. Allocated memory is still 83.9MB. Free memory was 61.7MB in the beginning and 61.7MB in the end (delta: 34.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.17ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 64.0MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.96ms. Allocated memory is still 117.4MB. Free memory was 64.0MB in the beginning and 58.3MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.92ms. Allocated memory is still 117.4MB. Free memory was 58.3MB in the beginning and 52.5MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1060.77ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 52.5MB in the beginning and 133.9MB in the end (delta: -81.3MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. * TraceAbstraction took 23822.83ms. Allocated memory was 167.8MB in the beginning and 528.5MB in the end (delta: 360.7MB). Free memory was 132.8MB in the beginning and 402.0MB in the end (delta: -269.2MB). Peak memory consumption was 87.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")