./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-49.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-49.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 aefc3819119098044c907ff26053410d2cb0cf50c17d46011b6486debfa94f96 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:55:35,642 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:55:35,698 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:55:35,704 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:55:35,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:55:35,721 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:55:35,721 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:55:35,722 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:55:35,725 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:55:35,725 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:55:35,725 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:55:35,725 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:55:35,725 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:55:35,725 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:55:35,725 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:55:35,725 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:55:35,725 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:55:35,725 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:55:35,725 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:55:35,725 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:55:35,725 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:55:35,726 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:55:35,726 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:55:35,726 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:55:35,726 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:55:35,726 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:55:35,726 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:55:35,726 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:55:35,726 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:55:35,726 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:55:35,726 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:55:35,726 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:55:35,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:55:35,726 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:55:35,726 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:55:35,726 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:55:35,726 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:55:35,726 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:55:35,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:55:35,727 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:55:35,727 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:55:35,727 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:55:35,727 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:55:35,727 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 -> aefc3819119098044c907ff26053410d2cb0cf50c17d46011b6486debfa94f96 [2025-03-04 00:55:35,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:55:35,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:55:35,961 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:55:35,962 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:55:35,962 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:55:35,964 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-49.i [2025-03-04 00:55:37,104 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f6af5d92/8a1a6a66b8b240abae25db0b3cf40c75/FLAG72844615a [2025-03-04 00:55:37,329 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:55:37,330 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-49.i [2025-03-04 00:55:37,336 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f6af5d92/8a1a6a66b8b240abae25db0b3cf40c75/FLAG72844615a [2025-03-04 00:55:37,647 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f6af5d92/8a1a6a66b8b240abae25db0b3cf40c75 [2025-03-04 00:55:37,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:55:37,650 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:55:37,651 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:55:37,651 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:55:37,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:55:37,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:55:37" (1/1) ... [2025-03-04 00:55:37,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77457e99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:37, skipping insertion in model container [2025-03-04 00:55:37,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:55:37" (1/1) ... [2025-03-04 00:55:37,667 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:55:37,767 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_variablewrapping_normal_file-49.i[913,926] [2025-03-04 00:55:37,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:55:37,827 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:55:37,835 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_variablewrapping_normal_file-49.i[913,926] [2025-03-04 00:55:37,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:55:37,872 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:55:37,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:37 WrapperNode [2025-03-04 00:55:37,873 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:55:37,873 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:55:37,873 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:55:37,873 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:55:37,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:37" (1/1) ... [2025-03-04 00:55:37,884 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:37" (1/1) ... [2025-03-04 00:55:37,908 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2025-03-04 00:55:37,909 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:55:37,909 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:55:37,909 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:55:37,909 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:55:37,915 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:37" (1/1) ... [2025-03-04 00:55:37,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:37" (1/1) ... [2025-03-04 00:55:37,917 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:37" (1/1) ... [2025-03-04 00:55:37,928 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-04 00:55:37,928 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:37" (1/1) ... [2025-03-04 00:55:37,928 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:37" (1/1) ... [2025-03-04 00:55:37,937 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:37" (1/1) ... [2025-03-04 00:55:37,938 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:37" (1/1) ... [2025-03-04 00:55:37,939 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:37" (1/1) ... [2025-03-04 00:55:37,940 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:37" (1/1) ... [2025-03-04 00:55:37,942 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:55:37,942 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:55:37,942 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:55:37,942 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:55:37,943 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:37" (1/1) ... [2025-03-04 00:55:37,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:55:37,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:55:37,968 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-04 00:55:37,970 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-04 00:55:37,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:55:37,987 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:55:37,987 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:55:37,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:55:37,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:55:37,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:55:38,035 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:55:38,036 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:55:38,245 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L91: havoc property_#t~bitwise13#1;havoc property_#t~short14#1; [2025-03-04 00:55:38,267 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-04 00:55:38,267 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:55:38,279 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:55:38,279 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:55:38,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:55:38 BoogieIcfgContainer [2025-03-04 00:55:38,280 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:55:38,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:55:38,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:55:38,286 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:55:38,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:55:37" (1/3) ... [2025-03-04 00:55:38,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dda2db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:55:38, skipping insertion in model container [2025-03-04 00:55:38,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:37" (2/3) ... [2025-03-04 00:55:38,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dda2db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:55:38, skipping insertion in model container [2025-03-04 00:55:38,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:55:38" (3/3) ... [2025-03-04 00:55:38,289 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-49.i [2025-03-04 00:55:38,299 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:55:38,300 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-49.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:55:38,339 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:55:38,351 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;@2a96e941, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:55:38,351 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:55:38,353 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 37 states have internal predecessors, (49), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 00:55:38,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-04 00:55:38,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:55:38,361 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:55:38,361 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:55:38,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:55:38,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1772289610, now seen corresponding path program 1 times [2025-03-04 00:55:38,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:55:38,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448537332] [2025-03-04 00:55:38,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:55:38,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:55:38,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 00:55:38,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 00:55:38,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:55:38,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:55:38,524 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 00:55:38,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:55:38,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448537332] [2025-03-04 00:55:38,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448537332] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:55:38,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637944289] [2025-03-04 00:55:38,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:55:38,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:55:38,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:55:38,530 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-04 00:55:38,531 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-04 00:55:38,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 00:55:38,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 00:55:38,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:55:38,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:55:38,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:55:38,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:55:38,659 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 00:55:38,659 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:55:38,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637944289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:55:38,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:55:38,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:55:38,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060042473] [2025-03-04 00:55:38,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:55:38,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:55:38,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:55:38,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:55:38,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:55:38,678 INFO L87 Difference]: Start difference. First operand has 53 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 37 states have internal predecessors, (49), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 00:55:38,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:55:38,700 INFO L93 Difference]: Finished difference Result 100 states and 163 transitions. [2025-03-04 00:55:38,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:55:38,701 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 93 [2025-03-04 00:55:38,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:55:38,706 INFO L225 Difference]: With dead ends: 100 [2025-03-04 00:55:38,706 INFO L226 Difference]: Without dead ends: 50 [2025-03-04 00:55:38,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 94 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-04 00:55:38,715 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:55:38,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:55:38,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-04 00:55:38,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-04 00:55:38,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 00:55:38,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2025-03-04 00:55:38,741 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 93 [2025-03-04 00:55:38,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:55:38,741 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2025-03-04 00:55:38,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 00:55:38,742 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2025-03-04 00:55:38,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-04 00:55:38,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:55:38,744 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:55:38,750 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-04 00:55:38,945 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-04 00:55:38,945 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:55:38,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:55:38,946 INFO L85 PathProgramCache]: Analyzing trace with hash -233958712, now seen corresponding path program 1 times [2025-03-04 00:55:38,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:55:38,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176298364] [2025-03-04 00:55:38,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:55:38,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:55:38,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 00:55:39,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 00:55:39,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:55:39,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:55:39,249 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 00:55:39,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:55:39,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176298364] [2025-03-04 00:55:39,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176298364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:55:39,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:55:39,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:55:39,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710993734] [2025-03-04 00:55:39,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:55:39,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:55:39,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:55:39,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:55:39,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:55:39,252 INFO L87 Difference]: Start difference. First operand 50 states and 72 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 00:55:39,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:55:39,401 INFO L93 Difference]: Finished difference Result 105 states and 148 transitions. [2025-03-04 00:55:39,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:55:39,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2025-03-04 00:55:39,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:55:39,403 INFO L225 Difference]: With dead ends: 105 [2025-03-04 00:55:39,403 INFO L226 Difference]: Without dead ends: 58 [2025-03-04 00:55:39,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:55:39,404 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 52 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:55:39,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 121 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:55:39,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-04 00:55:39,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2025-03-04 00:55:39,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 00:55:39,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 74 transitions. [2025-03-04 00:55:39,417 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 74 transitions. Word has length 93 [2025-03-04 00:55:39,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:55:39,418 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 74 transitions. [2025-03-04 00:55:39,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 00:55:39,419 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 74 transitions. [2025-03-04 00:55:39,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 00:55:39,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:55:39,422 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:55:39,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:55:39,422 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:55:39,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:55:39,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1781908700, now seen corresponding path program 1 times [2025-03-04 00:55:39,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:55:39,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268636280] [2025-03-04 00:55:39,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:55:39,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:55:39,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 00:55:39,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 00:55:39,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:55:39,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:55:39,491 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:55:39,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 00:55:39,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 00:55:39,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:55:39,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:55:39,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:55:39,560 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:55:39,561 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:55:39,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:55:39,564 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-04 00:55:39,615 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:55:39,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:55:39 BoogieIcfgContainer [2025-03-04 00:55:39,621 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:55:39,622 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:55:39,622 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:55:39,622 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:55:39,622 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:55:38" (3/4) ... [2025-03-04 00:55:39,624 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:55:39,625 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:55:39,626 INFO L158 Benchmark]: Toolchain (without parser) took 1975.88ms. Allocated memory is still 167.8MB. Free memory was 132.7MB in the beginning and 61.9MB in the end (delta: 70.8MB). Peak memory consumption was 73.5MB. Max. memory is 16.1GB. [2025-03-04 00:55:39,626 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:55:39,627 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.92ms. Allocated memory is still 167.8MB. Free memory was 132.3MB in the beginning and 118.8MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:55:39,627 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.49ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 115.1MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:55:39,628 INFO L158 Benchmark]: Boogie Preprocessor took 32.51ms. Allocated memory is still 167.8MB. Free memory was 115.1MB in the beginning and 108.2MB in the end (delta: 6.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:55:39,628 INFO L158 Benchmark]: IcfgBuilder took 337.44ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 87.0MB in the end (delta: 21.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:55:39,628 INFO L158 Benchmark]: TraceAbstraction took 1338.59ms. Allocated memory is still 167.8MB. Free memory was 86.2MB in the beginning and 62.9MB in the end (delta: 23.3MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2025-03-04 00:55:39,628 INFO L158 Benchmark]: Witness Printer took 3.63ms. Allocated memory is still 167.8MB. Free memory was 62.0MB in the beginning and 61.9MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:55:39,629 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.19ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.92ms. Allocated memory is still 167.8MB. Free memory was 132.3MB in the beginning and 118.8MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.49ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 115.1MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.51ms. Allocated memory is still 167.8MB. Free memory was 115.1MB in the beginning and 108.2MB in the end (delta: 6.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 337.44ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 87.0MB in the end (delta: 21.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1338.59ms. Allocated memory is still 167.8MB. Free memory was 86.2MB in the beginning and 62.9MB in the end (delta: 23.3MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. * Witness Printer took 3.63ms. Allocated memory is still 167.8MB. Free memory was 62.0MB in the beginning and 61.9MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryFLOATComparisonOperation at line 66, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 50. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 4; [L23] float var_1_2 = 1000000000000000.4; [L24] float var_1_3 = 1000.2; [L25] unsigned short int var_1_4 = 256; [L26] unsigned short int var_1_5 = 4; [L27] unsigned short int var_1_6 = 10; [L28] signed short int var_1_8 = 128; [L29] signed short int var_1_9 = -2; [L30] unsigned char var_1_10 = 0; [L31] unsigned char var_1_11 = 0; [L32] unsigned char var_1_12 = 0; [L33] unsigned char var_1_13 = 1; VAL [isInitial=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=5000000000000002/5, var_1_3=5001/5, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L95] isInitial = 1 [L96] FCALL initially() [L97] COND TRUE 1 [L98] FCALL updateLastVariables() [L99] CALL updateVariables() [L65] var_1_2 = __VERIFIER_nondet_float() [L66] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_3=5001/5, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_3=5001/5, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L66] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_3=5001/5, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L67] var_1_3 = __VERIFIER_nondet_float() [L68] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L68] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L69] var_1_4 = __VERIFIER_nondet_ushort() [L70] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L70] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L71] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L71] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L72] var_1_5 = __VERIFIER_nondet_ushort() [L73] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_6=10, var_1_8=128, var_1_9=-2] [L73] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_6=10, var_1_8=128, var_1_9=-2] [L74] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=65534, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=65534, var_1_6=10, var_1_8=128, var_1_9=-2] [L74] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=65534, var_1_6=10, var_1_8=128, var_1_9=-2] [L75] var_1_6 = __VERIFIER_nondet_ushort() [L76] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=65534, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=65534, var_1_8=128, var_1_9=-2] [L76] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=65534, var_1_8=128, var_1_9=-2] [L77] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=65534, var_1_6=65533, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=65534, var_1_6=65533, var_1_8=128, var_1_9=-2] [L77] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=65534, var_1_6=65533, var_1_8=128, var_1_9=-2] [L78] var_1_9 = __VERIFIER_nondet_short() [L79] CALL assume_abort_if_not(var_1_9 >= -32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=65534, var_1_6=65533, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=65534, var_1_6=65533, var_1_8=128, var_1_9=0] [L79] RET assume_abort_if_not(var_1_9 >= -32766) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=65534, var_1_6=65533, var_1_8=128, var_1_9=0] [L80] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=65534, var_1_6=65533, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=65534, var_1_6=65533, var_1_8=128, var_1_9=0] [L80] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=65534, var_1_6=65533, var_1_8=128, var_1_9=0] [L81] var_1_11 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=65534, var_1_6=65533, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=65534, var_1_6=65533, var_1_8=128, var_1_9=0] [L82] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=65534, var_1_6=65533, var_1_8=128, var_1_9=0] [L83] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=65534, var_1_6=65533, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=65534, var_1_6=65533, var_1_8=128, var_1_9=0] [L83] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=65534, var_1_6=65533, var_1_8=128, var_1_9=0] [L84] var_1_12 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=65534, var_1_6=65533, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=65534, var_1_6=65533, var_1_8=128, var_1_9=0] [L85] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=65534, var_1_6=65533, var_1_8=128, var_1_9=0] [L86] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=65534, var_1_6=65533, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=65534, var_1_6=65533, var_1_8=128, var_1_9=0] [L86] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=65534, var_1_6=65533, var_1_8=128, var_1_9=0] [L99] RET updateVariables() [L100] CALL step() [L37] var_1_8 = ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=65534, var_1_6=65533, var_1_8=0, var_1_9=0] [L38] EXPR 50 >> var_1_4 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=65534, var_1_6=65533, var_1_8=0, var_1_9=0] [L38] COND FALSE !((50 >> var_1_4) <= var_1_8) [L41] var_1_10 = (! var_1_11) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=65534, var_1_6=65533, var_1_8=0, var_1_9=0] [L43] COND TRUE ! var_1_12 VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=65534, var_1_6=65533, var_1_8=0, var_1_9=0] [L44] COND TRUE var_1_4 >= ((((var_1_6) < (var_1_8)) ? (var_1_6) : (var_1_8))) [L45] var_1_13 = (var_1_10 && var_1_11) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_1=4, var_1_4=0, var_1_5=65534, var_1_6=65533, var_1_8=0, var_1_9=0] [L50] COND FALSE !(var_1_2 >= 64.5f) [L61] var_1_1 = 50 VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_1=50, var_1_4=0, var_1_5=65534, var_1_6=65533, var_1_8=0, var_1_9=0] [L100] RET step() [L101] CALL, EXPR property() [L91] EXPR (((var_1_2 >= 64.5f) ? ((var_1_2 >= var_1_3) ? (var_1_1 == ((unsigned short int) (((((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) < 0 ) ? -((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) : ((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))))))) : (var_1_13 ? (var_1_1 == ((unsigned short int) var_1_5)) : (var_1_1 == ((unsigned short int) var_1_6)))) : (var_1_1 == ((unsigned short int) 50))) && (var_1_8 == ((signed short int) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) && (((50 >> var_1_4) <= var_1_8) ? (var_1_10 == ((unsigned char) ((! (! var_1_11)) || var_1_12))) : (var_1_10 == ((unsigned char) (! var_1_11)))) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_1=50, var_1_4=0, var_1_5=65534, var_1_6=65533, var_1_8=0, var_1_9=0] [L91-L92] return ((((var_1_2 >= 64.5f) ? ((var_1_2 >= var_1_3) ? (var_1_1 == ((unsigned short int) (((((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) < 0 ) ? -((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) : ((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))))))) : (var_1_13 ? (var_1_1 == ((unsigned short int) var_1_5)) : (var_1_1 == ((unsigned short int) var_1_6)))) : (var_1_1 == ((unsigned short int) 50))) && (var_1_8 == ((signed short int) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) && (((50 >> var_1_4) <= var_1_8) ? (var_1_10 == ((unsigned char) ((! (! var_1_11)) || var_1_12))) : (var_1_10 == ((unsigned char) (! var_1_11))))) && ((! var_1_12) ? ((var_1_4 >= ((((var_1_6) < (var_1_8)) ? (var_1_6) : (var_1_8)))) ? (var_1_13 == ((unsigned char) (var_1_10 && var_1_11))) : (var_1_13 == ((unsigned char) var_1_11))) : 1) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_1=50, var_1_4=0, var_1_5=65534, var_1_6=65533, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_1=50, var_1_4=0, var_1_5=65534, var_1_6=65533, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 64 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 52 mSDsluCounter, 191 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 96 IncrementalHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 120 mSDtfsCounter, 96 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=2, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 373 NumberOfCodeBlocks, 373 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 276 ConstructedInterpolants, 0 QuantifiedInterpolants, 300 SizeOfPredicates, 0 NumberOfNonLiveVariables, 214 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1066/1092 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 00:55:39,644 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 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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_variablewrapping_normal_file-49.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 aefc3819119098044c907ff26053410d2cb0cf50c17d46011b6486debfa94f96 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:55:41,404 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:55:41,485 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:55:41,489 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:55:41,489 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:55:41,513 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:55:41,514 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:55:41,514 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:55:41,514 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:55:41,514 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:55:41,515 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:55:41,515 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:55:41,515 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:55:41,515 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:55:41,516 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:55:41,516 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:55:41,516 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:55:41,516 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:55:41,516 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:55:41,516 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:55:41,516 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:55:41,517 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:55:41,517 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:55:41,517 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:55:41,517 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:55:41,517 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:55:41,517 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:55:41,517 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:55:41,517 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:55:41,517 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:55:41,518 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:55:41,518 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:55:41,518 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:55:41,518 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:55:41,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:55:41,518 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:55:41,518 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:55:41,518 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:55:41,518 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:55:41,518 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:55:41,518 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:55:41,519 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:55:41,519 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:55:41,519 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:55:41,519 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:55:41,519 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 -> aefc3819119098044c907ff26053410d2cb0cf50c17d46011b6486debfa94f96 [2025-03-04 00:55:41,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:55:41,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:55:41,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:55:41,744 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:55:41,744 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:55:41,745 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-49.i [2025-03-04 00:55:42,891 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a8a230ba/ab5f7342222f4210a18813cadc9757ab/FLAGb75f4d9f5 [2025-03-04 00:55:43,099 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:55:43,100 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-49.i [2025-03-04 00:55:43,104 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a8a230ba/ab5f7342222f4210a18813cadc9757ab/FLAGb75f4d9f5 [2025-03-04 00:55:43,459 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a8a230ba/ab5f7342222f4210a18813cadc9757ab [2025-03-04 00:55:43,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:55:43,462 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:55:43,463 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:55:43,464 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:55:43,467 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:55:43,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:55:43" (1/1) ... [2025-03-04 00:55:43,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@87d39d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:43, skipping insertion in model container [2025-03-04 00:55:43,468 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:55:43" (1/1) ... [2025-03-04 00:55:43,481 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:55:43,578 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_variablewrapping_normal_file-49.i[913,926] [2025-03-04 00:55:43,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:55:43,644 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:55:43,653 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_variablewrapping_normal_file-49.i[913,926] [2025-03-04 00:55:43,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:55:43,683 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:55:43,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:43 WrapperNode [2025-03-04 00:55:43,684 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:55:43,685 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:55:43,685 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:55:43,686 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:55:43,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:43" (1/1) ... [2025-03-04 00:55:43,697 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:43" (1/1) ... [2025-03-04 00:55:43,718 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 96 [2025-03-04 00:55:43,718 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:55:43,719 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:55:43,719 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:55:43,719 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:55:43,729 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:43" (1/1) ... [2025-03-04 00:55:43,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:43" (1/1) ... [2025-03-04 00:55:43,733 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:43" (1/1) ... [2025-03-04 00:55:43,747 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-04 00:55:43,748 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:43" (1/1) ... [2025-03-04 00:55:43,748 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:43" (1/1) ... [2025-03-04 00:55:43,754 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:43" (1/1) ... [2025-03-04 00:55:43,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:43" (1/1) ... [2025-03-04 00:55:43,756 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:43" (1/1) ... [2025-03-04 00:55:43,757 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:43" (1/1) ... [2025-03-04 00:55:43,758 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:55:43,762 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:55:43,763 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:55:43,763 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:55:43,763 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:43" (1/1) ... [2025-03-04 00:55:43,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:55:43,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:55:43,788 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-04 00:55:43,794 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-04 00:55:43,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:55:43,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:55:43,811 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:55:43,811 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:55:43,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:55:43,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:55:43,873 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:55:43,875 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:55:44,086 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 00:55:44,087 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:55:44,095 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:55:44,096 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:55:44,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:55:44 BoogieIcfgContainer [2025-03-04 00:55:44,096 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:55:44,098 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:55:44,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:55:44,101 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:55:44,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:55:43" (1/3) ... [2025-03-04 00:55:44,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5560c5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:55:44, skipping insertion in model container [2025-03-04 00:55:44,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:43" (2/3) ... [2025-03-04 00:55:44,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5560c5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:55:44, skipping insertion in model container [2025-03-04 00:55:44,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:55:44" (3/3) ... [2025-03-04 00:55:44,103 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-49.i [2025-03-04 00:55:44,113 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:55:44,114 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-49.i that has 2 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:55:44,151 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:55:44,161 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;@44693f1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:55:44,161 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:55:44,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 00:55:44,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 00:55:44,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:55:44,172 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:55:44,172 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:55:44,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:55:44,176 INFO L85 PathProgramCache]: Analyzing trace with hash 672408070, now seen corresponding path program 1 times [2025-03-04 00:55:44,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:55:44,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453884555] [2025-03-04 00:55:44,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:55:44,186 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:55:44,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:55:44,188 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:55:44,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 00:55:44,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 00:55:44,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 00:55:44,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:55:44,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:55:44,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:55:44,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:55:44,373 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 00:55:44,373 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:55:44,373 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:55:44,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453884555] [2025-03-04 00:55:44,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [453884555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:55:44,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:55:44,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:55:44,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250760315] [2025-03-04 00:55:44,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:55:44,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:55:44,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:55:44,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:55:44,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:55:44,394 INFO L87 Difference]: Start difference. First operand has 46 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 00:55:44,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:55:44,413 INFO L93 Difference]: Finished difference Result 86 states and 143 transitions. [2025-03-04 00:55:44,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:55:44,414 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), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 90 [2025-03-04 00:55:44,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:55:44,418 INFO L225 Difference]: With dead ends: 86 [2025-03-04 00:55:44,418 INFO L226 Difference]: Without dead ends: 43 [2025-03-04 00:55:44,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 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-04 00:55:44,422 INFO L435 NwaCegarLoop]: 62 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, 62 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-04 00:55:44,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:55:44,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-04 00:55:44,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-04 00:55:44,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 00:55:44,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 62 transitions. [2025-03-04 00:55:44,464 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 62 transitions. Word has length 90 [2025-03-04 00:55:44,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:55:44,464 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 62 transitions. [2025-03-04 00:55:44,464 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), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 00:55:44,464 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 62 transitions. [2025-03-04 00:55:44,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 00:55:44,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:55:44,466 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:55:44,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 00:55:44,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:55:44,667 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:55:44,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:55:44,668 INFO L85 PathProgramCache]: Analyzing trace with hash 620727880, now seen corresponding path program 1 times [2025-03-04 00:55:44,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:55:44,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215046627] [2025-03-04 00:55:44,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:55:44,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:55:44,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:55:44,671 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:55:44,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 00:55:44,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 00:55:44,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 00:55:44,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:55:44,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:55:44,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 00:55:44,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:55:44,882 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 00:55:44,882 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:55:44,883 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:55:44,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1215046627] [2025-03-04 00:55:44,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1215046627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:55:44,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:55:44,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:55:44,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236658626] [2025-03-04 00:55:44,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:55:44,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:55:44,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:55:44,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:55:44,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:55:44,887 INFO L87 Difference]: Start difference. First operand 43 states and 62 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 00:55:45,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:55:45,054 INFO L93 Difference]: Finished difference Result 91 states and 128 transitions. [2025-03-04 00:55:45,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:55:45,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 90 [2025-03-04 00:55:45,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:55:45,056 INFO L225 Difference]: With dead ends: 91 [2025-03-04 00:55:45,056 INFO L226 Difference]: Without dead ends: 51 [2025-03-04 00:55:45,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:55:45,057 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 43 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:55:45,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 99 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:55:45,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-04 00:55:45,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2025-03-04 00:55:45,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 00:55:45,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2025-03-04 00:55:45,070 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 90 [2025-03-04 00:55:45,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:55:45,071 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2025-03-04 00:55:45,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 00:55:45,071 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2025-03-04 00:55:45,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 00:55:45,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:55:45,076 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:55:45,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-04 00:55:45,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:55:45,277 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:55:45,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:55:45,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1237128863, now seen corresponding path program 1 times [2025-03-04 00:55:45,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:55:45,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [916726118] [2025-03-04 00:55:45,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:55:45,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:55:45,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:55:45,280 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:55:45,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 00:55:45,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 00:55:45,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 00:55:45,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:55:45,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:55:45,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 00:55:45,386 INFO L279 TraceCheckSpWp]: Computing forward predicates...