./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-0.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-0.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 342a391425e9273144e7f8d0607b5266ee0425388e31ab43115bf3acb263154c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:02:33,558 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:02:33,610 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:33,614 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:02:33,615 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:02:33,630 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:02:33,631 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:02:33,631 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:02:33,631 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:02:33,632 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:02:33,632 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:02:33,632 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:02:33,633 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:02:33,633 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:02:33,633 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:02:33,633 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:02:33,633 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:02:33,633 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:02:33,634 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:02:33,634 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:02:33,634 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:02:33,634 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:02:33,634 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:02:33,634 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:02:33,634 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:02:33,634 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:02:33,634 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:02:33,634 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:02:33,634 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:02:33,634 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:02:33,634 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:02:33,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:02:33,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:02:33,635 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:02:33,635 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:02:33,635 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:02:33,635 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:02:33,636 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:02:33,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:02:33,636 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:02:33,636 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:02:33,636 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:02:33,636 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:02:33,636 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 -> 342a391425e9273144e7f8d0607b5266ee0425388e31ab43115bf3acb263154c [2025-03-04 00:02:33,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:02:33,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:02:33,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:02:33,930 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:02:33,930 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:02:33,931 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-0.i [2025-03-04 00:02:35,116 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f4517ab2/dad9a769a2c74e3d91b8271d6508a8ee/FLAG0c7898326 [2025-03-04 00:02:35,354 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:02:35,354 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-0.i [2025-03-04 00:02:35,360 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f4517ab2/dad9a769a2c74e3d91b8271d6508a8ee/FLAG0c7898326 [2025-03-04 00:02:35,699 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f4517ab2/dad9a769a2c74e3d91b8271d6508a8ee [2025-03-04 00:02:35,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:02:35,702 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:02:35,703 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:02:35,703 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:02:35,706 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:02:35,707 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:02:35" (1/1) ... [2025-03-04 00:02:35,707 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef3eaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:35, skipping insertion in model container [2025-03-04 00:02:35,708 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:02:35" (1/1) ... [2025-03-04 00:02:35,718 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:02:35,829 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-0.i[914,927] [2025-03-04 00:02:35,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:02:35,868 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:02:35,876 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-0.i[914,927] [2025-03-04 00:02:35,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:02:35,904 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:02:35,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:35 WrapperNode [2025-03-04 00:02:35,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:02:35,908 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:02:35,908 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:02:35,908 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:02:35,913 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:35" (1/1) ... [2025-03-04 00:02:35,924 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:35" (1/1) ... [2025-03-04 00:02:35,941 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 65 [2025-03-04 00:02:35,942 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:02:35,943 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:02:35,943 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:02:35,943 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:02:35,950 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:35" (1/1) ... [2025-03-04 00:02:35,951 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:35" (1/1) ... [2025-03-04 00:02:35,952 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:35" (1/1) ... [2025-03-04 00:02:35,965 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:35,966 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:35" (1/1) ... [2025-03-04 00:02:35,966 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:35" (1/1) ... [2025-03-04 00:02:35,969 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:35" (1/1) ... [2025-03-04 00:02:35,973 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:35" (1/1) ... [2025-03-04 00:02:35,974 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:35" (1/1) ... [2025-03-04 00:02:35,978 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:35" (1/1) ... [2025-03-04 00:02:35,979 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:02:35,980 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:02:35,980 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:02:35,980 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:02:35,981 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:35" (1/1) ... [2025-03-04 00:02:35,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:02:35,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:02:36,011 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:36,017 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:36,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:02:36,033 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:02:36,033 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:02:36,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:02:36,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:02:36,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:02:36,085 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:02:36,087 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:02:36,196 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 00:02:36,196 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:02:36,203 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:02:36,203 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:02:36,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:02:36 BoogieIcfgContainer [2025-03-04 00:02:36,204 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:02:36,207 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:02:36,207 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:02:36,210 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:02:36,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:02:35" (1/3) ... [2025-03-04 00:02:36,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f8a3582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:02:36, skipping insertion in model container [2025-03-04 00:02:36,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:35" (2/3) ... [2025-03-04 00:02:36,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f8a3582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:02:36, skipping insertion in model container [2025-03-04 00:02:36,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:02:36" (3/3) ... [2025-03-04 00:02:36,214 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-0.i [2025-03-04 00:02:36,225 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:02:36,226 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-0.i that has 2 procedures, 31 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:02:36,277 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:02:36,289 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4d1a93fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:02:36,289 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:02:36,295 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 00:02:36,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 00:02:36,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:02:36,303 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 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:36,304 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:02:36,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:02:36,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1194608137, now seen corresponding path program 1 times [2025-03-04 00:02:36,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:02:36,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972512779] [2025-03-04 00:02:36,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:02:36,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:02:36,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 00:02:36,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 00:02:36,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:02:36,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:02:36,491 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-04 00:02:36,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:02:36,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972512779] [2025-03-04 00:02:36,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972512779] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:02:36,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976121979] [2025-03-04 00:02:36,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:02:36,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:02:36,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:02:36,497 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:36,499 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:36,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 00:02:36,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 00:02:36,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:02:36,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:02:36,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:02:36,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:02:36,599 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-04 00:02:36,599 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:02:36,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976121979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:02:36,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:02:36,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:02:36,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482098139] [2025-03-04 00:02:36,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:02:36,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:02:36,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:02:36,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:02:36,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:02:36,621 INFO L87 Difference]: Start difference. First operand has 31 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 00:02:36,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:02:36,634 INFO L93 Difference]: Finished difference Result 56 states and 82 transitions. [2025-03-04 00:02:36,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:02:36,635 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2025-03-04 00:02:36,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:02:36,640 INFO L225 Difference]: With dead ends: 56 [2025-03-04 00:02:36,640 INFO L226 Difference]: Without dead ends: 28 [2025-03-04 00:02:36,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 51 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:36,646 INFO L435 NwaCegarLoop]: 35 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, 35 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:36,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 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:36,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-04 00:02:36,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-04 00:02:36,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 00:02:36,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2025-03-04 00:02:36,675 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 50 [2025-03-04 00:02:36,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:02:36,675 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-03-04 00:02:36,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 00:02:36,676 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2025-03-04 00:02:36,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 00:02:36,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:02:36,677 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 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:36,684 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:36,878 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:36,878 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:02:36,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:02:36,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1466818438, now seen corresponding path program 1 times [2025-03-04 00:02:36,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:02:36,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379226640] [2025-03-04 00:02:36,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:02:36,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:02:36,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 00:02:36,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 00:02:36,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:02:36,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:02:36,914 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:02:36,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 00:02:36,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 00:02:36,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:02:36,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:02:36,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:02:36,957 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:02:36,958 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:02:36,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:02:36,962 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 00:02:36,985 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:02:36,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:02:36 BoogieIcfgContainer [2025-03-04 00:02:36,991 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:02:36,992 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:02:36,992 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:02:36,992 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:02:36,993 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:36" (3/4) ... [2025-03-04 00:02:36,995 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:02:36,996 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:02:36,996 INFO L158 Benchmark]: Toolchain (without parser) took 1294.03ms. Allocated memory is still 167.8MB. Free memory was 134.2MB in the beginning and 71.6MB in the end (delta: 62.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-04 00:02:36,997 INFO L158 Benchmark]: CDTParser took 1.00ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:02:36,997 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.13ms. Allocated memory is still 167.8MB. Free memory was 133.7MB in the beginning and 122.3MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:02:36,998 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.43ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 121.4MB in the end (delta: 901.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:02:36,998 INFO L158 Benchmark]: Boogie Preprocessor took 36.49ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 119.9MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:02:36,999 INFO L158 Benchmark]: IcfgBuilder took 223.71ms. Allocated memory is still 167.8MB. Free memory was 119.9MB in the beginning and 107.8MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:02:36,999 INFO L158 Benchmark]: TraceAbstraction took 784.64ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 71.6MB in the end (delta: 35.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 00:02:36,999 INFO L158 Benchmark]: Witness Printer took 3.98ms. Allocated memory is still 167.8MB. Free memory is still 71.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:02:37,001 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.00ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.13ms. Allocated memory is still 167.8MB. Free memory was 133.7MB in the beginning and 122.3MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.43ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 121.4MB in the end (delta: 901.1kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.49ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 119.9MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 223.71ms. Allocated memory is still 167.8MB. Free memory was 119.9MB in the beginning and 107.8MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 784.64ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 71.6MB in the end (delta: 35.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Witness Printer took 3.98ms. Allocated memory is still 167.8MB. Free memory is still 71.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 39, overapproximation of someBinaryFLOATComparisonOperation at line 43, overapproximation of someBinaryFLOATComparisonOperation at line 41, overapproximation of someBinaryFLOATComparisonOperation at line 54, overapproximation of someBinaryFLOATComparisonOperation at line 33, overapproximation of someBinaryArithmeticFLOAToperation at line 32. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 31.25; [L23] float var_1_2 = 31.2; [L24] float var_1_3 = 0.0; [L25] float var_1_4 = 64.125; [L26] signed short int var_1_5 = -128; [L27] signed short int var_1_6 = 10; [L28] signed short int var_1_7 = -4; VAL [isInitial=0, var_1_1=125/4, var_1_2=156/5, var_1_3=0, var_1_4=513/8, var_1_5=-128, var_1_6=10, var_1_7=-4] [L58] isInitial = 1 [L59] FCALL initially() [L60] COND TRUE 1 [L61] FCALL updateLastVariables() [L62] CALL updateVariables() [L38] var_1_2 = __VERIFIER_nondet_float() [L39] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854765600e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=125/4, var_1_3=0, var_1_4=513/8, var_1_5=-128, var_1_6=10, var_1_7=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=125/4, var_1_3=0, var_1_4=513/8, var_1_5=-128, var_1_6=10, var_1_7=-4] [L39] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854765600e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=125/4, var_1_3=0, var_1_4=513/8, var_1_5=-128, var_1_6=10, var_1_7=-4] [L40] var_1_3 = __VERIFIER_nondet_float() [L41] CALL assume_abort_if_not((var_1_3 >= 4611686.018427382800e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=125/4, var_1_4=513/8, var_1_5=-128, var_1_6=10, var_1_7=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=125/4, var_1_4=513/8, var_1_5=-128, var_1_6=10, var_1_7=-4] [L41] RET assume_abort_if_not((var_1_3 >= 4611686.018427382800e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=125/4, var_1_4=513/8, var_1_5=-128, var_1_6=10, var_1_7=-4] [L42] var_1_4 = __VERIFIER_nondet_float() [L43] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=125/4, var_1_5=-128, var_1_6=10, var_1_7=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=125/4, var_1_5=-128, var_1_6=10, var_1_7=-4] [L43] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=125/4, var_1_5=-128, var_1_6=10, var_1_7=-4] [L44] var_1_6 = __VERIFIER_nondet_short() [L45] CALL assume_abort_if_not(var_1_6 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_1=125/4, var_1_5=-128, var_1_6=-16383, var_1_7=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=125/4, var_1_5=-128, var_1_6=-16383, var_1_7=-4] [L45] RET assume_abort_if_not(var_1_6 >= -16383) VAL [isInitial=1, var_1_1=125/4, var_1_5=-128, var_1_6=-16383, var_1_7=-4] [L46] CALL assume_abort_if_not(var_1_6 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_1=125/4, var_1_5=-128, var_1_6=-16383, var_1_7=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=125/4, var_1_5=-128, var_1_6=-16383, var_1_7=-4] [L46] RET assume_abort_if_not(var_1_6 <= 16383) VAL [isInitial=1, var_1_1=125/4, var_1_5=-128, var_1_6=-16383, var_1_7=-4] [L47] var_1_7 = __VERIFIER_nondet_short() [L48] CALL assume_abort_if_not(var_1_7 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_1=125/4, var_1_5=-128, var_1_6=-16383, var_1_7=-16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=125/4, var_1_5=-128, var_1_6=-16383, var_1_7=-16383] [L48] RET assume_abort_if_not(var_1_7 >= -16383) VAL [isInitial=1, var_1_1=125/4, var_1_5=-128, var_1_6=-16383, var_1_7=-16383] [L49] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_1=125/4, var_1_5=-128, var_1_6=-16383, var_1_7=-16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=125/4, var_1_5=-128, var_1_6=-16383, var_1_7=-16383] [L49] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, var_1_1=125/4, var_1_5=-128, var_1_6=-16383, var_1_7=-16383] [L62] RET updateVariables() [L63] CALL step() [L32] var_1_1 = (((((256.75f) < (var_1_2)) ? (256.75f) : (var_1_2))) - (var_1_3 - var_1_4)) VAL [isInitial=1, var_1_5=-128, var_1_6=-16383, var_1_7=-16383] [L33] COND TRUE var_1_4 <= (var_1_2 + (var_1_3 + var_1_1)) [L34] var_1_5 = (var_1_6 + var_1_7) VAL [isInitial=1, var_1_5=-32766, var_1_6=-16383, var_1_7=-16383] [L63] RET step() [L64] CALL, EXPR property() [L54-L55] return (var_1_1 == ((float) (((((256.75f) < (var_1_2)) ? (256.75f) : (var_1_2))) - (var_1_3 - var_1_4)))) && ((var_1_4 <= (var_1_2 + (var_1_3 + var_1_1))) ? (var_1_5 == ((signed short int) (var_1_6 + var_1_7))) : 1) ; VAL [\result=0, isInitial=1, var_1_5=-32766, var_1_6=-16383, var_1_7=-16383] [L64] RET, EXPR property() [L64] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_5=-32766, var_1_6=-16383, var_1_7=-16383] [L19] reach_error() VAL [isInitial=1, var_1_5=-32766, var_1_6=-16383, var_1_7=-16383] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 7, 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, 35 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, 35 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred 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, 150 NumberOfCodeBlocks, 150 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 98 SizeOfPredicates, 0 NumberOfNonLiveVariables, 128 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 156/168 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:37,018 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-0.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 342a391425e9273144e7f8d0607b5266ee0425388e31ab43115bf3acb263154c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:02:38,976 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:02:39,062 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:39,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:02:39,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:02:39,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:02:39,091 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:02:39,091 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:02:39,091 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:02:39,092 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:02:39,092 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:02:39,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:02:39,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:02:39,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:02:39,093 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:02:39,095 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:02:39,095 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:02:39,095 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:02:39,095 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:02:39,095 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:02:39,095 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:02:39,095 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:02:39,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:02:39,095 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:02:39,095 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:02:39,095 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:02:39,095 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:02:39,095 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:02:39,095 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:02:39,095 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:02:39,095 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:02:39,096 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:02:39,096 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:02:39,096 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:02:39,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:02:39,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:02:39,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:02:39,096 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:02:39,096 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:02:39,096 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:02:39,096 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:02:39,096 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:02:39,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:02:39,096 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:02:39,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:02:39,096 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 -> 342a391425e9273144e7f8d0607b5266ee0425388e31ab43115bf3acb263154c [2025-03-04 00:02:39,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:02:39,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:02:39,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:02:39,362 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:02:39,363 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:02:39,364 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-0.i [2025-03-04 00:02:40,620 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62ceff9c6/6aace4b29f8a4daa9b837b1b8e5e0d68/FLAGa759b9fd1 [2025-03-04 00:02:40,799 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:02:40,800 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-0.i [2025-03-04 00:02:40,806 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62ceff9c6/6aace4b29f8a4daa9b837b1b8e5e0d68/FLAGa759b9fd1 [2025-03-04 00:02:40,817 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62ceff9c6/6aace4b29f8a4daa9b837b1b8e5e0d68 [2025-03-04 00:02:40,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:02:40,821 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:02:40,822 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:02:40,822 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:02:40,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:02:40,826 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:02:40" (1/1) ... [2025-03-04 00:02:40,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c56347d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:40, skipping insertion in model container [2025-03-04 00:02:40,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:02:40" (1/1) ... [2025-03-04 00:02:40,837 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:02:40,952 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-0.i[914,927] [2025-03-04 00:02:40,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:02:41,002 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:02:41,011 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-0.i[914,927] [2025-03-04 00:02:41,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:02:41,041 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:02:41,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:41 WrapperNode [2025-03-04 00:02:41,042 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:02:41,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:02:41,044 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:02:41,044 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:02:41,049 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:41" (1/1) ... [2025-03-04 00:02:41,058 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:41" (1/1) ... [2025-03-04 00:02:41,075 INFO L138 Inliner]: procedures = 27, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 63 [2025-03-04 00:02:41,076 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:02:41,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:02:41,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:02:41,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:02:41,083 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:41" (1/1) ... [2025-03-04 00:02:41,084 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:41" (1/1) ... [2025-03-04 00:02:41,091 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:41" (1/1) ... [2025-03-04 00:02:41,105 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:41,106 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:41" (1/1) ... [2025-03-04 00:02:41,106 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:41" (1/1) ... [2025-03-04 00:02:41,111 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:41" (1/1) ... [2025-03-04 00:02:41,115 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:41" (1/1) ... [2025-03-04 00:02:41,123 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:41" (1/1) ... [2025-03-04 00:02:41,124 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:41" (1/1) ... [2025-03-04 00:02:41,125 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:02:41,126 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:02:41,127 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:02:41,127 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:02:41,128 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:41" (1/1) ... [2025-03-04 00:02:41,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:02:41,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:02:41,159 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:41,161 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:41,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:02:41,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:02:41,178 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:02:41,178 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:02:41,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:02:41,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:02:41,229 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:02:41,230 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:02:43,821 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 00:02:43,822 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:02:43,829 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:02:43,831 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:02:43,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:02:43 BoogieIcfgContainer [2025-03-04 00:02:43,831 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:02:43,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:02:43,834 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:02:43,838 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:02:43,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:02:40" (1/3) ... [2025-03-04 00:02:43,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de61a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:02:43, skipping insertion in model container [2025-03-04 00:02:43,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:41" (2/3) ... [2025-03-04 00:02:43,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de61a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:02:43, skipping insertion in model container [2025-03-04 00:02:43,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:02:43" (3/3) ... [2025-03-04 00:02:43,842 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-0.i [2025-03-04 00:02:43,853 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:02:43,855 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-0.i that has 2 procedures, 31 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:02:43,905 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:02:43,917 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;@70640411, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:02:43,918 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:02:43,921 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 00:02:43,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 00:02:43,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:02:43,928 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 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:43,929 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:02:43,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:02:43,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1194608137, now seen corresponding path program 1 times [2025-03-04 00:02:43,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:02:43,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425068731] [2025-03-04 00:02:43,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:02:43,946 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:43,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:02:43,950 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:43,953 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:44,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 00:02:44,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 00:02:44,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:02:44,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:02:44,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:02:44,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:02:44,215 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 00:02:44,216 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:02:44,216 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:02:44,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425068731] [2025-03-04 00:02:44,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [425068731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:02:44,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:02:44,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:02:44,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370067012] [2025-03-04 00:02:44,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:02:44,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:02:44,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:02:44,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:02:44,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:02:44,238 INFO L87 Difference]: Start difference. First operand has 31 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 00:02:44,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:02:44,253 INFO L93 Difference]: Finished difference Result 56 states and 82 transitions. [2025-03-04 00:02:44,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:02:44,254 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2025-03-04 00:02:44,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:02:44,260 INFO L225 Difference]: With dead ends: 56 [2025-03-04 00:02:44,260 INFO L226 Difference]: Without dead ends: 28 [2025-03-04 00:02:44,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 49 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:44,264 INFO L435 NwaCegarLoop]: 35 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, 35 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:44,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 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:44,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-04 00:02:44,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-04 00:02:44,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 00:02:44,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2025-03-04 00:02:44,291 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 50 [2025-03-04 00:02:44,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:02:44,291 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-03-04 00:02:44,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 00:02:44,292 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2025-03-04 00:02:44,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 00:02:44,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:02:44,294 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 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:44,301 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:44,494 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:44,494 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:02:44,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:02:44,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1466818438, now seen corresponding path program 1 times [2025-03-04 00:02:44,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:02:44,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1123120546] [2025-03-04 00:02:44,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:02:44,496 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:44,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:02:44,498 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:44,499 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:44,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 00:02:44,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 00:02:44,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:02:44,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:02:44,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 00:02:44,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:02:58,888 WARN L286 SmtUtils]: Spent 6.15s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 00:03:04,315 WARN L286 SmtUtils]: Spent 5.43s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 00:03:10,613 WARN L286 SmtUtils]: Spent 6.30s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 00:03:24,871 WARN L286 SmtUtils]: Spent 6.60s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 00:04:05,948 WARN L286 SmtUtils]: Spent 32.76s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-04 00:04:20,804 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 00:04:20,804 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:04:20,805 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:04:20,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1123120546] [2025-03-04 00:04:20,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1123120546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:04:20,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:04:20,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:04:20,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142308887] [2025-03-04 00:04:20,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:04:20,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:04:20,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:04:20,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:04:20,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=26, Unknown=2, NotChecked=0, Total=42 [2025-03-04 00:04:20,808 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)