./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-18.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 09678c77438823f5421658f269ea899b63adcdec9e9a366091e7381adf928989 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:21:42,413 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:21:42,467 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:21:42,474 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:21:42,474 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:21:42,495 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:21:42,497 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:21:42,497 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:21:42,497 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:21:42,497 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:21:42,498 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:21:42,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:21:42,499 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:21:42,499 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:21:42,499 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:21:42,499 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:21:42,499 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:21:42,499 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:21:42,500 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:21:42,500 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:21:42,500 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:21:42,500 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:21:42,500 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:21:42,500 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:21:42,500 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:21:42,500 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:21:42,500 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:21:42,501 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:21:42,501 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:21:42,501 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:21:42,501 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:21:42,501 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:21:42,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:21:42,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:21:42,501 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:21:42,501 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:21:42,501 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:21:42,502 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:21:42,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:21:42,502 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:21:42,502 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:21:42,502 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:21:42,502 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:21:42,502 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 -> 09678c77438823f5421658f269ea899b63adcdec9e9a366091e7381adf928989 [2025-03-17 04:21:42,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:21:42,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:21:42,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:21:42,748 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:21:42,748 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:21:42,749 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-18.i [2025-03-17 04:21:43,904 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05016969a/817650e444b947339b32f3d6c30ee7bd/FLAGa79ee78c5 [2025-03-17 04:21:44,156 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:21:44,156 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-18.i [2025-03-17 04:21:44,163 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05016969a/817650e444b947339b32f3d6c30ee7bd/FLAGa79ee78c5 [2025-03-17 04:21:44,179 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05016969a/817650e444b947339b32f3d6c30ee7bd [2025-03-17 04:21:44,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:21:44,183 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:21:44,185 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:21:44,185 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:21:44,189 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:21:44,190 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:21:44" (1/1) ... [2025-03-17 04:21:44,191 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72e2014c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:44, skipping insertion in model container [2025-03-17 04:21:44,192 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:21:44" (1/1) ... [2025-03-17 04:21:44,205 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:21:44,312 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-18.i[915,928] [2025-03-17 04:21:44,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:21:44,351 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:21:44,361 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-18.i[915,928] [2025-03-17 04:21:44,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:21:44,383 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:21:44,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:44 WrapperNode [2025-03-17 04:21:44,384 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:21:44,385 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:21:44,385 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:21:44,385 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:21:44,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:44" (1/1) ... [2025-03-17 04:21:44,396 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:44" (1/1) ... [2025-03-17 04:21:44,410 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 73 [2025-03-17 04:21:44,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:21:44,411 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:21:44,411 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:21:44,411 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:21:44,418 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:44" (1/1) ... [2025-03-17 04:21:44,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:44" (1/1) ... [2025-03-17 04:21:44,419 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:44" (1/1) ... [2025-03-17 04:21:44,428 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 04:21:44,428 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:44" (1/1) ... [2025-03-17 04:21:44,428 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:44" (1/1) ... [2025-03-17 04:21:44,431 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:44" (1/1) ... [2025-03-17 04:21:44,432 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:44" (1/1) ... [2025-03-17 04:21:44,432 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:44" (1/1) ... [2025-03-17 04:21:44,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:44" (1/1) ... [2025-03-17 04:21:44,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:21:44,435 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:21:44,435 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:21:44,435 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:21:44,436 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:44" (1/1) ... [2025-03-17 04:21:44,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:21:44,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:21:44,463 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 04:21:44,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 04:21:44,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:21:44,485 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:21:44,485 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:21:44,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:21:44,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:21:44,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:21:44,534 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:21:44,535 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:21:44,689 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 04:21:44,691 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:21:44,699 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:21:44,700 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:21:44,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:21:44 BoogieIcfgContainer [2025-03-17 04:21:44,701 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:21:44,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:21:44,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:21:44,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:21:44,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:21:44" (1/3) ... [2025-03-17 04:21:44,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ae3f40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:21:44, skipping insertion in model container [2025-03-17 04:21:44,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:44" (2/3) ... [2025-03-17 04:21:44,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ae3f40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:21:44, skipping insertion in model container [2025-03-17 04:21:44,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:21:44" (3/3) ... [2025-03-17 04:21:44,709 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-18.i [2025-03-17 04:21:44,719 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:21:44,721 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-18.i that has 2 procedures, 30 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:21:44,764 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:21:44,774 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;@2e395503, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:21:44,775 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:21:44,777 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 04:21:44,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 04:21:44,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:21:44,784 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:21:44,785 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:21:44,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:21:44,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1946117199, now seen corresponding path program 1 times [2025-03-17 04:21:44,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:21:44,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730470894] [2025-03-17 04:21:44,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:21:44,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:21:44,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 04:21:44,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 04:21:44,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:21:44,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:21:44,938 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-17 04:21:44,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:21:44,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730470894] [2025-03-17 04:21:44,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730470894] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:21:44,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168697423] [2025-03-17 04:21:44,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:21:44,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:21:44,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:21:44,942 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:21:44,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 04:21:45,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 04:21:45,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 04:21:45,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:21:45,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:21:45,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:21:45,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:21:45,062 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-17 04:21:45,063 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:21:45,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168697423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:21:45,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:21:45,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:21:45,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229211115] [2025-03-17 04:21:45,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:21:45,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:21:45,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:21:45,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:21:45,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:21:45,081 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 04:21:45,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:21:45,095 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2025-03-17 04:21:45,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:21:45,097 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 62 [2025-03-17 04:21:45,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:21:45,101 INFO L225 Difference]: With dead ends: 57 [2025-03-17 04:21:45,101 INFO L226 Difference]: Without dead ends: 28 [2025-03-17 04:21:45,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:21:45,104 INFO L435 NwaCegarLoop]: 38 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, 38 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-17 04:21:45,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:21:45,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-17 04:21:45,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-17 04:21:45,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 04:21:45,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2025-03-17 04:21:45,126 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 62 [2025-03-17 04:21:45,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:21:45,126 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2025-03-17 04:21:45,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 04:21:45,127 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2025-03-17 04:21:45,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 04:21:45,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:21:45,128 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:21:45,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 04:21:45,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 04:21:45,329 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:21:45,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:21:45,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1200294289, now seen corresponding path program 1 times [2025-03-17 04:21:45,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:21:45,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943448575] [2025-03-17 04:21:45,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:21:45,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:21:45,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 04:21:45,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 04:21:45,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:21:45,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:21:45,397 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 04:21:45,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 04:21:45,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 04:21:45,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:21:45,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:21:45,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 04:21:45,467 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 04:21:45,468 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 04:21:45,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:21:45,473 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 04:21:45,509 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 04:21:45,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:21:45 BoogieIcfgContainer [2025-03-17 04:21:45,514 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 04:21:45,515 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 04:21:45,515 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 04:21:45,515 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 04:21:45,515 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:21:44" (3/4) ... [2025-03-17 04:21:45,517 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 04:21:45,518 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 04:21:45,518 INFO L158 Benchmark]: Toolchain (without parser) took 1335.21ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 42.7MB in the end (delta: 69.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-17 04:21:45,518 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:21:45,519 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.01ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 100.5MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:21:45,519 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.38ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 99.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:21:45,519 INFO L158 Benchmark]: Boogie Preprocessor took 23.04ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 97.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:21:45,519 INFO L158 Benchmark]: IcfgBuilder took 265.97ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 85.1MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:21:45,519 INFO L158 Benchmark]: TraceAbstraction took 811.76ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 43.2MB in the end (delta: 40.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-17 04:21:45,519 INFO L158 Benchmark]: Witness Printer took 3.09ms. Allocated memory is still 142.6MB. Free memory was 43.2MB in the beginning and 42.7MB in the end (delta: 474.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:21:45,521 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.18ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.01ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 100.5MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.38ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 99.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.04ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 97.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 265.97ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 85.1MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 811.76ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 43.2MB in the end (delta: 40.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 3.09ms. Allocated memory is still 142.6MB. Free memory was 43.2MB in the beginning and 42.7MB in the end (delta: 474.1kB). 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 42, overapproximation of someBinaryDOUBLEComparisonOperation at line 45, overapproximation of someBinaryDOUBLEComparisonOperation at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 44, overapproximation of someBinaryDOUBLEComparisonOperation at line 47. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -1; [L23] double var_1_2 = 24.75; [L24] double var_1_3 = 16.7; [L25] double var_1_4 = 0.8; [L26] signed short int var_1_5 = -1; [L27] signed short int var_1_6 = 4; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 1; [L65] isInitial = 1 [L66] FCALL initially() [L67] COND TRUE 1 [L68] FCALL updateLastVariables() [L69] CALL updateVariables() [L41] var_1_2 = __VERIFIER_nondet_double() [L42] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_3=167/10, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_3=167/10, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L42] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=-1, var_1_3=167/10, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L43] var_1_3 = __VERIFIER_nondet_double() [L44] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L44] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=-1, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L45] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L45] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, var_1_1=-1, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L46] var_1_4 = __VERIFIER_nondet_double() [L47] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L47] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=-1, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L48] var_1_5 = __VERIFIER_nondet_short() [L49] CALL assume_abort_if_not(var_1_5 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=1] [L49] RET assume_abort_if_not(var_1_5 >= -16383) VAL [isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=1] [L50] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=1] [L50] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=1] [L51] var_1_6 = __VERIFIER_nondet_short() [L52] CALL assume_abort_if_not(var_1_6 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=1] [L52] RET assume_abort_if_not(var_1_6 >= -16383) VAL [isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=1] [L53] CALL assume_abort_if_not(var_1_6 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=1] [L53] RET assume_abort_if_not(var_1_6 <= 16383) VAL [isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=1] [L54] var_1_8 = __VERIFIER_nondet_uchar() [L55] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=-255] [L55] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=-255] [L56] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=-255] [L56] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=-255] [L69] RET updateVariables() [L70] CALL step() [L33] COND TRUE (var_1_2 + (15.3 / var_1_3)) > (- var_1_4) [L34] var_1_1 = (var_1_5 + var_1_6) VAL [isInitial=1, var_1_1=9, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=-255] [L38] var_1_7 = var_1_8 [L70] RET step() [L71] CALL, EXPR property() [L61-L62] return (((var_1_2 + (15.3 / var_1_3)) > (- var_1_4)) ? (var_1_1 == ((signed short int) (var_1_5 + var_1_6))) : (var_1_1 == ((signed short int) ((((var_1_6) < (var_1_5)) ? (var_1_6) : (var_1_5)))))) && (var_1_7 == ((unsigned char) var_1_8)) ; [L71] RET, EXPR property() [L71] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=9, var_1_5=5, var_1_6=4, var_1_7=-255, var_1_8=-255] [L19] reach_error() VAL [isInitial=1, var_1_1=9, var_1_5=5, var_1_6=4, var_1_7=-255, var_1_8=-255] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 52 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 10, 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, 38 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, 38 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred 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, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 122 ConstructedInterpolants, 0 QuantifiedInterpolants, 122 SizeOfPredicates, 0 NumberOfNonLiveVariables, 156 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 342/360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 04:21:45,535 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-18.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 09678c77438823f5421658f269ea899b63adcdec9e9a366091e7381adf928989 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:21:47,362 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:21:47,446 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 04:21:47,453 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:21:47,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:21:47,477 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:21:47,477 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:21:47,478 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:21:47,478 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:21:47,478 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:21:47,479 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:21:47,479 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:21:47,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:21:47,480 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:21:47,480 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:21:47,480 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:21:47,480 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:21:47,481 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:21:47,481 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:21:47,481 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:21:47,481 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:21:47,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:21:47,481 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:21:47,481 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 04:21:47,481 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 04:21:47,481 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 04:21:47,482 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:21:47,482 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:21:47,482 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:21:47,482 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:21:47,482 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:21:47,482 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:21:47,483 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:21:47,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:21:47,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:21:47,483 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:21:47,483 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:21:47,483 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:21:47,483 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:21:47,483 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 04:21:47,483 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 04:21:47,483 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:21:47,483 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:21:47,483 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:21:47,483 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:21:47,483 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 -> 09678c77438823f5421658f269ea899b63adcdec9e9a366091e7381adf928989 [2025-03-17 04:21:47,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:21:47,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:21:47,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:21:47,734 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:21:47,734 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:21:47,735 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-18.i [2025-03-17 04:21:48,889 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61ec62e68/5db442809c1e446491ea47af7df0b09e/FLAG44593fab1 [2025-03-17 04:21:49,118 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:21:49,119 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-18.i [2025-03-17 04:21:49,126 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61ec62e68/5db442809c1e446491ea47af7df0b09e/FLAG44593fab1 [2025-03-17 04:21:49,467 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61ec62e68/5db442809c1e446491ea47af7df0b09e [2025-03-17 04:21:49,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:21:49,470 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:21:49,471 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:21:49,471 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:21:49,473 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:21:49,474 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:21:49" (1/1) ... [2025-03-17 04:21:49,474 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d75a94b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:49, skipping insertion in model container [2025-03-17 04:21:49,474 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:21:49" (1/1) ... [2025-03-17 04:21:49,486 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:21:49,567 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-18.i[915,928] [2025-03-17 04:21:49,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:21:49,592 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:21:49,599 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-18.i[915,928] [2025-03-17 04:21:49,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:21:49,621 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:21:49,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:49 WrapperNode [2025-03-17 04:21:49,621 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:21:49,622 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:21:49,622 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:21:49,622 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:21:49,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:49" (1/1) ... [2025-03-17 04:21:49,631 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:49" (1/1) ... [2025-03-17 04:21:49,644 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 71 [2025-03-17 04:21:49,645 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:21:49,646 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:21:49,646 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:21:49,646 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:21:49,651 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:49" (1/1) ... [2025-03-17 04:21:49,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:49" (1/1) ... [2025-03-17 04:21:49,652 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:49" (1/1) ... [2025-03-17 04:21:49,660 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 04:21:49,660 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:49" (1/1) ... [2025-03-17 04:21:49,660 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:49" (1/1) ... [2025-03-17 04:21:49,664 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:49" (1/1) ... [2025-03-17 04:21:49,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:49" (1/1) ... [2025-03-17 04:21:49,669 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:49" (1/1) ... [2025-03-17 04:21:49,669 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:49" (1/1) ... [2025-03-17 04:21:49,670 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:21:49,671 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:21:49,671 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:21:49,671 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:21:49,675 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:49" (1/1) ... [2025-03-17 04:21:49,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:21:49,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:21:49,699 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 04:21:49,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 04:21:49,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:21:49,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 04:21:49,717 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:21:49,718 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:21:49,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:21:49,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:21:49,772 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:21:49,773 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:22:02,347 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 04:22:02,347 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:22:02,353 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:22:02,354 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:22:02,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:22:02 BoogieIcfgContainer [2025-03-17 04:22:02,354 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:22:02,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:22:02,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:22:02,359 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:22:02,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:21:49" (1/3) ... [2025-03-17 04:22:02,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b1b97e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:22:02, skipping insertion in model container [2025-03-17 04:22:02,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:49" (2/3) ... [2025-03-17 04:22:02,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b1b97e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:22:02, skipping insertion in model container [2025-03-17 04:22:02,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:22:02" (3/3) ... [2025-03-17 04:22:02,361 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-18.i [2025-03-17 04:22:02,371 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:22:02,373 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-18.i that has 2 procedures, 30 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:22:02,404 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:22:02,412 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;@2dc9a899, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:22:02,412 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:22:02,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 04:22:02,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 04:22:02,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:02,420 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:22:02,420 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:02,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:02,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1946117199, now seen corresponding path program 1 times [2025-03-17 04:22:02,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:22:02,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28486272] [2025-03-17 04:22:02,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:02,431 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 04:22:02,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:22:02,433 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 04:22:02,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 04:22:02,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 04:22:03,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 04:22:03,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:03,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:03,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:22:03,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:22:03,169 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-17 04:22:03,169 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:22:03,170 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:22:03,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [28486272] [2025-03-17 04:22:03,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [28486272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:22:03,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:22:03,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 04:22:03,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198694005] [2025-03-17 04:22:03,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:22:03,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:22:03,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:22:03,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:22:03,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:22:03,188 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 04:22:03,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:22:03,200 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2025-03-17 04:22:03,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:22:03,201 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 62 [2025-03-17 04:22:03,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:22:03,205 INFO L225 Difference]: With dead ends: 57 [2025-03-17 04:22:03,205 INFO L226 Difference]: Without dead ends: 28 [2025-03-17 04:22:03,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:22:03,209 INFO L435 NwaCegarLoop]: 38 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, 38 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-17 04:22:03,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:22:03,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-17 04:22:03,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-17 04:22:03,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 04:22:03,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2025-03-17 04:22:03,232 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 62 [2025-03-17 04:22:03,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:22:03,233 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2025-03-17 04:22:03,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 04:22:03,233 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2025-03-17 04:22:03,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 04:22:03,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:03,235 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:22:03,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-17 04:22:03,439 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-17 04:22:03,440 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:03,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:03,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1200294289, now seen corresponding path program 1 times [2025-03-17 04:22:03,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:22:03,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [803860745] [2025-03-17 04:22:03,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:03,441 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 04:22:03,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:22:03,443 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-17 04:22:03,445 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-17 04:22:03,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 04:22:04,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 04:22:04,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:04,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:04,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 04:22:04,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:22:12,354 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 04:22:20,644 WARN L286 SmtUtils]: Spent 8.29s 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-17 04:22:24,732 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~var_1_1~0 ((_ extract 15 0) (bvadd ((_ sign_extend 16) c_~var_1_6~0) ((_ sign_extend 16) c_~var_1_5~0)))) (fp.gt (fp.add c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 153.0 10.0)) c_~var_1_3~0)) (fp.neg c_~var_1_4~0))) is different from false [2025-03-17 04:22:28,805 WARN L873 $PredicateComparison]: unable to prove that (and (= c_~var_1_1~0 ((_ extract 15 0) (bvadd ((_ sign_extend 16) c_~var_1_6~0) ((_ sign_extend 16) c_~var_1_5~0)))) (fp.gt (fp.add c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 153.0 10.0)) c_~var_1_3~0)) (fp.neg c_~var_1_4~0))) is different from true [2025-03-17 04:22:41,578 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 04:22:45,666 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((~var_1_3~0 (_ FloatingPoint 11 53)) (~var_1_2~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (fp.gt (fp.add currentRoundingMode ~var_1_2~0 (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 153.0 10.0)) ~var_1_3~0)) (fp.neg ~var_1_4~0))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) is different from false [2025-03-17 04:22:45,678 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 04:22:45,679 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:22:45,679 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:22:45,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [803860745] [2025-03-17 04:22:45,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [803860745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:22:45,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:22:45,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:22:45,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246810974] [2025-03-17 04:22:45,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:22:45,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:22:45,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:22:45,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:22:45,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=2, Unknown=3, NotChecked=2, Total=12 [2025-03-17 04:22:45,681 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 04:22:45,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:22:45,688 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2025-03-17 04:22:45,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:22:45,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 62 [2025-03-17 04:22:45,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:22:45,689 INFO L225 Difference]: With dead ends: 32 [2025-03-17 04:22:45,689 INFO L226 Difference]: Without dead ends: 30 [2025-03-17 04:22:45,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=5, Invalid=2, Unknown=3, NotChecked=2, Total=12 [2025-03-17 04:22:45,689 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:22:45,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 46 Unchecked, 0.0s Time] [2025-03-17 04:22:45,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-17 04:22:45,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-17 04:22:45,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 04:22:45,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2025-03-17 04:22:45,695 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 62 [2025-03-17 04:22:45,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:22:45,697 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2025-03-17 04:22:45,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 04:22:45,697 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2025-03-17 04:22:45,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 04:22:45,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:45,698 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:22:45,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-17 04:22:45,898 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-17 04:22:45,899 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:45,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:45,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1200264498, now seen corresponding path program 1 times [2025-03-17 04:22:45,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:22:45,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1763897875] [2025-03-17 04:22:45,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:45,900 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 04:22:45,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:22:45,902 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-17 04:22:45,903 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-17 04:22:45,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 04:22:46,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 04:22:46,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:46,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:46,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 04:22:46,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:22:54,873 WARN L286 SmtUtils]: Spent 8.28s 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-17 04:23:03,155 WARN L286 SmtUtils]: Spent 8.28s 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-17 04:23:11,450 WARN L286 SmtUtils]: Spent 8.29s 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-17 04:23:19,741 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 04:23:27,897 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)