./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-84.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ef53c0bbc15a34f2b98e209c72e5a20e457b197773f70e6e1b41920252205f6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:58:56,374 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:58:56,436 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:58:56,440 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:58:56,440 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:58:56,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:58:56,458 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:58:56,458 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:58:56,459 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:58:56,459 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:58:56,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:58:56,460 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:58:56,460 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:58:56,460 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:58:56,460 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:58:56,461 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:58:56,461 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:58:56,461 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:58:56,461 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:58:56,461 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:58:56,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:58:56,462 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:58:56,462 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:58:56,462 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:58:56,462 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:58:56,462 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:58:56,462 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:58:56,462 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:58:56,462 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:58:56,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:58:56,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:58:56,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:58:56,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:58:56,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:58:56,463 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:58:56,463 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:58:56,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:58:56,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:58:56,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:58:56,464 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:58:56,464 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:58:56,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:58:56,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:58:56,464 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ef53c0bbc15a34f2b98e209c72e5a20e457b197773f70e6e1b41920252205f6 [2025-03-17 02:58:56,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:58:56,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:58:56,695 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:58:56,696 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:58:56,696 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:58:56,701 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-84.i [2025-03-17 02:58:57,923 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e84f83584/07fd987638754eb095a70df4eed18659/FLAG0365b294c [2025-03-17 02:58:58,228 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:58:58,229 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-84.i [2025-03-17 02:58:58,238 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e84f83584/07fd987638754eb095a70df4eed18659/FLAG0365b294c [2025-03-17 02:58:58,520 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e84f83584/07fd987638754eb095a70df4eed18659 [2025-03-17 02:58:58,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:58:58,524 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:58:58,525 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:58:58,525 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:58:58,528 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:58:58,529 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:58:58" (1/1) ... [2025-03-17 02:58:58,530 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d81f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:58, skipping insertion in model container [2025-03-17 02:58:58,530 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:58:58" (1/1) ... [2025-03-17 02:58:58,547 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:58:58,706 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-84.i[916,929] [2025-03-17 02:58:58,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:58:58,769 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:58:58,778 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-84.i[916,929] [2025-03-17 02:58:58,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:58:58,817 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:58:58,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:58 WrapperNode [2025-03-17 02:58:58,819 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:58:58,820 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:58:58,820 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:58:58,820 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:58:58,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:58" (1/1) ... [2025-03-17 02:58:58,839 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:58" (1/1) ... [2025-03-17 02:58:58,875 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2025-03-17 02:58:58,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:58:58,876 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:58:58,880 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:58:58,881 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:58:58,888 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:58" (1/1) ... [2025-03-17 02:58:58,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:58" (1/1) ... [2025-03-17 02:58:58,895 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:58" (1/1) ... [2025-03-17 02:58:58,907 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 02:58:58,908 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:58" (1/1) ... [2025-03-17 02:58:58,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:58" (1/1) ... [2025-03-17 02:58:58,912 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:58" (1/1) ... [2025-03-17 02:58:58,917 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:58" (1/1) ... [2025-03-17 02:58:58,918 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:58" (1/1) ... [2025-03-17 02:58:58,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:58" (1/1) ... [2025-03-17 02:58:58,926 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:58:58,927 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:58:58,927 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:58:58,927 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:58:58,928 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:58" (1/1) ... [2025-03-17 02:58:58,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:58:58,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:58:58,957 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 02:58:58,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 02:58:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:58:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:58:58,978 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:58:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:58:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:58:58,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:58:59,031 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:58:59,033 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:58:59,236 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 02:58:59,236 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:58:59,243 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:58:59,243 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:58:59,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:58:59 BoogieIcfgContainer [2025-03-17 02:58:59,244 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:58:59,246 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:58:59,246 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:58:59,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:58:59,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:58:58" (1/3) ... [2025-03-17 02:58:59,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4145410c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:58:59, skipping insertion in model container [2025-03-17 02:58:59,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:58:58" (2/3) ... [2025-03-17 02:58:59,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4145410c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:58:59, skipping insertion in model container [2025-03-17 02:58:59,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:58:59" (3/3) ... [2025-03-17 02:58:59,253 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-84.i [2025-03-17 02:58:59,264 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:58:59,266 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-84.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:58:59,301 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:58:59,308 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4f71caf0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:58:59,309 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:58:59,311 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 02:58:59,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 02:58:59,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:58:59,319 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 02:58:59,319 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:58:59,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:58:59,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1676047734, now seen corresponding path program 1 times [2025-03-17 02:58:59,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:58:59,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943499281] [2025-03-17 02:58:59,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:58:59,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:58:59,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 02:58:59,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 02:58:59,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:58:59,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:58:59,564 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-17 02:58:59,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:58:59,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943499281] [2025-03-17 02:58:59,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943499281] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:58:59,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344991207] [2025-03-17 02:58:59,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:58:59,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:58:59,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:58:59,569 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:58:59,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 02:58:59,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 02:58:59,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 02:58:59,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:58:59,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:58:59,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:58:59,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:58:59,715 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-17 02:58:59,715 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:58:59,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344991207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:58:59,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:58:59,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:58:59,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643969432] [2025-03-17 02:58:59,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:58:59,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:58:59,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:58:59,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:58:59,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:58:59,739 INFO L87 Difference]: Start difference. First operand has 50 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 02:58:59,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:58:59,760 INFO L93 Difference]: Finished difference Result 97 states and 173 transitions. [2025-03-17 02:58:59,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:58:59,762 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 125 [2025-03-17 02:58:59,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:58:59,766 INFO L225 Difference]: With dead ends: 97 [2025-03-17 02:58:59,766 INFO L226 Difference]: Without dead ends: 48 [2025-03-17 02:58:59,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:58:59,770 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:58:59,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:58:59,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-17 02:58:59,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-17 02:58:59,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 02:58:59,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 73 transitions. [2025-03-17 02:58:59,807 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 73 transitions. Word has length 125 [2025-03-17 02:58:59,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:58:59,808 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 73 transitions. [2025-03-17 02:58:59,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 02:58:59,808 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 73 transitions. [2025-03-17 02:58:59,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 02:58:59,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:58:59,811 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 02:58:59,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 02:59:00,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 02:59:00,015 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:00,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:00,016 INFO L85 PathProgramCache]: Analyzing trace with hash -63511895, now seen corresponding path program 1 times [2025-03-17 02:59:00,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:59:00,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122729135] [2025-03-17 02:59:00,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:00,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:59:00,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 02:59:00,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 02:59:00,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:00,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:08,210 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 02:59:08,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:59:08,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122729135] [2025-03-17 02:59:08,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122729135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:59:08,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:59:08,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 02:59:08,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037370447] [2025-03-17 02:59:08,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:59:08,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:59:08,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:59:08,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:59:08,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:59:08,213 INFO L87 Difference]: Start difference. First operand 48 states and 73 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 02:59:11,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:59:11,959 INFO L93 Difference]: Finished difference Result 116 states and 171 transitions. [2025-03-17 02:59:11,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 02:59:11,959 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 125 [2025-03-17 02:59:11,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:59:11,961 INFO L225 Difference]: With dead ends: 116 [2025-03-17 02:59:11,961 INFO L226 Difference]: Without dead ends: 114 [2025-03-17 02:59:11,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2025-03-17 02:59:11,962 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 88 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 02:59:11,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 292 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 02:59:11,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-17 02:59:11,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2025-03-17 02:59:11,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 57 states have (on average 1.280701754385965) internal successors, (73), 57 states have internal predecessors, (73), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 02:59:11,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 157 transitions. [2025-03-17 02:59:11,987 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 157 transitions. Word has length 125 [2025-03-17 02:59:11,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:59:11,988 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 157 transitions. [2025-03-17 02:59:11,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 02:59:11,988 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 157 transitions. [2025-03-17 02:59:11,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 02:59:11,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:11,989 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 02:59:11,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 02:59:11,989 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:11,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:11,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1679298440, now seen corresponding path program 1 times [2025-03-17 02:59:11,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:59:11,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936300342] [2025-03-17 02:59:11,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:11,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:59:11,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 02:59:12,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 02:59:12,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:12,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:12,126 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 02:59:12,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:59:12,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936300342] [2025-03-17 02:59:12,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936300342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:59:12,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:59:12,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 02:59:12,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875330879] [2025-03-17 02:59:12,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:59:12,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 02:59:12,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:59:12,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 02:59:12,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:59:12,130 INFO L87 Difference]: Start difference. First operand 102 states and 157 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 02:59:12,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:59:12,251 INFO L93 Difference]: Finished difference Result 198 states and 303 transitions. [2025-03-17 02:59:12,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 02:59:12,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 125 [2025-03-17 02:59:12,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:59:12,256 INFO L225 Difference]: With dead ends: 198 [2025-03-17 02:59:12,256 INFO L226 Difference]: Without dead ends: 97 [2025-03-17 02:59:12,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:59:12,258 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 46 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:59:12,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 275 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:59:12,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-17 02:59:12,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2025-03-17 02:59:12,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 50 states have (on average 1.2) internal successors, (60), 50 states have internal predecessors, (60), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 02:59:12,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 144 transitions. [2025-03-17 02:59:12,272 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 144 transitions. Word has length 125 [2025-03-17 02:59:12,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:59:12,273 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 144 transitions. [2025-03-17 02:59:12,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 02:59:12,273 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 144 transitions. [2025-03-17 02:59:12,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-17 02:59:12,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:12,278 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:59:12,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 02:59:12,279 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:12,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:12,280 INFO L85 PathProgramCache]: Analyzing trace with hash -799960082, now seen corresponding path program 1 times [2025-03-17 02:59:12,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:59:12,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516316462] [2025-03-17 02:59:12,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:12,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:59:12,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-17 02:59:12,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-17 02:59:12,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:12,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:16,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3483 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3476 trivial. 0 not checked. [2025-03-17 02:59:16,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:59:16,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516316462] [2025-03-17 02:59:16,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516316462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:59:16,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:59:16,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 02:59:16,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079630551] [2025-03-17 02:59:16,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:59:16,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 02:59:16,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:59:16,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 02:59:16,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:59:16,554 INFO L87 Difference]: Start difference. First operand 95 states and 144 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 02:59:16,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:59:16,819 INFO L93 Difference]: Finished difference Result 124 states and 177 transitions. [2025-03-17 02:59:16,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 02:59:16,819 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 250 [2025-03-17 02:59:16,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:59:16,822 INFO L225 Difference]: With dead ends: 124 [2025-03-17 02:59:16,822 INFO L226 Difference]: Without dead ends: 122 [2025-03-17 02:59:16,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:59:16,823 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 46 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:59:16,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 250 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:59:16,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-17 02:59:16,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 97. [2025-03-17 02:59:16,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 02:59:16,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 147 transitions. [2025-03-17 02:59:16,838 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 147 transitions. Word has length 250 [2025-03-17 02:59:16,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:59:16,839 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 147 transitions. [2025-03-17 02:59:16,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 02:59:16,839 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 147 transitions. [2025-03-17 02:59:16,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-17 02:59:16,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:16,843 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:59:16,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 02:59:16,844 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:16,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:16,844 INFO L85 PathProgramCache]: Analyzing trace with hash -771330931, now seen corresponding path program 1 times [2025-03-17 02:59:16,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:59:16,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190377772] [2025-03-17 02:59:16,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:16,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:59:16,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-17 02:59:16,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-17 02:59:16,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:16,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:22,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3483 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3476 trivial. 0 not checked. [2025-03-17 02:59:22,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:59:22,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190377772] [2025-03-17 02:59:22,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190377772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:59:22,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:59:22,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 02:59:22,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226967640] [2025-03-17 02:59:22,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:59:22,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 02:59:22,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:59:22,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 02:59:22,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:59:22,405 INFO L87 Difference]: Start difference. First operand 97 states and 147 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 02:59:22,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:59:22,987 INFO L93 Difference]: Finished difference Result 113 states and 168 transitions. [2025-03-17 02:59:22,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 02:59:22,988 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 250 [2025-03-17 02:59:22,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:59:22,989 INFO L225 Difference]: With dead ends: 113 [2025-03-17 02:59:22,989 INFO L226 Difference]: Without dead ends: 111 [2025-03-17 02:59:22,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:59:22,990 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 24 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:59:22,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 234 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 02:59:22,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-17 02:59:23,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2025-03-17 02:59:23,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 states have internal predecessors, (72), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 02:59:23,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 156 transitions. [2025-03-17 02:59:23,003 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 156 transitions. Word has length 250 [2025-03-17 02:59:23,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:59:23,004 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 156 transitions. [2025-03-17 02:59:23,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 02:59:23,004 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 156 transitions. [2025-03-17 02:59:23,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-17 02:59:23,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:23,008 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:59:23,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 02:59:23,008 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:23,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:23,009 INFO L85 PathProgramCache]: Analyzing trace with hash 971479404, now seen corresponding path program 1 times [2025-03-17 02:59:23,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:59:23,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621257245] [2025-03-17 02:59:23,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:23,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:59:23,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-17 02:59:23,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-17 02:59:23,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:23,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:28,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3483 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3476 trivial. 0 not checked. [2025-03-17 02:59:28,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:59:28,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621257245] [2025-03-17 02:59:28,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621257245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:59:28,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:59:28,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 02:59:28,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013640467] [2025-03-17 02:59:28,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:59:28,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 02:59:28,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:59:28,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 02:59:28,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:59:28,492 INFO L87 Difference]: Start difference. First operand 102 states and 156 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 02:59:29,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:59:29,491 INFO L93 Difference]: Finished difference Result 129 states and 193 transitions. [2025-03-17 02:59:29,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 02:59:29,491 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 250 [2025-03-17 02:59:29,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:59:29,492 INFO L225 Difference]: With dead ends: 129 [2025-03-17 02:59:29,492 INFO L226 Difference]: Without dead ends: 127 [2025-03-17 02:59:29,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:59:29,493 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 29 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 02:59:29,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 275 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 02:59:29,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-17 02:59:29,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 102. [2025-03-17 02:59:29,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 states have internal predecessors, (72), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 02:59:29,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 156 transitions. [2025-03-17 02:59:29,503 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 156 transitions. Word has length 250 [2025-03-17 02:59:29,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:59:29,503 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 156 transitions. [2025-03-17 02:59:29,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 02:59:29,504 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 156 transitions. [2025-03-17 02:59:29,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-17 02:59:29,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:29,505 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:59:29,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 02:59:29,506 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:29,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:29,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1858983085, now seen corresponding path program 1 times [2025-03-17 02:59:29,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:59:29,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814243754] [2025-03-17 02:59:29,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:29,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:59:29,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-17 02:59:29,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-17 02:59:29,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:29,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:32,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3483 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3476 trivial. 0 not checked. [2025-03-17 02:59:32,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:59:32,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814243754] [2025-03-17 02:59:32,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814243754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:59:32,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:59:32,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 02:59:32,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025528003] [2025-03-17 02:59:32,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:59:32,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 02:59:32,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:59:32,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 02:59:32,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:59:32,963 INFO L87 Difference]: Start difference. First operand 102 states and 156 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 02:59:33,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:59:33,792 INFO L93 Difference]: Finished difference Result 103 states and 157 transitions. [2025-03-17 02:59:33,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 02:59:33,793 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 250 [2025-03-17 02:59:33,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:59:33,793 INFO L225 Difference]: With dead ends: 103 [2025-03-17 02:59:33,793 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 02:59:33,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:59:33,795 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:59:33,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 302 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:59:33,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 02:59:33,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 02:59:33,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 02:59:33,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 02:59:33,796 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 250 [2025-03-17 02:59:33,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:59:33,796 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 02:59:33,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 02:59:33,796 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 02:59:33,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 02:59:33,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 02:59:33,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 02:59:33,802 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:59:33,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 02:59:35,477 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 02:59:35,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:59:35 BoogieIcfgContainer [2025-03-17 02:59:35,503 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 02:59:35,504 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 02:59:35,504 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 02:59:35,504 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 02:59:35,509 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:58:59" (3/4) ... [2025-03-17 02:59:35,510 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 02:59:35,519 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 02:59:35,525 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-17 02:59:35,526 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 02:59:35,526 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 02:59:35,526 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 02:59:35,609 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 02:59:35,609 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 02:59:35,609 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 02:59:35,611 INFO L158 Benchmark]: Toolchain (without parser) took 37086.21ms. Allocated memory was 167.8MB in the beginning and 838.9MB in the end (delta: 671.1MB). Free memory was 122.7MB in the beginning and 725.6MB in the end (delta: -602.9MB). Peak memory consumption was 63.5MB. Max. memory is 16.1GB. [2025-03-17 02:59:35,611 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 201.3MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:59:35,611 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.02ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 109.6MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:59:35,612 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.14ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 106.6MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:59:35,612 INFO L158 Benchmark]: Boogie Preprocessor took 49.58ms. Allocated memory is still 167.8MB. Free memory was 106.3MB in the beginning and 101.3MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:59:35,612 INFO L158 Benchmark]: IcfgBuilder took 317.20ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 81.4MB in the end (delta: 19.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 02:59:35,612 INFO L158 Benchmark]: TraceAbstraction took 36257.72ms. Allocated memory was 167.8MB in the beginning and 838.9MB in the end (delta: 671.1MB). Free memory was 80.8MB in the beginning and 734.0MB in the end (delta: -653.2MB). Peak memory consumption was 451.4MB. Max. memory is 16.1GB. [2025-03-17 02:59:35,612 INFO L158 Benchmark]: Witness Printer took 105.16ms. Allocated memory is still 838.9MB. Free memory was 734.0MB in the beginning and 725.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:59:35,613 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.33ms. Allocated memory is still 201.3MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.02ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 109.6MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.14ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 106.6MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.58ms. Allocated memory is still 167.8MB. Free memory was 106.3MB in the beginning and 101.3MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 317.20ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 81.4MB in the end (delta: 19.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 36257.72ms. Allocated memory was 167.8MB in the beginning and 838.9MB in the end (delta: 671.1MB). Free memory was 80.8MB in the beginning and 734.0MB in the end (delta: -653.2MB). Peak memory consumption was 451.4MB. Max. memory is 16.1GB. * Witness Printer took 105.16ms. Allocated memory is still 838.9MB. Free memory was 734.0MB in the beginning and 725.6MB in the end (delta: 8.4MB). 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 98 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.5s, OverallIterations: 7, TraceHistogramMax: 42, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 243 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 243 mSDsluCounter, 1701 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1249 mSDsCounter, 147 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 574 IncrementalHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 147 mSolverCounterUnsat, 452 mSDtfsCounter, 574 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=2, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 73 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 26.8s InterpolantComputationTime, 1500 NumberOfCodeBlocks, 1500 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1492 ConstructedInterpolants, 0 QuantifiedInterpolants, 9954 SizeOfPredicates, 0 NumberOfNonLiveVariables, 288 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 17252/17292 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 107]: Location Invariant Derived location invariant: ((((var_1_11 + 4) <= 0) && ((last_1_var_1_11 + 4) <= 0)) || (((((((((((var_1_4 * 65535) + var_1_13) % 65536) < 32768) || (((var_1_16 == 24) || (var_1_10 < var_1_5)) && (((65536 + var_1_16) == (((var_1_4 * 65535) + var_1_13) % 65536)) || (var_1_5 < (var_1_10 + 1))))) && (((((((var_1_13 < var_1_14) || ((65536 + var_1_11) == (((((var_1_15 * 65535) + var_1_16) + var_1_14) >= 0) ? ((((var_1_15 * 65535) + var_1_16) + var_1_14) % 65536) : (((((var_1_15 * 65535) + var_1_16) + var_1_14) % 65536) + 65536)))) || ((((((-1 * var_1_14) + var_1_13) >= 0) ? ((-8 / ((-1 * var_1_14) + var_1_13)) - 1) : ((-8 / ((-1 * var_1_14) + var_1_13)) + 1)) + 1) < var_1_6)) && (((65536 + var_1_11) == (((((var_1_15 * 65535) + var_1_16) + var_1_14) >= 0) ? ((((var_1_15 * 65535) + var_1_16) + var_1_14) % 65536) : (((((var_1_15 * 65535) + var_1_16) + var_1_14) % 65536) + 65536))) || (((((-1 * var_1_14) + var_1_13) >= 0) ? ((-8 / ((-1 * var_1_14) + var_1_13)) - 1) : ((-8 / ((-1 * var_1_14) + var_1_13)) + 1)) < (var_1_6 + 1)))) || ((((((var_1_15 * 65535) + var_1_16) + var_1_14) >= 0) ? ((((var_1_15 * 65535) + var_1_16) + var_1_14) % 65536) : (((((var_1_15 * 65535) + var_1_16) + var_1_14) % 65536) + 65536)) < 32768)) && ((32767 < (((((var_1_15 * 65535) + var_1_16) + var_1_14) >= 0) ? ((((var_1_15 * 65535) + var_1_16) + var_1_14) % 65536) : (((((var_1_15 * 65535) + var_1_16) + var_1_14) % 65536) + 65536))) || ((((var_1_13 < var_1_14) || (var_1_11 == (((((var_1_15 * 65535) + var_1_16) + var_1_14) >= 0) ? ((((var_1_15 * 65535) + var_1_16) + var_1_14) % 65536) : (((((var_1_15 * 65535) + var_1_16) + var_1_14) % 65536) + 65536)))) || ((((((-1 * var_1_14) + var_1_13) >= 0) ? ((-8 / ((-1 * var_1_14) + var_1_13)) - 1) : ((-8 / ((-1 * var_1_14) + var_1_13)) + 1)) + 1) < var_1_6)) && ((var_1_11 == (((((var_1_15 * 65535) + var_1_16) + var_1_14) >= 0) ? ((((var_1_15 * 65535) + var_1_16) + var_1_14) % 65536) : (((((var_1_15 * 65535) + var_1_16) + var_1_14) % 65536) + 65536))) || (((((-1 * var_1_14) + var_1_13) >= 0) ? ((-8 / ((-1 * var_1_14) + var_1_13)) - 1) : ((-8 / ((-1 * var_1_14) + var_1_13)) + 1)) < (var_1_6 + 1)))))) || (var_1_16 < (var_1_1 + 1)))) && ((((var_1_16 == 24) || (var_1_10 < var_1_5)) && ((var_1_5 < (var_1_10 + 1)) || ((((var_1_4 * 65535) + var_1_13) % 65536) == var_1_16))) || (32767 < (((var_1_4 * 65535) + var_1_13) % 65536)))) && ((((var_1_6 < (var_1_5 + 1)) || (((var_1_4 == var_1_1) || (last_1_var_1_8 != last_1_var_1_11)) && ((last_1_var_1_8 == last_1_var_1_11) || (((((short) var_1_4 + var_1_5) % 256) == var_1_1) && ((var_1_7 + 1) <= var_1_5))))) && ((((var_1_4 == var_1_1) || (last_1_var_1_8 != last_1_var_1_11)) && ((last_1_var_1_8 == last_1_var_1_11) || ((var_1_1 == (((short) var_1_4 + var_1_6) % 256)) && ((var_1_7 + 1) <= var_1_6)))) || (var_1_5 < var_1_6))) || ((((short) var_1_4 + var_1_7) % 256) == var_1_1))) && ((var_1_9 == 0) || ((((23071 + (65535 * var_1_6)) + var_1_10) % 65536) == var_1_8))) && ((((var_1_6 < (var_1_5 + 1)) || (((var_1_5 < (var_1_7 + 1)) || (last_1_var_1_8 == last_1_var_1_11)) && ((var_1_4 == var_1_1) || (last_1_var_1_8 != last_1_var_1_11)))) && ((var_1_5 < var_1_6) || (((var_1_4 == var_1_1) || (last_1_var_1_8 != last_1_var_1_11)) && ((last_1_var_1_8 == last_1_var_1_11) || (var_1_6 < (var_1_7 + 1)))))) || ((((short) var_1_4 + var_1_7) % 256) != var_1_1))) && (var_1_18 == var_1_17))) RESULT: Ultimate proved your program to be correct! [2025-03-17 02:59:35,829 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-03-17 02:59:35,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE