./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-41.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-41.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 64487a3fc6d0bb9c63963975f2a88f7204d26acaec706a494cf6a9d1aeef08e8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:54:17,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:54:17,890 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:54:17,893 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:54:17,893 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:54:17,909 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:54:17,910 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:54:17,910 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:54:17,910 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:54:17,911 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:54:17,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:54:17,912 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:54:17,912 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:54:17,912 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:54:17,912 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:54:17,912 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:54:17,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:54:17,913 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:54:17,913 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:54:17,913 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:54:17,913 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:54:17,913 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:54:17,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:54:17,913 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:54:17,913 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:54:17,913 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:54:17,913 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:54:17,913 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:54:17,913 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:54:17,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:54:17,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:54:17,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:54:17,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:54:17,914 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:54:17,914 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:54:17,915 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:54:17,915 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:54:17,915 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:54:17,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:54:17,915 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:54:17,915 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:54:17,915 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:54:17,915 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:54:17,915 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 -> 64487a3fc6d0bb9c63963975f2a88f7204d26acaec706a494cf6a9d1aeef08e8 [2025-03-04 00:54:18,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:54:18,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:54:18,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:54:18,150 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:54:18,150 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:54:18,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-41.i [2025-03-04 00:54:19,300 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f85af1118/b4fad057b8de45768f5d72fd1580ef37/FLAG7371b3f8b [2025-03-04 00:54:19,542 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:54:19,543 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-41.i [2025-03-04 00:54:19,550 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f85af1118/b4fad057b8de45768f5d72fd1580ef37/FLAG7371b3f8b [2025-03-04 00:54:19,566 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f85af1118/b4fad057b8de45768f5d72fd1580ef37 [2025-03-04 00:54:19,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:54:19,570 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:54:19,571 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:54:19,571 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:54:19,574 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:54:19,575 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:54:19" (1/1) ... [2025-03-04 00:54:19,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69ffc5b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:19, skipping insertion in model container [2025-03-04 00:54:19,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:54:19" (1/1) ... [2025-03-04 00:54:19,589 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:54:19,695 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-41.i[913,926] [2025-03-04 00:54:19,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:54:19,753 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:54:19,765 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-41.i[913,926] [2025-03-04 00:54:19,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:54:19,796 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:54:19,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:19 WrapperNode [2025-03-04 00:54:19,798 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:54:19,799 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:54:19,799 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:54:19,799 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:54:19,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:19" (1/1) ... [2025-03-04 00:54:19,812 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:19" (1/1) ... [2025-03-04 00:54:19,830 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2025-03-04 00:54:19,831 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:54:19,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:54:19,833 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:54:19,833 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:54:19,839 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:19" (1/1) ... [2025-03-04 00:54:19,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:19" (1/1) ... [2025-03-04 00:54:19,842 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:19" (1/1) ... [2025-03-04 00:54:19,857 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:54:19,858 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:19" (1/1) ... [2025-03-04 00:54:19,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:19" (1/1) ... [2025-03-04 00:54:19,869 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:19" (1/1) ... [2025-03-04 00:54:19,870 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:19" (1/1) ... [2025-03-04 00:54:19,871 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:19" (1/1) ... [2025-03-04 00:54:19,872 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:19" (1/1) ... [2025-03-04 00:54:19,875 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:54:19,876 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:54:19,877 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:54:19,877 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:54:19,878 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:19" (1/1) ... [2025-03-04 00:54:19,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:54:19,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:54:19,905 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:54:19,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:54:19,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:54:19,929 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:54:19,929 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:54:19,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:54:19,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:54:19,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:54:19,989 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:54:19,990 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:54:20,199 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-04 00:54:20,199 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:54:20,207 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:54:20,207 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:54:20,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:54:20 BoogieIcfgContainer [2025-03-04 00:54:20,208 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:54:20,210 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:54:20,211 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:54:20,214 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:54:20,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:54:19" (1/3) ... [2025-03-04 00:54:20,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80f3ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:54:20, skipping insertion in model container [2025-03-04 00:54:20,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:19" (2/3) ... [2025-03-04 00:54:20,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80f3ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:54:20, skipping insertion in model container [2025-03-04 00:54:20,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:54:20" (3/3) ... [2025-03-04 00:54:20,218 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-41.i [2025-03-04 00:54:20,229 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:54:20,230 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-41.i that has 2 procedures, 47 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:54:20,276 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:54:20,289 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;@49edaf65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:54:20,291 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:54:20,295 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 00:54:20,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 00:54:20,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:54:20,302 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:54:20,303 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:54:20,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:54:20,307 INFO L85 PathProgramCache]: Analyzing trace with hash 322929534, now seen corresponding path program 1 times [2025-03-04 00:54:20,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:54:20,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315261073] [2025-03-04 00:54:20,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:54:20,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:54:20,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 00:54:20,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 00:54:20,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:54:20,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:54:20,511 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 00:54:20,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:54:20,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315261073] [2025-03-04 00:54:20,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315261073] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:54:20,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637035284] [2025-03-04 00:54:20,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:54:20,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:54:20,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:54:20,516 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:54:20,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:54:20,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 00:54:20,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 00:54:20,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:54:20,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:54:20,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:54:20,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:54:20,657 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 00:54:20,658 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:54:20,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637035284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:54:20,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:54:20,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:54:20,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052583975] [2025-03-04 00:54:20,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:54:20,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:54:20,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:54:20,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:54:20,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:54:20,680 INFO L87 Difference]: Start difference. First operand has 47 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 00:54:20,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:54:20,695 INFO L93 Difference]: Finished difference Result 88 states and 145 transitions. [2025-03-04 00:54:20,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:54:20,697 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 92 [2025-03-04 00:54:20,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:54:20,702 INFO L225 Difference]: With dead ends: 88 [2025-03-04 00:54:20,702 INFO L226 Difference]: Without dead ends: 44 [2025-03-04 00:54:20,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:54:20,707 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:54:20,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:54:20,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-04 00:54:20,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-04 00:54:20,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 00:54:20,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 63 transitions. [2025-03-04 00:54:20,737 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 63 transitions. Word has length 92 [2025-03-04 00:54:20,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:54:20,737 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 63 transitions. [2025-03-04 00:54:20,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 00:54:20,738 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 63 transitions. [2025-03-04 00:54:20,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 00:54:20,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:54:20,740 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:54:20,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:54:20,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:54:20,942 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:54:20,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:54:20,942 INFO L85 PathProgramCache]: Analyzing trace with hash 9390656, now seen corresponding path program 1 times [2025-03-04 00:54:20,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:54:20,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192056992] [2025-03-04 00:54:20,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:54:20,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:54:20,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 00:54:21,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 00:54:21,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:54:21,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:54:21,039 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:54:21,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 00:54:21,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 00:54:21,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:54:21,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:54:21,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:54:21,164 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:54:21,164 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:54:21,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:54:21,168 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 00:54:21,227 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:54:21,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:54:21 BoogieIcfgContainer [2025-03-04 00:54:21,233 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:54:21,234 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:54:21,234 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:54:21,234 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:54:21,235 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:54:20" (3/4) ... [2025-03-04 00:54:21,236 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:54:21,237 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:54:21,238 INFO L158 Benchmark]: Toolchain (without parser) took 1667.68ms. Allocated memory is still 167.8MB. Free memory was 135.0MB in the beginning and 46.2MB in the end (delta: 88.8MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2025-03-04 00:54:21,238 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:54:21,256 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.19ms. Allocated memory is still 167.8MB. Free memory was 134.6MB in the beginning and 122.1MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:54:21,256 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.08ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 120.0MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:54:21,256 INFO L158 Benchmark]: Boogie Preprocessor took 44.04ms. Allocated memory is still 167.8MB. Free memory was 120.0MB in the beginning and 117.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:54:21,257 INFO L158 Benchmark]: IcfgBuilder took 331.74ms. Allocated memory is still 167.8MB. Free memory was 117.9MB in the beginning and 102.4MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:54:21,257 INFO L158 Benchmark]: TraceAbstraction took 1023.03ms. Allocated memory is still 167.8MB. Free memory was 101.6MB in the beginning and 46.4MB in the end (delta: 55.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-04 00:54:21,257 INFO L158 Benchmark]: Witness Printer took 3.02ms. Allocated memory is still 167.8MB. Free memory was 46.4MB in the beginning and 46.2MB in the end (delta: 216.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:54:21,258 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.19ms. Allocated memory is still 167.8MB. Free memory was 134.6MB in the beginning and 122.1MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.08ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 120.0MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.04ms. Allocated memory is still 167.8MB. Free memory was 120.0MB in the beginning and 117.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 331.74ms. Allocated memory is still 167.8MB. Free memory was 117.9MB in the beginning and 102.4MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1023.03ms. Allocated memory is still 167.8MB. Free memory was 101.6MB in the beginning and 46.4MB in the end (delta: 55.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 3.02ms. Allocated memory is still 167.8MB. Free memory was 46.4MB in the beginning and 46.2MB in the end (delta: 216.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 someBinaryArithmeticDOUBLEoperation at line 41, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 42. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -16; [L23] unsigned char var_1_5 = 0; [L24] signed char var_1_6 = -8; [L25] signed char var_1_7 = 5; [L26] unsigned short int var_1_8 = 2; [L27] unsigned char var_1_11 = 0; [L28] double var_1_12 = 8.5; [L29] double var_1_13 = 999999999999.6; [L30] signed long int var_1_14 = 10; [L31] signed char var_1_15 = -1; [L32] unsigned char var_1_16 = 16; [L33] unsigned char var_1_17 = 64; [L34] signed char last_1_var_1_1 = -16; VAL [isInitial=0, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=0, var_1_6=-8, var_1_7=5, var_1_8=2] [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] CALL updateLastVariables() [L92] last_1_var_1_1 = var_1_1 VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=0, var_1_6=-8, var_1_7=5, var_1_8=2] [L102] RET updateLastVariables() [L103] CALL updateVariables() [L69] var_1_5 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_6=-8, var_1_7=5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_6=-8, var_1_7=5, var_1_8=2] [L70] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_6=-8, var_1_7=5, var_1_8=2] [L71] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-8, var_1_7=5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-8, var_1_7=5, var_1_8=2] [L71] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-8, var_1_7=5, var_1_8=2] [L72] var_1_6 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_6 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=5, var_1_8=2] [L73] RET assume_abort_if_not(var_1_6 >= -31) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=5, var_1_8=2] [L74] CALL assume_abort_if_not(var_1_6 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=5, var_1_8=2] [L74] RET assume_abort_if_not(var_1_6 <= 31) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=5, var_1_8=2] [L75] var_1_7 = __VERIFIER_nondet_char() [L76] CALL assume_abort_if_not(var_1_7 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L76] RET assume_abort_if_not(var_1_7 >= -63) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L77] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L77] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L78] var_1_11 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L79] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_1=-16, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L80] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L80] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L81] var_1_13 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L82] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L83] var_1_15 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_15 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=2, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=2, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L84] RET assume_abort_if_not(var_1_15 >= -128) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=2, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L85] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=2, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=2, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L85] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=2, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L86] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=2, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=2, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L86] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=2, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L87] var_1_17 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=2, var_1_16=16, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=2, var_1_16=16, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L88] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=2, var_1_16=16, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L89] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=2, var_1_16=16, var_1_17=1, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=2, var_1_16=16, var_1_17=1, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L89] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=2, var_1_16=16, var_1_17=1, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L103] RET updateVariables() [L104] CALL step() [L38] COND TRUE var_1_5 && (last_1_var_1_1 <= last_1_var_1_1) [L39] var_1_16 = var_1_17 VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=2, var_1_16=1, var_1_17=1, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L41] var_1_12 = (var_1_13 - 8.3) [L42] unsigned char stepLocal_1 = var_1_13 >= var_1_12; VAL [isInitial=1, last_1_var_1_1=-16, stepLocal_1=1, var_1_11=1, var_1_14=10, var_1_15=2, var_1_16=1, var_1_17=1, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L43] COND TRUE var_1_5 && stepLocal_1 [L44] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_14=1, var_1_15=2, var_1_16=1, var_1_17=1, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L48] COND TRUE \read(var_1_5) [L49] var_1_8 = (var_1_16 + var_1_16) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_14=1, var_1_15=2, var_1_16=1, var_1_17=1, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L57] unsigned long int stepLocal_0 = (var_1_8 & 0u) * var_1_16; VAL [isInitial=1, last_1_var_1_1=-16, stepLocal_0=0, var_1_11=1, var_1_14=1, var_1_15=2, var_1_16=1, var_1_17=1, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L58] COND FALSE !(stepLocal_0 > var_1_8) [L65] var_1_1 = var_1_6 VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_14=1, var_1_15=2, var_1_16=1, var_1_17=1, var_1_1=-31, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L104] RET step() [L105] CALL, EXPR property() [L95-L96] return (((((((var_1_8 & 0u) * var_1_16) > var_1_8) ? (var_1_5 ? (var_1_1 == ((signed char) ((16 + var_1_6) + var_1_7))) : (var_1_1 == ((signed char) ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))))) : (var_1_1 == ((signed char) var_1_6))) && (var_1_5 ? (var_1_8 == ((unsigned short int) (var_1_16 + var_1_16))) : (((var_1_16 > var_1_14) || var_1_11) ? (var_1_8 == ((unsigned short int) var_1_16)) : (var_1_8 == ((unsigned short int) var_1_16))))) && (var_1_12 == ((double) (var_1_13 - 8.3)))) && ((var_1_5 && (var_1_13 >= var_1_12)) ? (var_1_14 == ((signed long int) var_1_16)) : (var_1_14 == ((signed long int) var_1_15)))) && ((var_1_5 && (last_1_var_1_1 <= last_1_var_1_1)) ? (var_1_16 == ((unsigned char) var_1_17)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_14=1, var_1_15=2, var_1_16=1, var_1_17=1, var_1_1=-31, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_14=1, var_1_15=2, var_1_16=1, var_1_17=1, var_1_1=-31, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_14=1, var_1_15=2, var_1_16=1, var_1_17=1, var_1_1=-31, var_1_5=1, var_1_6=-31, var_1_7=0, var_1_8=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 63 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 182 ConstructedInterpolants, 0 QuantifiedInterpolants, 182 SizeOfPredicates, 0 NumberOfNonLiveVariables, 221 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 702/728 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 00:54:21,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-41.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 64487a3fc6d0bb9c63963975f2a88f7204d26acaec706a494cf6a9d1aeef08e8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:54:23,328 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:54:23,428 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:54:23,440 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:54:23,440 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:54:23,467 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:54:23,468 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:54:23,468 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:54:23,469 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:54:23,469 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:54:23,469 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:54:23,469 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:54:23,470 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:54:23,470 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:54:23,470 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:54:23,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:54:23,471 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:54:23,471 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:54:23,471 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:54:23,471 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:54:23,471 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:54:23,471 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:54:23,471 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:54:23,471 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:54:23,471 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:54:23,471 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:54:23,472 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:54:23,472 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:54:23,472 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:54:23,472 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:54:23,472 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:54:23,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:54:23,472 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:54:23,473 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:54:23,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:54:23,473 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:54:23,473 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:54:23,473 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:54:23,473 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:54:23,473 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:54:23,473 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:54:23,473 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:54:23,473 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:54:23,474 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:54:23,474 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:54:23,474 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 -> 64487a3fc6d0bb9c63963975f2a88f7204d26acaec706a494cf6a9d1aeef08e8 [2025-03-04 00:54:23,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:54:23,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:54:23,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:54:23,682 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:54:23,682 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:54:23,687 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-41.i [2025-03-04 00:54:24,895 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e01b255d/86aecc3325c84c87a889839c11ccb44a/FLAGfe7139e96 [2025-03-04 00:54:25,074 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:54:25,075 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-41.i [2025-03-04 00:54:25,082 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e01b255d/86aecc3325c84c87a889839c11ccb44a/FLAGfe7139e96 [2025-03-04 00:54:25,097 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e01b255d/86aecc3325c84c87a889839c11ccb44a [2025-03-04 00:54:25,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:54:25,102 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:54:25,103 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:54:25,104 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:54:25,107 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:54:25,107 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:54:25" (1/1) ... [2025-03-04 00:54:25,108 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e03662d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:25, skipping insertion in model container [2025-03-04 00:54:25,108 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:54:25" (1/1) ... [2025-03-04 00:54:25,125 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:54:25,243 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-41.i[913,926] [2025-03-04 00:54:25,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:54:25,317 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:54:25,325 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-41.i[913,926] [2025-03-04 00:54:25,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:54:25,364 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:54:25,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:25 WrapperNode [2025-03-04 00:54:25,366 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:54:25,367 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:54:25,367 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:54:25,367 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:54:25,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:25" (1/1) ... [2025-03-04 00:54:25,381 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:25" (1/1) ... [2025-03-04 00:54:25,403 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2025-03-04 00:54:25,403 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:54:25,404 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:54:25,404 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:54:25,404 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:54:25,411 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:25" (1/1) ... [2025-03-04 00:54:25,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:25" (1/1) ... [2025-03-04 00:54:25,414 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:25" (1/1) ... [2025-03-04 00:54:25,428 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:54:25,432 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:25" (1/1) ... [2025-03-04 00:54:25,432 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:25" (1/1) ... [2025-03-04 00:54:25,441 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:25" (1/1) ... [2025-03-04 00:54:25,442 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:25" (1/1) ... [2025-03-04 00:54:25,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:25" (1/1) ... [2025-03-04 00:54:25,445 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:25" (1/1) ... [2025-03-04 00:54:25,447 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:54:25,448 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:54:25,448 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:54:25,448 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:54:25,449 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:25" (1/1) ... [2025-03-04 00:54:25,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:54:25,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:54:25,479 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:54:25,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:54:25,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:54:25,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:54:25,500 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:54:25,500 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:54:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:54:25,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:54:25,562 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:54:25,564 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:54:25,996 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-04 00:54:25,996 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:54:26,002 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:54:26,003 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:54:26,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:54:26 BoogieIcfgContainer [2025-03-04 00:54:26,003 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:54:26,005 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:54:26,005 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:54:26,009 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:54:26,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:54:25" (1/3) ... [2025-03-04 00:54:26,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@346a8c73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:54:26, skipping insertion in model container [2025-03-04 00:54:26,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:25" (2/3) ... [2025-03-04 00:54:26,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@346a8c73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:54:26, skipping insertion in model container [2025-03-04 00:54:26,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:54:26" (3/3) ... [2025-03-04 00:54:26,012 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-41.i [2025-03-04 00:54:26,023 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:54:26,024 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-41.i that has 2 procedures, 47 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:54:26,077 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:54:26,090 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;@38c35bfd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:54:26,090 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:54:26,093 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 00:54:26,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 00:54:26,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:54:26,099 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:54:26,100 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:54:26,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:54:26,105 INFO L85 PathProgramCache]: Analyzing trace with hash 322929534, now seen corresponding path program 1 times [2025-03-04 00:54:26,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:54:26,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487378920] [2025-03-04 00:54:26,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:54:26,113 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:54:26,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:54:26,116 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:54:26,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 00:54:26,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 00:54:26,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 00:54:26,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:54:26,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:54:26,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:54:26,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:54:26,324 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2025-03-04 00:54:26,325 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:54:26,325 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:54:26,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487378920] [2025-03-04 00:54:26,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487378920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:54:26,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:54:26,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:54:26,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316390301] [2025-03-04 00:54:26,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:54:26,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:54:26,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:54:26,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:54:26,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:54:26,344 INFO L87 Difference]: Start difference. First operand has 47 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 00:54:26,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:54:26,360 INFO L93 Difference]: Finished difference Result 88 states and 145 transitions. [2025-03-04 00:54:26,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:54:26,361 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 92 [2025-03-04 00:54:26,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:54:26,365 INFO L225 Difference]: With dead ends: 88 [2025-03-04 00:54:26,365 INFO L226 Difference]: Without dead ends: 44 [2025-03-04 00:54:26,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:54:26,368 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:54:26,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:54:26,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-04 00:54:26,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-04 00:54:26,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 00:54:26,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 63 transitions. [2025-03-04 00:54:26,391 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 63 transitions. Word has length 92 [2025-03-04 00:54:26,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:54:26,392 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 63 transitions. [2025-03-04 00:54:26,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 00:54:26,392 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 63 transitions. [2025-03-04 00:54:26,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 00:54:26,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:54:26,394 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:54:26,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:54:26,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:54:26,595 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:54:26,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:54:26,596 INFO L85 PathProgramCache]: Analyzing trace with hash 9390656, now seen corresponding path program 1 times [2025-03-04 00:54:26,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:54:26,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1819294163] [2025-03-04 00:54:26,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:54:26,597 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:54:26,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:54:26,599 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:54:26,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 00:54:26,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 00:54:26,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 00:54:26,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:54:26,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:54:26,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 00:54:26,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:55:26,448 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 00:55:26,448 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:55:26,448 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:55:26,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1819294163] [2025-03-04 00:55:26,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1819294163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:55:26,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:55:26,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:55:26,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217272257] [2025-03-04 00:55:26,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:55:26,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:55:26,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:55:26,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:55:26,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:55:26,451 INFO L87 Difference]: Start difference. First operand 44 states and 63 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 00:55:44,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:55:44,471 INFO L93 Difference]: Finished difference Result 140 states and 198 transitions. [2025-03-04 00:55:44,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:55:44,472 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2025-03-04 00:55:44,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:55:44,474 INFO L225 Difference]: With dead ends: 140 [2025-03-04 00:55:44,474 INFO L226 Difference]: Without dead ends: 99 [2025-03-04 00:55:44,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:55:44,475 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 70 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:55:44,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 437 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 12.2s Time] [2025-03-04 00:55:44,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-04 00:55:44,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 85. [2025-03-04 00:55:44,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.25) internal successors, (70), 57 states have internal predecessors, (70), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 00:55:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 122 transitions. [2025-03-04 00:55:44,485 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 122 transitions. Word has length 92 [2025-03-04 00:55:44,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:55:44,485 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 122 transitions. [2025-03-04 00:55:44,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 00:55:44,486 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 122 transitions. [2025-03-04 00:55:44,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 00:55:44,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:55:44,487 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:55:44,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 00:55:44,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:55:44,688 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:55:44,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:55:44,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1752200991, now seen corresponding path program 1 times [2025-03-04 00:55:44,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:55:44,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902258382] [2025-03-04 00:55:44,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:55:44,689 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:55:44,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:55:44,692 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:55:44,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 00:55:44,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 00:55:44,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 00:55:44,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:55:44,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:55:44,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 00:55:44,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:55:53,647 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 189 proven. 15 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2025-03-04 00:55:53,647 INFO L312 TraceCheckSpWp]: Computing backward predicates...