./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-12.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_operatoramount_amount10_file-12.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 148999594253053f645653c1095151edf31299f622d6000962ab26f32e38bd4b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:02:51,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:02:51,810 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:02:51,813 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:02:51,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:02:51,838 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:02:51,839 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:02:51,839 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:02:51,840 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:02:51,840 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:02:51,841 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:02:51,841 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:02:51,841 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:02:51,841 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:02:51,841 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:02:51,842 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:02:51,842 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:02:51,842 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:02:51,842 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:02:51,842 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:02:51,842 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:02:51,842 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:02:51,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:02:51,842 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:02:51,842 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:02:51,843 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:02:51,843 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:02:51,843 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:02:51,843 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:02:51,843 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:02:51,843 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:02:51,843 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:02:51,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:02:51,844 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:02:51,844 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:02:51,844 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:02:51,844 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:02:51,844 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:02:51,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:02:51,844 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:02:51,844 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:02:51,844 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:02:51,844 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:02:51,844 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 -> 148999594253053f645653c1095151edf31299f622d6000962ab26f32e38bd4b [2025-03-04 00:02:52,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:02:52,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:02:52,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:02:52,083 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:02:52,083 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:02:52,084 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-12.i [2025-03-04 00:02:53,185 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/126eb0ffe/ffec2b6bf9c14e3b909cdd0c193df778/FLAG85cb842c9 [2025-03-04 00:02:53,392 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:02:53,393 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-12.i [2025-03-04 00:02:53,404 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/126eb0ffe/ffec2b6bf9c14e3b909cdd0c193df778/FLAG85cb842c9 [2025-03-04 00:02:53,751 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/126eb0ffe/ffec2b6bf9c14e3b909cdd0c193df778 [2025-03-04 00:02:53,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:02:53,753 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:02:53,754 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:02:53,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:02:53,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:02:53,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:02:53" (1/1) ... [2025-03-04 00:02:53,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ed0eb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:53, skipping insertion in model container [2025-03-04 00:02:53,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:02:53" (1/1) ... [2025-03-04 00:02:53,770 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:02:53,868 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_operatoramount_amount10_file-12.i[915,928] [2025-03-04 00:02:53,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:02:53,908 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:02:53,915 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_operatoramount_amount10_file-12.i[915,928] [2025-03-04 00:02:53,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:02:53,942 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:02:53,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:53 WrapperNode [2025-03-04 00:02:53,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:02:53,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:02:53,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:02:53,944 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:02:53,949 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:02:53" (1/1) ... [2025-03-04 00:02:53,953 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:02:53" (1/1) ... [2025-03-04 00:02:53,968 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 65 [2025-03-04 00:02:53,969 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:02:53,970 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:02:53,970 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:02:53,970 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:02:53,976 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:53" (1/1) ... [2025-03-04 00:02:53,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:53" (1/1) ... [2025-03-04 00:02:53,978 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:53" (1/1) ... [2025-03-04 00:02:53,993 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:02:53,993 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:53" (1/1) ... [2025-03-04 00:02:53,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:53" (1/1) ... [2025-03-04 00:02:53,996 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:53" (1/1) ... [2025-03-04 00:02:53,996 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:53" (1/1) ... [2025-03-04 00:02:53,997 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:53" (1/1) ... [2025-03-04 00:02:53,997 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:53" (1/1) ... [2025-03-04 00:02:53,998 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:02:53,998 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:02:53,999 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:02:53,999 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:02:53,999 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:53" (1/1) ... [2025-03-04 00:02:54,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:02:54,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:02:54,023 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:02:54,025 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:02:54,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:02:54,039 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:02:54,040 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:02:54,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:02:54,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:02:54,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:02:54,081 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:02:54,083 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:02:54,198 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-04 00:02:54,198 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:02:54,204 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:02:54,204 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:02:54,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:02:54 BoogieIcfgContainer [2025-03-04 00:02:54,205 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:02:54,206 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:02:54,207 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:02:54,210 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:02:54,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:02:53" (1/3) ... [2025-03-04 00:02:54,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3952563b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:02:54, skipping insertion in model container [2025-03-04 00:02:54,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:53" (2/3) ... [2025-03-04 00:02:54,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3952563b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:02:54, skipping insertion in model container [2025-03-04 00:02:54,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:02:54" (3/3) ... [2025-03-04 00:02:54,212 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-12.i [2025-03-04 00:02:54,224 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:02:54,226 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-12.i that has 2 procedures, 29 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:02:54,262 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:02:54,270 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;@1a93cf6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:02:54,271 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:02:54,275 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 00:02:54,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 00:02:54,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:02:54,281 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 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:02:54,281 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:02:54,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:02:54,286 INFO L85 PathProgramCache]: Analyzing trace with hash -438787047, now seen corresponding path program 1 times [2025-03-04 00:02:54,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:02:54,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518810173] [2025-03-04 00:02:54,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:02:54,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:02:54,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 00:02:54,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 00:02:54,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:02:54,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:02:54,410 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 00:02:54,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:02:54,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518810173] [2025-03-04 00:02:54,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518810173] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:02:54,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860301771] [2025-03-04 00:02:54,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:02:54,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:02:54,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:02:54,413 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:02:54,415 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:02:54,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 00:02:54,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 00:02:54,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:02:54,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:02:54,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:02:54,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:02:54,500 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 00:02:54,500 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:02:54,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860301771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:02:54,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:02:54,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:02:54,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044039422] [2025-03-04 00:02:54,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:02:54,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:02:54,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:02:54,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:02:54,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:02:54,519 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 00:02:54,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:02:54,533 INFO L93 Difference]: Finished difference Result 52 states and 75 transitions. [2025-03-04 00:02:54,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:02:54,535 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2025-03-04 00:02:54,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:02:54,539 INFO L225 Difference]: With dead ends: 52 [2025-03-04 00:02:54,539 INFO L226 Difference]: Without dead ends: 26 [2025-03-04 00:02:54,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 45 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:02:54,542 INFO L435 NwaCegarLoop]: 32 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, 32 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:02:54,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:02:54,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-04 00:02:54,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-04 00:02:54,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 00:02:54,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2025-03-04 00:02:54,563 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 44 [2025-03-04 00:02:54,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:02:54,564 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2025-03-04 00:02:54,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 00:02:54,564 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2025-03-04 00:02:54,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 00:02:54,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:02:54,565 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 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:02:54,571 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:02:54,766 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:02:54,766 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:02:54,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:02:54,767 INFO L85 PathProgramCache]: Analyzing trace with hash -565716103, now seen corresponding path program 1 times [2025-03-04 00:02:54,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:02:54,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672438603] [2025-03-04 00:02:54,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:02:54,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:02:54,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 00:02:54,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 00:02:54,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:02:54,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:02:54,831 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:02:54,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 00:02:54,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 00:02:54,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:02:54,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:02:54,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:02:54,873 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:02:54,875 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:02:54,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:02:54,878 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 00:02:54,911 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:02:54,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:02:54 BoogieIcfgContainer [2025-03-04 00:02:54,914 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:02:54,914 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:02:54,915 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:02:54,915 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:02:54,915 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:02:54" (3/4) ... [2025-03-04 00:02:54,917 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:02:54,917 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:02:54,918 INFO L158 Benchmark]: Toolchain (without parser) took 1164.21ms. Allocated memory is still 167.8MB. Free memory was 124.2MB in the beginning and 57.4MB in the end (delta: 66.8MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-04 00:02:54,918 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:02:54,918 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.02ms. Allocated memory is still 167.8MB. Free memory was 124.2MB in the beginning and 112.1MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:02:54,918 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.57ms. Allocated memory is still 167.8MB. Free memory was 112.1MB in the beginning and 110.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:02:54,918 INFO L158 Benchmark]: Boogie Preprocessor took 27.99ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 109.3MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:02:54,919 INFO L158 Benchmark]: IcfgBuilder took 206.12ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 97.0MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:02:54,919 INFO L158 Benchmark]: TraceAbstraction took 707.27ms. Allocated memory is still 167.8MB. Free memory was 96.2MB in the beginning and 57.4MB in the end (delta: 38.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-04 00:02:54,919 INFO L158 Benchmark]: Witness Printer took 2.69ms. Allocated memory is still 167.8MB. Free memory is still 57.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:02:54,920 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.02ms. Allocated memory is still 167.8MB. Free memory was 124.2MB in the beginning and 112.1MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.57ms. Allocated memory is still 167.8MB. Free memory was 112.1MB in the beginning and 110.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.99ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 109.3MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 206.12ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 97.0MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 707.27ms. Allocated memory is still 167.8MB. Free memory was 96.2MB in the beginning and 57.4MB in the end (delta: 38.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 2.69ms. Allocated memory is still 167.8MB. Free memory is still 57.4MB. 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 someBinaryDOUBLEComparisonOperation at line 58. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 4; [L23] signed char var_1_4 = -1; [L24] signed char var_1_5 = 100; [L25] signed long int var_1_6 = 1000; [L26] double var_1_7 = 4.5; [L27] unsigned char var_1_8 = 1; [L28] unsigned char var_1_9 = 0; [L29] signed long int var_1_10 = 256; [L30] signed char last_1_var_1_1 = 4; VAL [isInitial=0, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=-1, var_1_5=100, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L62] isInitial = 1 [L63] FCALL initially() [L64] COND TRUE 1 [L65] CALL updateLastVariables() [L55] last_1_var_1_1 = var_1_1 VAL [isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=-1, var_1_5=100, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L65] RET updateLastVariables() [L66] CALL updateVariables() [L44] var_1_4 = __VERIFIER_nondet_char() [L45] CALL assume_abort_if_not(var_1_4 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=100, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=100, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L45] RET assume_abort_if_not(var_1_4 >= -126) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=100, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L46] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=100, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=100, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L46] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=100, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L47] var_1_5 = __VERIFIER_nondet_char() [L48] CALL assume_abort_if_not(var_1_5 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L48] RET assume_abort_if_not(var_1_5 >= -126) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L49] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L49] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L50] var_1_9 = __VERIFIER_nondet_uchar() [L51] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1] [L51] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1] [L52] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L52] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L66] RET updateVariables() [L67] CALL step() [L34] var_1_7 = 199.5 [L35] var_1_8 = var_1_9 [L36] var_1_10 = var_1_5 [L37] signed long int stepLocal_0 = var_1_10; VAL [isInitial=1, last_1_var_1_1=4, stepLocal_0=4, var_1_10=4, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=399/2, var_1_8=0, var_1_9=0] [L38] COND TRUE stepLocal_0 >= last_1_var_1_1 [L39] var_1_1 = (((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))) < 0 ) ? -((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))) : ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=4, var_1_1=0, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=399/2, var_1_8=0, var_1_9=0] [L41] var_1_6 = ((((var_1_4) > (var_1_1)) ? (var_1_4) : (var_1_1))) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=4, var_1_1=0, var_1_4=0, var_1_5=4, var_1_6=0, var_1_7=399/2, var_1_8=0, var_1_9=0] [L67] RET step() [L68] CALL, EXPR property() [L58-L59] return (((((var_1_10 >= last_1_var_1_1) ? (var_1_1 == ((signed char) (((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))) < 0 ) ? -((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))) : ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))))) : 1) && (var_1_6 == ((signed long int) ((((var_1_4) > (var_1_1)) ? (var_1_4) : (var_1_1)))))) && (var_1_7 == ((double) 199.5))) && (var_1_8 == ((unsigned char) var_1_9))) && (var_1_10 == ((signed long int) var_1_5)) ; VAL [\result=0, isInitial=1, last_1_var_1_1=4, var_1_10=4, var_1_1=0, var_1_4=0, var_1_5=4, var_1_6=0, var_1_7=399/2, var_1_8=0, var_1_9=0] [L68] RET, EXPR property() [L68] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=4, var_1_1=0, var_1_4=0, var_1_5=4, var_1_6=0, var_1_7=399/2, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=4, var_1_10=4, var_1_1=0, var_1_4=0, var_1_5=4, var_1_6=0, var_1_7=399/2, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 6, 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, 32 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, 32 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred 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.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 86 SizeOfPredicates, 0 NumberOfNonLiveVariables, 131 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 110/120 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:02:54,932 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_operatoramount_amount10_file-12.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 148999594253053f645653c1095151edf31299f622d6000962ab26f32e38bd4b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:02:56,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:02:56,791 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:02:56,797 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:02:56,798 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:02:56,821 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:02:56,822 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:02:56,823 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:02:56,823 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:02:56,823 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:02:56,824 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:02:56,824 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:02:56,824 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:02:56,824 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:02:56,824 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:02:56,825 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:02:56,825 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:02:56,825 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:02:56,825 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:02:56,825 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:02:56,825 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:02:56,825 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:02:56,825 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:02:56,826 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:02:56,826 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:02:56,826 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:02:56,826 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:02:56,826 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:02:56,826 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:02:56,826 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:02:56,826 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:02:56,826 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:02:56,827 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:02:56,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:02:56,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:02:56,827 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:02:56,827 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:02:56,827 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:02:56,827 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:02:56,827 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:02:56,827 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:02:56,827 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:02:56,827 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:02:56,827 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:02:56,827 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:02:56,827 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 -> 148999594253053f645653c1095151edf31299f622d6000962ab26f32e38bd4b [2025-03-04 00:02:57,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:02:57,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:02:57,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:02:57,077 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:02:57,077 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:02:57,078 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-12.i [2025-03-04 00:02:58,239 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4183f3fe/162fb2d2b5f64ec88053ab9ed4057484/FLAGa7c7a1beb [2025-03-04 00:02:58,392 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:02:58,392 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-12.i [2025-03-04 00:02:58,398 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4183f3fe/162fb2d2b5f64ec88053ab9ed4057484/FLAGa7c7a1beb [2025-03-04 00:02:58,790 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4183f3fe/162fb2d2b5f64ec88053ab9ed4057484 [2025-03-04 00:02:58,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:02:58,793 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:02:58,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:02:58,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:02:58,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:02:58,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:02:58" (1/1) ... [2025-03-04 00:02:58,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e03d0e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:58, skipping insertion in model container [2025-03-04 00:02:58,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:02:58" (1/1) ... [2025-03-04 00:02:58,811 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:02:58,916 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_operatoramount_amount10_file-12.i[915,928] [2025-03-04 00:02:58,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:02:58,959 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:02:58,968 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_operatoramount_amount10_file-12.i[915,928] [2025-03-04 00:02:58,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:02:58,999 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:02:59,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:59 WrapperNode [2025-03-04 00:02:59,000 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:02:59,001 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:02:59,001 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:02:59,001 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:02:59,006 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:02:59" (1/1) ... [2025-03-04 00:02:59,013 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:02:59" (1/1) ... [2025-03-04 00:02:59,025 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 63 [2025-03-04 00:02:59,025 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:02:59,025 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:02:59,025 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:02:59,026 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:02:59,033 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:59" (1/1) ... [2025-03-04 00:02:59,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:59" (1/1) ... [2025-03-04 00:02:59,036 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:59" (1/1) ... [2025-03-04 00:02:59,044 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:02:59,044 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:59" (1/1) ... [2025-03-04 00:02:59,044 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:59" (1/1) ... [2025-03-04 00:02:59,050 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:59" (1/1) ... [2025-03-04 00:02:59,050 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:59" (1/1) ... [2025-03-04 00:02:59,054 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:59" (1/1) ... [2025-03-04 00:02:59,055 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:59" (1/1) ... [2025-03-04 00:02:59,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:02:59,057 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:02:59,058 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:02:59,062 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:02:59,063 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:59" (1/1) ... [2025-03-04 00:02:59,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:02:59,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:02:59,089 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:02:59,092 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:02:59,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:02:59,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:02:59,112 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:02:59,112 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:02:59,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:02:59,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:02:59,164 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:02:59,166 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:02:59,314 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-04 00:02:59,315 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:02:59,323 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:02:59,324 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:02:59,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:02:59 BoogieIcfgContainer [2025-03-04 00:02:59,325 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:02:59,327 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:02:59,327 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:02:59,330 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:02:59,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:02:58" (1/3) ... [2025-03-04 00:02:59,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e5b75d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:02:59, skipping insertion in model container [2025-03-04 00:02:59,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:59" (2/3) ... [2025-03-04 00:02:59,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e5b75d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:02:59, skipping insertion in model container [2025-03-04 00:02:59,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:02:59" (3/3) ... [2025-03-04 00:02:59,333 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-12.i [2025-03-04 00:02:59,343 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:02:59,345 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-12.i that has 2 procedures, 29 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:02:59,389 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:02:59,398 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;@6712675e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:02:59,399 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:02:59,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 00:02:59,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 00:02:59,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:02:59,407 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 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:02:59,407 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:02:59,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:02:59,412 INFO L85 PathProgramCache]: Analyzing trace with hash -438787047, now seen corresponding path program 1 times [2025-03-04 00:02:59,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:02:59,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922654257] [2025-03-04 00:02:59,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:02:59,419 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:02:59,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:02:59,423 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:02:59,424 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:02:59,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 00:02:59,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 00:02:59,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:02:59,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:02:59,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:02:59,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:02:59,535 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 00:02:59,535 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:02:59,536 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:02:59,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922654257] [2025-03-04 00:02:59,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922654257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:02:59,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:02:59,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:02:59,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855294656] [2025-03-04 00:02:59,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:02:59,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:02:59,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:02:59,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:02:59,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:02:59,558 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 00:02:59,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:02:59,572 INFO L93 Difference]: Finished difference Result 52 states and 75 transitions. [2025-03-04 00:02:59,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:02:59,574 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2025-03-04 00:02:59,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:02:59,579 INFO L225 Difference]: With dead ends: 52 [2025-03-04 00:02:59,579 INFO L226 Difference]: Without dead ends: 26 [2025-03-04 00:02:59,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 43 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:02:59,584 INFO L435 NwaCegarLoop]: 32 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, 32 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:02:59,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:02:59,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-04 00:02:59,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-04 00:02:59,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 00:02:59,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2025-03-04 00:02:59,606 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 44 [2025-03-04 00:02:59,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:02:59,607 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2025-03-04 00:02:59,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 00:02:59,607 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2025-03-04 00:02:59,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 00:02:59,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:02:59,609 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 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:02:59,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 00:02:59,809 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:02:59,810 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:02:59,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:02:59,810 INFO L85 PathProgramCache]: Analyzing trace with hash -565716103, now seen corresponding path program 1 times [2025-03-04 00:02:59,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:02:59,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [673450108] [2025-03-04 00:02:59,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:02:59,811 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:02:59,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:02:59,813 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:02:59,825 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:02:59,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 00:02:59,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 00:02:59,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:02:59,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:02:59,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 00:02:59,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:03:03,942 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 00:03:03,942 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:03:03,942 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:03:03,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [673450108] [2025-03-04 00:03:03,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [673450108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:03:03,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:03:03,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 00:03:03,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838156496] [2025-03-04 00:03:03,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:03:03,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:03:03,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:03:03,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:03:03,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:03:03,946 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 00:03:04,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:03:04,149 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2025-03-04 00:03:04,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 00:03:04,150 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 44 [2025-03-04 00:03:04,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:03:04,150 INFO L225 Difference]: With dead ends: 44 [2025-03-04 00:03:04,150 INFO L226 Difference]: Without dead ends: 42 [2025-03-04 00:03:04,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:03:04,151 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 28 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:03:04,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 141 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:03:04,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-04 00:03:04,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2025-03-04 00:03:04,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 00:03:04,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2025-03-04 00:03:04,164 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 44 [2025-03-04 00:03:04,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:03:04,164 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2025-03-04 00:03:04,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 00:03:04,165 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2025-03-04 00:03:04,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 00:03:04,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:03:04,166 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 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:03:04,169 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:03:04,369 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:03:04,370 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:03:04,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:03:04,373 INFO L85 PathProgramCache]: Analyzing trace with hash -537086952, now seen corresponding path program 1 times [2025-03-04 00:03:04,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:03:04,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328891201] [2025-03-04 00:03:04,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:03:04,373 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:03:04,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:03:04,375 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:03:04,377 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:03:04,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 00:03:04,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 00:03:04,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:03:04,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:03:04,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 00:03:04,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:03:06,532 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 00:03:06,534 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:03:06,534 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:03:06,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328891201] [2025-03-04 00:03:06,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328891201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:03:06,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:03:06,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 00:03:06,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408220915] [2025-03-04 00:03:06,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:03:06,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:03:06,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:03:06,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:03:06,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:03:06,535 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 00:03:06,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:03:06,744 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2025-03-04 00:03:06,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:03:06,745 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 44 [2025-03-04 00:03:06,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:03:06,746 INFO L225 Difference]: With dead ends: 66 [2025-03-04 00:03:06,747 INFO L226 Difference]: Without dead ends: 64 [2025-03-04 00:03:06,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:03:06,748 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 18 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:03:06,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 184 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:03:06,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-04 00:03:06,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2025-03-04 00:03:06,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 45 states have internal predecessors, (47), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 00:03:06,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2025-03-04 00:03:06,759 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 44 [2025-03-04 00:03:06,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:03:06,759 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2025-03-04 00:03:06,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 00:03:06,759 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2025-03-04 00:03:06,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-04 00:03:06,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:03:06,762 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:03:06,766 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 (4)] Ended with exit code 0 [2025-03-04 00:03:06,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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:03:06,962 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:03:06,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:03:06,963 INFO L85 PathProgramCache]: Analyzing trace with hash -2059089987, now seen corresponding path program 1 times [2025-03-04 00:03:06,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:03:06,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926971310] [2025-03-04 00:03:06,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:03:06,963 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:03:06,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:03:06,966 INFO L229 MonitoredProcess]: Starting monitored process 5 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:03:06,967 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 (5)] Waiting until timeout for monitored process [2025-03-04 00:03:06,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 00:03:07,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 00:03:07,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:03:07,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:03:07,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 00:03:07,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:03:08,298 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2025-03-04 00:03:08,298 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:03:08,298 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:03:08,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926971310] [2025-03-04 00:03:08,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [926971310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:03:08,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:03:08,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 00:03:08,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089135553] [2025-03-04 00:03:08,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:03:08,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:03:08,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:03:08,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:03:08,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:03:08,300 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 00:03:08,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:03:08,400 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2025-03-04 00:03:08,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 00:03:08,401 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 85 [2025-03-04 00:03:08,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:03:08,402 INFO L225 Difference]: With dead ends: 65 [2025-03-04 00:03:08,402 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 00:03:08,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:03:08,402 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 8 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:03:08,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 123 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:03:08,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 00:03:08,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 00:03:08,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 00:03:08,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 00:03:08,404 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2025-03-04 00:03:08,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:03:08,404 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 00:03:08,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 00:03:08,404 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 00:03:08,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 00:03:08,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:03:08,414 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 (5)] Ended with exit code 0 [2025-03-04 00:03:08,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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:03:08,613 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-04 00:03:08,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 00:03:08,770 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:03:08,776 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-04 00:03:08,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:03:08 BoogieIcfgContainer [2025-03-04 00:03:08,778 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:03:08,779 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:03:08,779 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:03:08,779 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:03:08,780 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:02:59" (3/4) ... [2025-03-04 00:03:08,781 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 00:03:08,784 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-04 00:03:08,787 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-04 00:03:08,787 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 00:03:08,787 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 00:03:08,787 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 00:03:08,838 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 00:03:08,839 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 00:03:08,839 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:03:08,839 INFO L158 Benchmark]: Toolchain (without parser) took 10046.16ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 90.5MB in the beginning and 361.5MB in the end (delta: -271.0MB). Peak memory consumption was 365.7MB. Max. memory is 16.1GB. [2025-03-04 00:03:08,839 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 83.9MB. Free memory was 60.9MB in the beginning and 60.9MB in the end (delta: 18.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:03:08,839 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.39ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 78.2MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:03:08,840 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.82ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 76.8MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:03:08,840 INFO L158 Benchmark]: Boogie Preprocessor took 31.14ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 75.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:03:08,840 INFO L158 Benchmark]: IcfgBuilder took 267.69ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 63.1MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:03:08,840 INFO L158 Benchmark]: TraceAbstraction took 9451.90ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 62.6MB in the beginning and 365.8MB in the end (delta: -303.2MB). Peak memory consumption was 332.1MB. Max. memory is 16.1GB. [2025-03-04 00:03:08,840 INFO L158 Benchmark]: Witness Printer took 59.65ms. Allocated memory is still 755.0MB. Free memory was 365.8MB in the beginning and 361.5MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:03:08,843 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.21ms. Allocated memory is still 83.9MB. Free memory was 60.9MB in the beginning and 60.9MB in the end (delta: 18.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.39ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 78.2MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.82ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 76.8MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.14ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 75.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 267.69ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 63.1MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9451.90ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 62.6MB in the beginning and 365.8MB in the end (delta: -303.2MB). Peak memory consumption was 332.1MB. Max. memory is 16.1GB. * Witness Printer took 59.65ms. Allocated memory is still 755.0MB. Free memory was 365.8MB in the beginning and 361.5MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 4, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 54 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 480 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 343 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 207 IncrementalHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 137 mSDtfsCounter, 207 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=3, InterpolantAutomatonStates: 24, 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, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 213 ConstructedInterpolants, 0 QuantifiedInterpolants, 773 SizeOfPredicates, 30 NumberOfNonLiveVariables, 393 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 460/460 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 64]: Location Invariant Derived location invariant: (((var_1_1 == 4) && (4 == last_1_var_1_1)) || ((var_1_5 == var_1_10) && (var_1_8 == var_1_9))) RESULT: Ultimate proved your program to be correct! [2025-03-04 00:03:08,860 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 Writing output log to file Ultimate.log Result: TRUE