./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-54.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-54.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 a107373962cca35af7d179f02239e8e00f5e366c836fd26959756f328d1ec34a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:04:56,704 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:04:56,763 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:04:56,766 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:04:56,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:04:56,786 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:04:56,787 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:04:56,787 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:04:56,788 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:04:56,788 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:04:56,789 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:04:56,789 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:04:56,789 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:04:56,789 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:04:56,789 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:04:56,789 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:04:56,790 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:04:56,790 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:04:56,790 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:04:56,790 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:04:56,790 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:04:56,790 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:04:56,790 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:04:56,790 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:04:56,790 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:04:56,790 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:04:56,790 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:04:56,791 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:04:56,791 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:04:56,791 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:04:56,791 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:04:56,791 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:04:56,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:04:56,791 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:04:56,792 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:04:56,792 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:04:56,792 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:04:56,792 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:04:56,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:04:56,792 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:04:56,792 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:04:56,792 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:04:56,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:04:56,792 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 -> a107373962cca35af7d179f02239e8e00f5e366c836fd26959756f328d1ec34a [2025-03-04 00:04:57,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:04:57,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:04:57,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:04:57,072 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:04:57,072 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:04:57,073 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-54.i [2025-03-04 00:04:58,330 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cdd0cdc9/4fd307a372294c95aeffcc9dbeac3360/FLAG74fcc85eb [2025-03-04 00:04:58,602 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:04:58,603 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-54.i [2025-03-04 00:04:58,616 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cdd0cdc9/4fd307a372294c95aeffcc9dbeac3360/FLAG74fcc85eb [2025-03-04 00:04:58,910 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cdd0cdc9/4fd307a372294c95aeffcc9dbeac3360 [2025-03-04 00:04:58,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:04:58,919 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:04:58,925 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:04:58,926 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:04:58,933 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:04:58,934 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:04:58" (1/1) ... [2025-03-04 00:04:58,938 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3636e4c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:58, skipping insertion in model container [2025-03-04 00:04:58,939 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:04:58" (1/1) ... [2025-03-04 00:04:58,971 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:04:59,239 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-54.i[915,928] [2025-03-04 00:04:59,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:04:59,308 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:04:59,327 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-54.i[915,928] [2025-03-04 00:04:59,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:04:59,372 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:04:59,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:59 WrapperNode [2025-03-04 00:04:59,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:04:59,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:04:59,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:04:59,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:04:59,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:59" (1/1) ... [2025-03-04 00:04:59,389 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:59" (1/1) ... [2025-03-04 00:04:59,414 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 71 [2025-03-04 00:04:59,414 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:04:59,414 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:04:59,415 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:04:59,415 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:04:59,422 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:59" (1/1) ... [2025-03-04 00:04:59,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:59" (1/1) ... [2025-03-04 00:04:59,423 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:59" (1/1) ... [2025-03-04 00:04:59,442 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:04:59,442 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:59" (1/1) ... [2025-03-04 00:04:59,442 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:59" (1/1) ... [2025-03-04 00:04:59,449 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:59" (1/1) ... [2025-03-04 00:04:59,452 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:59" (1/1) ... [2025-03-04 00:04:59,456 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:59" (1/1) ... [2025-03-04 00:04:59,459 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:59" (1/1) ... [2025-03-04 00:04:59,460 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:04:59,472 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:04:59,472 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:04:59,472 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:04:59,474 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:59" (1/1) ... [2025-03-04 00:04:59,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:04:59,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:04:59,531 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:04:59,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:04:59,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:04:59,567 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:04:59,567 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:04:59,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:04:59,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:04:59,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:04:59,654 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:04:59,657 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:04:59,899 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-04 00:04:59,901 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:04:59,916 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:04:59,917 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:04:59,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:59 BoogieIcfgContainer [2025-03-04 00:04:59,918 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:04:59,924 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:04:59,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:04:59,934 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:04:59,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:04:58" (1/3) ... [2025-03-04 00:04:59,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a37f542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:04:59, skipping insertion in model container [2025-03-04 00:04:59,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:59" (2/3) ... [2025-03-04 00:04:59,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a37f542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:04:59, skipping insertion in model container [2025-03-04 00:04:59,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:59" (3/3) ... [2025-03-04 00:04:59,941 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-54.i [2025-03-04 00:04:59,957 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:04:59,960 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-54.i that has 2 procedures, 33 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:05:00,027 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:05:00,049 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;@47704bd1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:05:00,049 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:05:00,057 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 00:05:00,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 00:05:00,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:05:00,071 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:05:00,071 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:05:00,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:05:00,079 INFO L85 PathProgramCache]: Analyzing trace with hash -306023518, now seen corresponding path program 1 times [2025-03-04 00:05:00,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:05:00,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111439958] [2025-03-04 00:05:00,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:05:00,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:05:00,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 00:05:00,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 00:05:00,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:05:00,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:05:00,307 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-04 00:05:00,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:05:00,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111439958] [2025-03-04 00:05:00,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111439958] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:05:00,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136424938] [2025-03-04 00:05:00,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:05:00,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:05:00,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:05:00,322 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:05:00,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:05:00,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 00:05:00,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 00:05:00,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:05:00,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:05:00,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:05:00,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:05:00,559 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-04 00:05:00,561 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:05:00,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136424938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:05:00,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:05:00,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:05:00,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317515070] [2025-03-04 00:05:00,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:05:00,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:05:00,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:05:00,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:05:00,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:05:00,609 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 00:05:00,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:05:00,666 INFO L93 Difference]: Finished difference Result 60 states and 91 transitions. [2025-03-04 00:05:00,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:05:00,671 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 56 [2025-03-04 00:05:00,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:05:00,682 INFO L225 Difference]: With dead ends: 60 [2025-03-04 00:05:00,683 INFO L226 Difference]: Without dead ends: 30 [2025-03-04 00:05:00,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:05:00,699 INFO L435 NwaCegarLoop]: 39 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, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:05:00,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:05:00,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-04 00:05:00,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-04 00:05:00,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 00:05:00,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2025-03-04 00:05:00,767 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 56 [2025-03-04 00:05:00,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:05:00,772 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2025-03-04 00:05:00,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 00:05:00,773 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2025-03-04 00:05:00,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 00:05:00,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:05:00,774 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:05:00,787 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-04 00:05:00,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:05:00,976 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:05:00,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:05:00,978 INFO L85 PathProgramCache]: Analyzing trace with hash -889408572, now seen corresponding path program 1 times [2025-03-04 00:05:00,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:05:00,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260029257] [2025-03-04 00:05:00,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:05:00,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:05:01,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 00:05:01,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 00:05:01,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:05:01,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:05:01,260 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 00:05:01,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:05:01,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260029257] [2025-03-04 00:05:01,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260029257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:05:01,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:05:01,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:05:01,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782880288] [2025-03-04 00:05:01,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:05:01,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:05:01,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:05:01,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:05:01,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:05:01,265 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 00:05:01,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:05:01,282 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2025-03-04 00:05:01,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:05:01,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 56 [2025-03-04 00:05:01,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:05:01,287 INFO L225 Difference]: With dead ends: 57 [2025-03-04 00:05:01,287 INFO L226 Difference]: Without dead ends: 30 [2025-03-04 00:05:01,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:05:01,288 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:05:01,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:05:01,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-04 00:05:01,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-04 00:05:01,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 00:05:01,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2025-03-04 00:05:01,292 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 56 [2025-03-04 00:05:01,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:05:01,293 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2025-03-04 00:05:01,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 00:05:01,293 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2025-03-04 00:05:01,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 00:05:01,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:05:01,294 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:05:01,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:05:01,294 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:05:01,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:05:01,295 INFO L85 PathProgramCache]: Analyzing trace with hash -860779421, now seen corresponding path program 1 times [2025-03-04 00:05:01,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:05:01,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924732702] [2025-03-04 00:05:01,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:05:01,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:05:01,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 00:05:01,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 00:05:01,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:05:01,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:05:01,366 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:05:01,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 00:05:01,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 00:05:01,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:05:01,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:05:01,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:05:01,454 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:05:01,455 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:05:01,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:05:01,462 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-04 00:05:01,534 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:05:01,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:05:01 BoogieIcfgContainer [2025-03-04 00:05:01,540 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:05:01,541 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:05:01,541 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:05:01,541 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:05:01,542 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:59" (3/4) ... [2025-03-04 00:05:01,544 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:05:01,548 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:05:01,549 INFO L158 Benchmark]: Toolchain (without parser) took 2630.40ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 46.2MB in the end (delta: 77.6MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-03-04 00:05:01,549 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:05:01,550 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.31ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 112.2MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:05:01,550 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.38ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 110.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:05:01,550 INFO L158 Benchmark]: Boogie Preprocessor took 45.93ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 109.5MB in the end (delta: 934.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:05:01,550 INFO L158 Benchmark]: IcfgBuilder took 445.89ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 96.4MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:05:01,550 INFO L158 Benchmark]: TraceAbstraction took 1615.72ms. Allocated memory is still 167.8MB. Free memory was 96.4MB in the beginning and 46.2MB in the end (delta: 50.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-04 00:05:01,553 INFO L158 Benchmark]: Witness Printer took 7.84ms. Allocated memory is still 167.8MB. Free memory is still 46.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:05:01,558 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 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 451.31ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 112.2MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.38ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 110.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.93ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 109.5MB in the end (delta: 934.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 445.89ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 96.4MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1615.72ms. Allocated memory is still 167.8MB. Free memory was 96.4MB in the beginning and 46.2MB in the end (delta: 50.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 7.84ms. Allocated memory is still 167.8MB. Free memory is still 46.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 49, overapproximation of someBinaryFLOATComparisonOperation at line 45, overapproximation of someBinaryFLOATComparisonOperation at line 37, overapproximation of someBinaryFLOATComparisonOperation at line 62, overapproximation of someBinaryFLOATComparisonOperation at line 47, overapproximation of someBinaryFLOATComparisonOperation at line 50. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 999.25; [L23] float var_1_5 = 63.875; [L24] float var_1_6 = 25.05; [L25] signed long int var_1_7 = -4; [L26] float var_1_8 = 25.2; [L27] signed long int var_1_9 = 2; [L28] signed long int var_1_10 = 256; [L29] signed long int last_1_var_1_7 = -4; VAL [isInitial=0, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_5=511/8, var_1_6=501/20, var_1_7=-4, var_1_8=126/5, var_1_9=2] [L66] isInitial = 1 [L67] FCALL initially() [L68] COND TRUE 1 [L69] CALL updateLastVariables() [L59] last_1_var_1_7 = var_1_7 VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_5=511/8, var_1_6=501/20, var_1_7=-4, var_1_8=126/5, var_1_9=2] [L69] RET updateLastVariables() [L70] CALL updateVariables() [L44] var_1_5 = __VERIFIER_nondet_float() [L45] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_6=501/20, var_1_7=-4, var_1_8=126/5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_6=501/20, var_1_7=-4, var_1_8=126/5, var_1_9=2] [L45] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_6=501/20, var_1_7=-4, var_1_8=126/5, var_1_9=2] [L46] var_1_6 = __VERIFIER_nondet_float() [L47] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_8=126/5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_8=126/5, var_1_9=2] [L47] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_8=126/5, var_1_9=2] [L48] var_1_8 = __VERIFIER_nondet_float() [L49] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=2] [L49] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=2] [L50] CALL assume_abort_if_not(var_1_8 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=2] [L50] RET assume_abort_if_not(var_1_8 != 0.0F) VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=2] [L51] var_1_9 = __VERIFIER_nondet_long() [L52] CALL assume_abort_if_not(var_1_9 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=1073741823] [L52] RET assume_abort_if_not(var_1_9 >= -1073741823) VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=1073741823] [L53] CALL assume_abort_if_not(var_1_9 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=1073741823] [L53] RET assume_abort_if_not(var_1_9 <= 1073741823) VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=1073741823] [L54] var_1_10 = __VERIFIER_nondet_long() [L55] CALL assume_abort_if_not(var_1_10 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=1073741823, var_1_1=3997/4, var_1_7=-4, var_1_9=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=1073741823, var_1_1=3997/4, var_1_7=-4, var_1_9=1073741823] [L55] RET assume_abort_if_not(var_1_10 >= -1073741823) VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=1073741823, var_1_1=3997/4, var_1_7=-4, var_1_9=1073741823] [L56] CALL assume_abort_if_not(var_1_10 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=1073741823, var_1_1=3997/4, var_1_7=-4, var_1_9=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=1073741823, var_1_1=3997/4, var_1_7=-4, var_1_9=1073741823] [L56] RET assume_abort_if_not(var_1_10 <= 1073741823) VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=1073741823, var_1_1=3997/4, var_1_7=-4, var_1_9=1073741823] [L70] RET updateVariables() [L71] CALL step() [L33] signed long int stepLocal_0 = last_1_var_1_7; VAL [isInitial=1, last_1_var_1_7=-4, stepLocal_0=-4, var_1_10=1073741823, var_1_1=3997/4, var_1_7=-4, var_1_9=1073741823] [L34] COND FALSE !(last_1_var_1_7 < stepLocal_0) VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=1073741823, var_1_1=3997/4, var_1_7=-4, var_1_9=1073741823] [L37] COND TRUE (((((var_1_5 / var_1_8)) > (var_1_6)) ? ((var_1_5 / var_1_8)) : (var_1_6))) == var_1_1 [L38] var_1_7 = (var_1_9 + var_1_10) VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=1073741823, var_1_1=3997/4, var_1_7=2147483646, var_1_9=1073741823] [L71] RET step() [L72] CALL, EXPR property() [L62-L63] return ((last_1_var_1_7 < last_1_var_1_7) ? (var_1_1 == ((float) (var_1_5 - var_1_6))) : 1) && (((((((var_1_5 / var_1_8)) > (var_1_6)) ? ((var_1_5 / var_1_8)) : (var_1_6))) == var_1_1) ? (var_1_7 == ((signed long int) (var_1_9 + var_1_10))) : (var_1_7 == ((signed long int) 50))) ; VAL [\result=0, isInitial=1, last_1_var_1_7=-4, var_1_10=1073741823, var_1_1=3997/4, var_1_7=2147483646, var_1_9=1073741823] [L72] RET, EXPR property() [L72] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=1073741823, var_1_1=3997/4, var_1_7=2147483646, var_1_9=1073741823] [L19] reach_error() VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=1073741823, var_1_1=3997/4, var_1_7=2147483646, var_1_9=1073741823] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 109 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 76 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 224 NumberOfCodeBlocks, 224 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 165 ConstructedInterpolants, 0 QuantifiedInterpolants, 167 SizeOfPredicates, 0 NumberOfNonLiveVariables, 142 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 322/336 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 00:05:01,591 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-54.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 a107373962cca35af7d179f02239e8e00f5e366c836fd26959756f328d1ec34a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:05:05,737 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:05:05,924 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:05:05,941 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:05:05,941 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:05:05,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:05:05,975 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:05:05,975 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:05:05,975 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:05:05,975 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:05:05,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:05:05,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:05:05,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:05:05,978 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:05:05,978 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:05:05,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:05:05,979 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:05:05,979 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:05:05,979 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:05:05,980 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:05:05,980 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:05:05,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:05:05,980 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:05:05,980 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:05:05,980 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:05:05,981 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:05:05,981 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:05:05,981 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:05:05,981 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:05:05,981 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:05:05,981 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:05:05,981 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:05:05,981 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:05:05,982 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:05:05,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:05:05,982 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:05:05,982 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:05:05,982 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:05:05,982 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:05:05,983 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:05:05,983 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:05:05,983 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:05:05,983 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:05:05,983 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:05:05,983 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:05:05,984 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 -> a107373962cca35af7d179f02239e8e00f5e366c836fd26959756f328d1ec34a [2025-03-04 00:05:06,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:05:06,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:05:06,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:05:06,420 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:05:06,420 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:05:06,421 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-54.i [2025-03-04 00:05:08,313 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3247f5a0a/42162a3ca8b741fc8354e403a427e857/FLAGb15cddc7f [2025-03-04 00:05:08,349 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException: Cannot invoke "String.equalsIgnoreCase(String)" because "kindStr" is null at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2025-03-04 00:05:08,760 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:05:08,761 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-54.i [2025-03-04 00:05:08,782 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3247f5a0a/42162a3ca8b741fc8354e403a427e857/FLAGb15cddc7f [2025-03-04 00:05:08,825 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3247f5a0a/42162a3ca8b741fc8354e403a427e857 [2025-03-04 00:05:08,831 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:05:08,833 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:05:08,841 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:05:08,841 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:05:08,850 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:05:08,851 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:05:08" (1/1) ... [2025-03-04 00:05:08,856 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51a0ae65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:08, skipping insertion in model container [2025-03-04 00:05:08,857 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:05:08" (1/1) ... [2025-03-04 00:05:08,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:05:09,071 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-54.i[915,928] [2025-03-04 00:05:09,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:05:09,157 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:05:09,167 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-54.i[915,928] [2025-03-04 00:05:09,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:05:09,214 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:05:09,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:09 WrapperNode [2025-03-04 00:05:09,216 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:05:09,217 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:05:09,218 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:05:09,218 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:05:09,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:09" (1/1) ... [2025-03-04 00:05:09,236 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:09" (1/1) ... [2025-03-04 00:05:09,261 INFO L138 Inliner]: procedures = 27, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 69 [2025-03-04 00:05:09,261 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:05:09,274 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:05:09,275 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:05:09,278 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:05:09,295 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:09" (1/1) ... [2025-03-04 00:05:09,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:09" (1/1) ... [2025-03-04 00:05:09,299 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:09" (1/1) ... [2025-03-04 00:05:09,322 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:05:09,327 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:09" (1/1) ... [2025-03-04 00:05:09,327 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:09" (1/1) ... [2025-03-04 00:05:09,344 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:09" (1/1) ... [2025-03-04 00:05:09,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:09" (1/1) ... [2025-03-04 00:05:09,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:09" (1/1) ... [2025-03-04 00:05:09,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:09" (1/1) ... [2025-03-04 00:05:09,355 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:05:09,356 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:05:09,356 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:05:09,356 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:05:09,362 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:09" (1/1) ... [2025-03-04 00:05:09,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:05:09,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:05:09,434 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:05:09,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:05:09,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:05:09,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:05:09,472 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:05:09,472 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:05:09,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:05:09,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:05:09,582 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:05:09,584 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:05:14,256 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-04 00:05:14,257 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:05:14,277 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:05:14,285 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:05:14,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:05:14 BoogieIcfgContainer [2025-03-04 00:05:14,285 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:05:14,291 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:05:14,292 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:05:14,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:05:14,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:05:08" (1/3) ... [2025-03-04 00:05:14,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40efd62a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:05:14, skipping insertion in model container [2025-03-04 00:05:14,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:09" (2/3) ... [2025-03-04 00:05:14,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40efd62a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:05:14, skipping insertion in model container [2025-03-04 00:05:14,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:05:14" (3/3) ... [2025-03-04 00:05:14,313 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-54.i [2025-03-04 00:05:14,336 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:05:14,338 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-54.i that has 2 procedures, 33 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:05:14,438 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:05:14,464 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;@298a209b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:05:14,464 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:05:14,471 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 00:05:14,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 00:05:14,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:05:14,490 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:05:14,491 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:05:14,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:05:14,500 INFO L85 PathProgramCache]: Analyzing trace with hash -306023518, now seen corresponding path program 1 times [2025-03-04 00:05:14,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:05:14,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499914813] [2025-03-04 00:05:14,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:05:14,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:05:14,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:05:14,540 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:05:14,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 00:05:14,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 00:05:14,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 00:05:14,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:05:14,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:05:14,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:05:15,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:05:15,045 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 00:05:15,046 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:05:15,047 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:05:15,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1499914813] [2025-03-04 00:05:15,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1499914813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:05:15,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:05:15,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:05:15,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308244980] [2025-03-04 00:05:15,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:05:15,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:05:15,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:05:15,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:05:15,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:05:15,075 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 00:05:15,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:05:15,098 INFO L93 Difference]: Finished difference Result 60 states and 91 transitions. [2025-03-04 00:05:15,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:05:15,101 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 56 [2025-03-04 00:05:15,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:05:15,110 INFO L225 Difference]: With dead ends: 60 [2025-03-04 00:05:15,116 INFO L226 Difference]: Without dead ends: 30 [2025-03-04 00:05:15,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:05:15,124 INFO L435 NwaCegarLoop]: 39 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, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:05:15,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:05:15,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-04 00:05:15,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-04 00:05:15,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 00:05:15,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2025-03-04 00:05:15,193 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 56 [2025-03-04 00:05:15,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:05:15,198 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2025-03-04 00:05:15,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 00:05:15,198 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2025-03-04 00:05:15,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 00:05:15,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:05:15,204 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:05:15,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 00:05:15,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:05:15,406 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:05:15,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:05:15,409 INFO L85 PathProgramCache]: Analyzing trace with hash -889408572, now seen corresponding path program 1 times [2025-03-04 00:05:15,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:05:15,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347746530] [2025-03-04 00:05:15,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:05:15,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:05:15,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:05:15,412 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:05:15,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 00:05:15,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 00:05:15,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 00:05:15,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:05:15,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:05:15,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 00:05:15,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:05:15,965 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 00:05:15,965 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:05:15,965 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:05:15,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347746530] [2025-03-04 00:05:15,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1347746530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:05:15,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:05:15,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:05:15,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803348787] [2025-03-04 00:05:15,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:05:15,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:05:15,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:05:15,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:05:15,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:05:15,972 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 00:05:16,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:05:16,806 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2025-03-04 00:05:16,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:05:16,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 56 [2025-03-04 00:05:16,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:05:16,835 INFO L225 Difference]: With dead ends: 57 [2025-03-04 00:05:16,835 INFO L226 Difference]: Without dead ends: 30 [2025-03-04 00:05:16,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:05:16,836 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:05:16,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 00:05:16,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-04 00:05:16,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-04 00:05:16,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 00:05:16,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2025-03-04 00:05:16,853 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 56 [2025-03-04 00:05:16,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:05:16,855 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2025-03-04 00:05:16,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 00:05:16,855 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2025-03-04 00:05:16,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 00:05:16,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:05:16,858 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:05:16,872 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-04 00:05:17,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:05:17,062 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:05:17,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:05:17,064 INFO L85 PathProgramCache]: Analyzing trace with hash -860779421, now seen corresponding path program 1 times [2025-03-04 00:05:17,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:05:17,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337672720] [2025-03-04 00:05:17,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:05:17,068 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:05:17,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:05:17,074 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:05:17,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 00:05:17,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 00:05:17,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 00:05:17,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:05:17,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:05:17,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 00:05:17,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:05:39,692 WARN L286 SmtUtils]: Spent 6.69s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 00:06:08,399 WARN L286 SmtUtils]: Spent 6.65s 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-04 00:06:15,507 WARN L286 SmtUtils]: Spent 7.10s 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-04 00:06:23,924 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 00:06:36,146 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 00:06:43,928 WARN L286 SmtUtils]: Spent 7.62s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)