./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-97.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 af6837aab5604a8bd69642c61ca1f8ef68994640b44d7d7c2acb72ed2318df0c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:45:35,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:45:35,915 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:45:35,920 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:45:35,920 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:45:35,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:45:35,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:45:35,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:45:35,937 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:45:35,937 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:45:35,937 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:45:35,937 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:45:35,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:45:35,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:45:35,938 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:45:35,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:45:35,938 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:45:35,938 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:45:35,938 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:45:35,938 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:45:35,938 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:45:35,938 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:45:35,939 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:45:35,939 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:45:35,939 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:45:35,939 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:45:35,939 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:45:35,939 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:45:35,939 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:45:35,939 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:45:35,939 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:45:35,939 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:45:35,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:45:35,940 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:45:35,940 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:45:35,940 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:45:35,940 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:45:35,940 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:45:35,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:45:35,940 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:45:35,940 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:45:35,940 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:45:35,940 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:45:35,940 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 -> af6837aab5604a8bd69642c61ca1f8ef68994640b44d7d7c2acb72ed2318df0c [2025-03-17 03:45:36,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:45:36,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:45:36,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:45:36,182 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:45:36,182 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:45:36,183 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-97.i [2025-03-17 03:45:37,385 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28f3487fa/c2706cf14db841d1a9c69b4c52583b5d/FLAG8ff752d82 [2025-03-17 03:45:37,635 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:45:37,636 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-97.i [2025-03-17 03:45:37,641 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28f3487fa/c2706cf14db841d1a9c69b4c52583b5d/FLAG8ff752d82 [2025-03-17 03:45:37,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28f3487fa/c2706cf14db841d1a9c69b4c52583b5d [2025-03-17 03:45:37,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:45:37,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:45:37,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:45:37,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:45:37,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:45:37,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:45:37" (1/1) ... [2025-03-17 03:45:37,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38fdd496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:37, skipping insertion in model container [2025-03-17 03:45:37,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:45:37" (1/1) ... [2025-03-17 03:45:37,674 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:45:37,772 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_loopvsstraightlinecode_25-while_file-97.i[915,928] [2025-03-17 03:45:37,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:45:37,808 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:45:37,815 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_loopvsstraightlinecode_25-while_file-97.i[915,928] [2025-03-17 03:45:37,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:45:37,850 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:45:37,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:37 WrapperNode [2025-03-17 03:45:37,851 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:45:37,852 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:45:37,852 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:45:37,852 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:45:37,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:37" (1/1) ... [2025-03-17 03:45:37,866 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:37" (1/1) ... [2025-03-17 03:45:37,884 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2025-03-17 03:45:37,888 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:45:37,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:45:37,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:45:37,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:45:37,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:37" (1/1) ... [2025-03-17 03:45:37,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:37" (1/1) ... [2025-03-17 03:45:37,897 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:37" (1/1) ... [2025-03-17 03:45:37,911 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:45:37,912 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:37" (1/1) ... [2025-03-17 03:45:37,912 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:37" (1/1) ... [2025-03-17 03:45:37,917 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:37" (1/1) ... [2025-03-17 03:45:37,921 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:37" (1/1) ... [2025-03-17 03:45:37,922 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:37" (1/1) ... [2025-03-17 03:45:37,922 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:37" (1/1) ... [2025-03-17 03:45:37,923 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:45:37,924 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:45:37,924 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:45:37,924 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:45:37,929 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:37" (1/1) ... [2025-03-17 03:45:37,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:45:37,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:45:37,961 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:45:37,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:45:37,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:45:37,983 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:45:37,983 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:45:37,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:45:37,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:45:37,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:45:38,033 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:45:38,035 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:45:38,181 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L93: havoc property_#t~ite15#1;havoc property_#t~bitwise14#1;havoc property_#t~short16#1; [2025-03-17 03:45:38,198 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-17 03:45:38,198 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:45:38,215 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:45:38,215 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:45:38,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:45:38 BoogieIcfgContainer [2025-03-17 03:45:38,216 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:45:38,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:45:38,219 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:45:38,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:45:38,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:45:37" (1/3) ... [2025-03-17 03:45:38,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b44ec72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:45:38, skipping insertion in model container [2025-03-17 03:45:38,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:37" (2/3) ... [2025-03-17 03:45:38,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b44ec72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:45:38, skipping insertion in model container [2025-03-17 03:45:38,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:45:38" (3/3) ... [2025-03-17 03:45:38,225 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-97.i [2025-03-17 03:45:38,238 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:45:38,239 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-97.i that has 2 procedures, 56 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:45:38,280 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:45:38,295 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;@7f83e607, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:45:38,295 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:45:38,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:45:38,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 03:45:38,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:45:38,311 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:45:38,312 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:45:38,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:45:38,316 INFO L85 PathProgramCache]: Analyzing trace with hash -432245399, now seen corresponding path program 1 times [2025-03-17 03:45:38,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:45:38,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355655900] [2025-03-17 03:45:38,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:45:38,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:45:38,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 03:45:38,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 03:45:38,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:45:38,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:45:38,541 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 03:45:38,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:45:38,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355655900] [2025-03-17 03:45:38,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355655900] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:45:38,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822862100] [2025-03-17 03:45:38,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:45:38,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:45:38,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:45:38,546 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:45:38,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 03:45:38,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 03:45:38,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 03:45:38,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:45:38,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:45:38,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:45:38,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:45:38,672 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 03:45:38,675 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:45:38,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822862100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:45:38,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:45:38,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:45:38,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125649169] [2025-03-17 03:45:38,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:45:38,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:45:38,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:45:38,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:45:38,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:45:38,696 INFO L87 Difference]: Start difference. First operand has 56 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 03:45:38,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:45:38,717 INFO L93 Difference]: Finished difference Result 108 states and 182 transitions. [2025-03-17 03:45:38,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:45:38,719 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 100 [2025-03-17 03:45:38,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:45:38,723 INFO L225 Difference]: With dead ends: 108 [2025-03-17 03:45:38,724 INFO L226 Difference]: Without dead ends: 53 [2025-03-17 03:45:38,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:45:38,728 INFO L435 NwaCegarLoop]: 76 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, 76 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-17 03:45:38,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:45:38,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-17 03:45:38,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-17 03:45:38,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:45:38,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 78 transitions. [2025-03-17 03:45:38,759 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 78 transitions. Word has length 100 [2025-03-17 03:45:38,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:45:38,760 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 78 transitions. [2025-03-17 03:45:38,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 03:45:38,760 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 78 transitions. [2025-03-17 03:45:38,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 03:45:38,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:45:38,763 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:45:38,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 03:45:38,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 03:45:38,964 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:45:38,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:45:38,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1807465909, now seen corresponding path program 1 times [2025-03-17 03:45:38,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:45:38,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442750090] [2025-03-17 03:45:38,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:45:38,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:45:39,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 03:45:39,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 03:45:39,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:45:39,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:45:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 03:45:39,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:45:39,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442750090] [2025-03-17 03:45:39,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442750090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:45:39,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:45:39,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:45:39,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808393979] [2025-03-17 03:45:39,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:45:39,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:45:39,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:45:39,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:45:39,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:45:39,335 INFO L87 Difference]: Start difference. First operand 53 states and 78 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:45:39,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:45:39,405 INFO L93 Difference]: Finished difference Result 126 states and 185 transitions. [2025-03-17 03:45:39,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:45:39,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 100 [2025-03-17 03:45:39,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:45:39,407 INFO L225 Difference]: With dead ends: 126 [2025-03-17 03:45:39,408 INFO L226 Difference]: Without dead ends: 74 [2025-03-17 03:45:39,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:45:39,409 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 26 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:45:39,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 299 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:45:39,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-17 03:45:39,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2025-03-17 03:45:39,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.372093023255814) internal successors, (59), 43 states have internal predecessors, (59), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:45:39,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 91 transitions. [2025-03-17 03:45:39,421 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 91 transitions. Word has length 100 [2025-03-17 03:45:39,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:45:39,422 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 91 transitions. [2025-03-17 03:45:39,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:45:39,424 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 91 transitions. [2025-03-17 03:45:39,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 03:45:39,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:45:39,425 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:45:39,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:45:39,426 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:45:39,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:45:39,427 INFO L85 PathProgramCache]: Analyzing trace with hash -97012115, now seen corresponding path program 1 times [2025-03-17 03:45:39,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:45:39,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849071304] [2025-03-17 03:45:39,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:45:39,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:45:39,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 03:45:39,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 03:45:39,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:45:39,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:45:39,596 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 03:45:39,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:45:39,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849071304] [2025-03-17 03:45:39,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849071304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:45:39,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:45:39,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:45:39,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814692067] [2025-03-17 03:45:39,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:45:39,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:45:39,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:45:39,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:45:39,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:45:39,598 INFO L87 Difference]: Start difference. First operand 61 states and 91 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:45:39,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:45:39,664 INFO L93 Difference]: Finished difference Result 135 states and 198 transitions. [2025-03-17 03:45:39,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:45:39,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2025-03-17 03:45:39,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:45:39,665 INFO L225 Difference]: With dead ends: 135 [2025-03-17 03:45:39,665 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 03:45:39,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:45:39,666 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 44 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:45:39,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 236 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:45:39,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 03:45:39,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2025-03-17 03:45:39,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:45:39,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 92 transitions. [2025-03-17 03:45:39,677 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 92 transitions. Word has length 101 [2025-03-17 03:45:39,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:45:39,677 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 92 transitions. [2025-03-17 03:45:39,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:45:39,677 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 92 transitions. [2025-03-17 03:45:39,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 03:45:39,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:45:39,680 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:45:39,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:45:39,680 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:45:39,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:45:39,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1660617001, now seen corresponding path program 1 times [2025-03-17 03:45:39,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:45:39,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310083362] [2025-03-17 03:45:39,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:45:39,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:45:39,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 03:45:39,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 03:45:39,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:45:39,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:45:39,730 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:45:39,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 03:45:39,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 03:45:39,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:45:39,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:45:39,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:45:39,792 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:45:39,793 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:45:39,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 03:45:39,798 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 03:45:39,863 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:45:39,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:45:39 BoogieIcfgContainer [2025-03-17 03:45:39,868 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:45:39,868 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:45:39,868 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:45:39,869 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:45:39,869 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:45:38" (3/4) ... [2025-03-17 03:45:39,871 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:45:39,871 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:45:39,872 INFO L158 Benchmark]: Toolchain (without parser) took 2217.63ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 62.6MB in the end (delta: 46.6MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. [2025-03-17 03:45:39,873 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:45:39,873 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.12ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 97.5MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:45:39,873 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.29ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 95.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:45:39,874 INFO L158 Benchmark]: Boogie Preprocessor took 34.79ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 93.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:45:39,874 INFO L158 Benchmark]: IcfgBuilder took 291.54ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 77.0MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:45:39,875 INFO L158 Benchmark]: TraceAbstraction took 1649.26ms. Allocated memory is still 142.6MB. Free memory was 76.1MB in the beginning and 62.6MB in the end (delta: 13.5MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2025-03-17 03:45:39,875 INFO L158 Benchmark]: Witness Printer took 3.07ms. Allocated memory is still 142.6MB. Free memory was 62.6MB in the beginning and 62.6MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:45:39,876 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.25ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 196.12ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 97.5MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.29ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 95.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.79ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 93.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 291.54ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 77.0MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1649.26ms. Allocated memory is still 142.6MB. Free memory was 76.1MB in the beginning and 62.6MB in the end (delta: 13.5MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * Witness Printer took 3.07ms. Allocated memory is still 142.6MB. Free memory was 62.6MB in the beginning and 62.6MB in the end (delta: 37.0kB). 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 85, overapproximation of someBinaryFLOATComparisonOperation at line 87, overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 57, overapproximation of someBinaryArithmeticFLOAToperation at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_6 = 1; [L25] signed short int var_1_7 = 32; [L26] signed short int var_1_8 = 20113; [L27] signed short int var_1_9 = 100; [L28] signed char var_1_10 = 100; [L29] signed char var_1_11 = -1; [L30] signed char var_1_12 = 16; [L31] float var_1_13 = 1.2; [L32] float var_1_14 = 3.6; [L33] float var_1_15 = 5.5; [L34] signed char last_1_var_1_10 = 100; [L97] isInitial = 1 [L98] FCALL initially() [L99] COND TRUE 1 [L100] CALL updateLastVariables() [L90] last_1_var_1_10 = var_1_10 [L100] RET updateLastVariables() [L101] CALL updateVariables() [L63] var_1_2 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L64] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L65] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L65] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L66] var_1_6 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_7=32, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_7=32, var_1_8=20113, var_1_9=100] [L67] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_7=32, var_1_8=20113, var_1_9=100] [L68] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L68] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L69] var_1_7 = __VERIFIER_nondet_short() [L70] CALL assume_abort_if_not(var_1_7 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=20113, var_1_9=100] [L70] RET assume_abort_if_not(var_1_7 >= -1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=20113, var_1_9=100] [L71] CALL assume_abort_if_not(var_1_7 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=20113, var_1_9=100] [L71] RET assume_abort_if_not(var_1_7 <= 32766) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=20113, var_1_9=100] [L72] var_1_8 = __VERIFIER_nondet_short() [L73] CALL assume_abort_if_not(var_1_8 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=100] [L73] RET assume_abort_if_not(var_1_8 >= 16383) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=100] [L74] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=100] [L74] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=100] [L75] var_1_9 = __VERIFIER_nondet_short() [L76] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L76] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L77] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L77] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L78] var_1_11 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-63, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-63, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L79] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-63, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L80] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-63, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-63, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L80] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-63, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L81] var_1_12 = __VERIFIER_nondet_char() [L82] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L82] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L83] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L83] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L84] var_1_14 = __VERIFIER_nondet_float() [L85] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=6/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=6/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L85] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=6/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L86] var_1_15 = __VERIFIER_nondet_float() [L87] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=6/5, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=6/5, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L87] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=6/5, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L101] RET updateVariables() [L102] CALL step() [L38] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=6/5, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L49] COND TRUE var_1_1 == var_1_7 [L50] var_1_10 = (var_1_11 + (var_1_12 + -25)) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-119, var_1_11=-63, var_1_12=-31, var_1_13=6/5, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L56] COND TRUE \read(var_1_6) [L57] var_1_13 = ((((16.3f) < ((((((var_1_14 - 1.875f)) > (63.5f)) ? ((var_1_14 - 1.875f)) : (63.5f))))) ? (16.3f) : ((((((var_1_14 - 1.875f)) > (63.5f)) ? ((var_1_14 - 1.875f)) : (63.5f)))))) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-119, var_1_11=-63, var_1_12=-31, var_1_13=163/10, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L102] RET step() [L103] CALL, EXPR property() [L93] EXPR (var_1_2 ? ((last_1_var_1_10 > last_1_var_1_10) ? (var_1_6 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) last_1_var_1_10))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_1 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : (((100 | var_1_1) >= var_1_7) ? (var_1_10 == ((signed char) var_1_11)) : 1)) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-119, var_1_11=-63, var_1_12=-31, var_1_13=163/10, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L93] EXPR (var_1_1 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : (((100 | var_1_1) >= var_1_7) ? (var_1_10 == ((signed char) var_1_11)) : 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-119, var_1_11=-63, var_1_12=-31, var_1_13=163/10, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L93] EXPR (var_1_2 ? ((last_1_var_1_10 > last_1_var_1_10) ? (var_1_6 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) last_1_var_1_10))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_1 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : (((100 | var_1_1) >= var_1_7) ? (var_1_10 == ((signed char) var_1_11)) : 1)) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-119, var_1_11=-63, var_1_12=-31, var_1_13=163/10, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L93-L94] return ((var_1_2 ? ((last_1_var_1_10 > last_1_var_1_10) ? (var_1_6 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) last_1_var_1_10))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_1 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : (((100 | var_1_1) >= var_1_7) ? (var_1_10 == ((signed char) var_1_11)) : 1))) && (var_1_6 ? (var_1_13 == ((float) ((((16.3f) < ((((((var_1_14 - 1.875f)) > (63.5f)) ? ((var_1_14 - 1.875f)) : (63.5f))))) ? (16.3f) : ((((((var_1_14 - 1.875f)) > (63.5f)) ? ((var_1_14 - 1.875f)) : (63.5f)))))))) : (var_1_13 == ((float) (var_1_14 - var_1_15)))) ; [L103] RET, EXPR property() [L103] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-119, var_1_11=-63, var_1_12=-31, var_1_13=163/10, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-119, var_1_11=-63, var_1_12=-31, var_1_13=163/10, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 101 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 4, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 70 mSDsluCounter, 611 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 366 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 80 IncrementalHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 245 mSDtfsCounter, 80 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=3, 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, 3 MinimizatonAttempts, 24 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 503 NumberOfCodeBlocks, 503 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 397 ConstructedInterpolants, 0 QuantifiedInterpolants, 444 SizeOfPredicates, 0 NumberOfNonLiveVariables, 233 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1890/1920 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-17 03:45:39,890 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_loopvsstraightlinecode_25-while_file-97.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 af6837aab5604a8bd69642c61ca1f8ef68994640b44d7d7c2acb72ed2318df0c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:45:41,822 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:45:41,904 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:45:41,910 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:45:41,911 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:45:41,934 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:45:41,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:45:41,938 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:45:41,938 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:45:41,939 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:45:41,939 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:45:41,939 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:45:41,940 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:45:41,940 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:45:41,940 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:45:41,940 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:45:41,940 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:45:41,940 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:45:41,940 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:45:41,940 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:45:41,941 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:45:41,941 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:45:41,942 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:45:41,942 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:45:41,942 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:45:41,942 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:45:41,942 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:45:41,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:45:41,942 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:45:41,942 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:45:41,942 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:45:41,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:45:41,942 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:45:41,942 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:45:41,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:45:41,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:45:41,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:45:41,943 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:45:41,943 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:45:41,943 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:45:41,943 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:45:41,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:45:41,944 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:45:41,944 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:45:41,944 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:45:41,944 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 -> af6837aab5604a8bd69642c61ca1f8ef68994640b44d7d7c2acb72ed2318df0c [2025-03-17 03:45:42,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:45:42,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:45:42,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:45:42,337 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:45:42,338 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:45:42,340 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-97.i [2025-03-17 03:45:43,594 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b87038b0c/7a14f9a5128e41068126bd761328b8f9/FLAG09429ddc7 [2025-03-17 03:45:43,773 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:45:43,774 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-97.i [2025-03-17 03:45:43,781 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b87038b0c/7a14f9a5128e41068126bd761328b8f9/FLAG09429ddc7 [2025-03-17 03:45:43,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b87038b0c/7a14f9a5128e41068126bd761328b8f9 [2025-03-17 03:45:43,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:45:43,800 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:45:43,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:45:43,802 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:45:43,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:45:43,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:45:43" (1/1) ... [2025-03-17 03:45:43,807 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b2ed4f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:43, skipping insertion in model container [2025-03-17 03:45:43,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:45:43" (1/1) ... [2025-03-17 03:45:43,823 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:45:43,934 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_loopvsstraightlinecode_25-while_file-97.i[915,928] [2025-03-17 03:45:43,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:45:43,997 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:45:44,005 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_loopvsstraightlinecode_25-while_file-97.i[915,928] [2025-03-17 03:45:44,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:45:44,043 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:45:44,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:44 WrapperNode [2025-03-17 03:45:44,045 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:45:44,046 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:45:44,046 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:45:44,046 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:45:44,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:44" (1/1) ... [2025-03-17 03:45:44,063 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:44" (1/1) ... [2025-03-17 03:45:44,080 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2025-03-17 03:45:44,080 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:45:44,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:45:44,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:45:44,081 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:45:44,088 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:44" (1/1) ... [2025-03-17 03:45:44,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:44" (1/1) ... [2025-03-17 03:45:44,090 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:44" (1/1) ... [2025-03-17 03:45:44,103 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:45:44,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:44" (1/1) ... [2025-03-17 03:45:44,107 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:44" (1/1) ... [2025-03-17 03:45:44,112 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:44" (1/1) ... [2025-03-17 03:45:44,113 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:44" (1/1) ... [2025-03-17 03:45:44,116 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:44" (1/1) ... [2025-03-17 03:45:44,117 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:44" (1/1) ... [2025-03-17 03:45:44,119 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:45:44,119 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:45:44,119 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:45:44,119 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:45:44,124 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:44" (1/1) ... [2025-03-17 03:45:44,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:45:44,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:45:44,154 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:45:44,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:45:44,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:45:44,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:45:44,182 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:45:44,182 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:45:44,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:45:44,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:45:44,249 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:45:44,251 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:45:44,722 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 03:45:44,722 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:45:44,729 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:45:44,729 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:45:44,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:45:44 BoogieIcfgContainer [2025-03-17 03:45:44,731 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:45:44,733 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:45:44,733 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:45:44,738 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:45:44,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:45:43" (1/3) ... [2025-03-17 03:45:44,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5495a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:45:44, skipping insertion in model container [2025-03-17 03:45:44,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:44" (2/3) ... [2025-03-17 03:45:44,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5495a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:45:44, skipping insertion in model container [2025-03-17 03:45:44,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:45:44" (3/3) ... [2025-03-17 03:45:44,742 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-97.i [2025-03-17 03:45:44,753 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:45:44,754 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-97.i that has 2 procedures, 44 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:45:44,793 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:45:44,804 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;@157e7ec7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:45:44,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:45:44,808 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:45:44,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-17 03:45:44,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:45:44,817 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:45:44,817 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:45:44,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:45:44,821 INFO L85 PathProgramCache]: Analyzing trace with hash 411495637, now seen corresponding path program 1 times [2025-03-17 03:45:44,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:45:44,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [65285568] [2025-03-17 03:45:44,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:45:44,828 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-17 03:45:44,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:45:44,831 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-17 03:45:44,833 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-17 03:45:44,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 03:45:45,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 03:45:45,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:45:45,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:45:45,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 03:45:45,045 INFO L279 TraceCheckSpWp]: Computing forward predicates...