./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 e2fb8bed 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-?-e2fb8be-m [2025-03-08 15:16:21,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:16:21,912 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:16:21,920 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:16:21,920 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:16:21,940 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:16:21,941 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:16:21,941 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:16:21,941 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:16:21,941 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:16:21,942 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:16:21,942 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:16:21,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:16:21,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:16:21,943 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:16:21,943 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:16:21,943 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:16:21,943 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:16:21,943 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:16:21,943 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:16:21,943 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:16:21,943 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:16:21,943 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:16:21,943 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:16:21,943 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:16:21,943 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:16:21,943 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:16:21,944 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:16:21,944 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:16:21,944 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:16:21,944 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:16:21,944 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:16:21,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:16:21,944 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:16:21,944 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:16:21,944 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:16:21,944 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:16:21,944 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:16:21,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:16:21,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:16:21,944 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:16:21,944 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:16:21,944 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:16:21,944 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-08 15:16:22,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:16:22,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:16:22,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:16:22,182 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:16:22,183 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:16:22,184 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-08 15:16:23,315 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d556676c/de1796b9541c40b086e060245b2b976a/FLAG46995568f [2025-03-08 15:16:23,543 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:16:23,544 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-54.i [2025-03-08 15:16:23,550 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d556676c/de1796b9541c40b086e060245b2b976a/FLAG46995568f [2025-03-08 15:16:23,888 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d556676c/de1796b9541c40b086e060245b2b976a [2025-03-08 15:16:23,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:16:23,891 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:16:23,892 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:16:23,892 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:16:23,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:16:23,896 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:16:23" (1/1) ... [2025-03-08 15:16:23,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33b4e7d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:23, skipping insertion in model container [2025-03-08 15:16:23,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:16:23" (1/1) ... [2025-03-08 15:16:23,907 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:16:23,997 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-08 15:16:24,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:16:24,030 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:16:24,038 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-08 15:16:24,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:16:24,053 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:16:24,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:24 WrapperNode [2025-03-08 15:16:24,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:16:24,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:16:24,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:16:24,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:16:24,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:24" (1/1) ... [2025-03-08 15:16:24,063 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:24" (1/1) ... [2025-03-08 15:16:24,074 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 71 [2025-03-08 15:16:24,074 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:16:24,075 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:16:24,075 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:16:24,075 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:16:24,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:24" (1/1) ... [2025-03-08 15:16:24,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:24" (1/1) ... [2025-03-08 15:16:24,082 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:24" (1/1) ... [2025-03-08 15:16:24,095 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-08 15:16:24,095 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:24" (1/1) ... [2025-03-08 15:16:24,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:24" (1/1) ... [2025-03-08 15:16:24,099 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:24" (1/1) ... [2025-03-08 15:16:24,100 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:24" (1/1) ... [2025-03-08 15:16:24,104 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:24" (1/1) ... [2025-03-08 15:16:24,105 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:24" (1/1) ... [2025-03-08 15:16:24,105 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:16:24,106 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:16:24,106 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:16:24,106 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:16:24,110 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:24" (1/1) ... [2025-03-08 15:16:24,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:16:24,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:16:24,136 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-08 15:16:24,141 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-08 15:16:24,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:16:24,157 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:16:24,157 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:16:24,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:16:24,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:16:24,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:16:24,204 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:16:24,206 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:16:24,346 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 15:16:24,346 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:16:24,355 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:16:24,356 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:16:24,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:16:24 BoogieIcfgContainer [2025-03-08 15:16:24,356 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:16:24,358 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:16:24,359 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:16:24,362 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:16:24,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:16:23" (1/3) ... [2025-03-08 15:16:24,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56cade31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:16:24, skipping insertion in model container [2025-03-08 15:16:24,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:24" (2/3) ... [2025-03-08 15:16:24,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56cade31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:16:24, skipping insertion in model container [2025-03-08 15:16:24,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:16:24" (3/3) ... [2025-03-08 15:16:24,365 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-54.i [2025-03-08 15:16:24,378 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:16:24,379 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-08 15:16:24,420 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:16:24,427 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;@4369004f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:16:24,428 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:16:24,432 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-08 15:16:24,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 15:16:24,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:16:24,439 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-08 15:16:24,439 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:16:24,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:16:24,443 INFO L85 PathProgramCache]: Analyzing trace with hash -306023518, now seen corresponding path program 1 times [2025-03-08 15:16:24,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:16:24,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363731249] [2025-03-08 15:16:24,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:16:24,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:16:24,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 15:16:24,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 15:16:24,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:16:24,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:16:24,603 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-08 15:16:24,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:16:24,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363731249] [2025-03-08 15:16:24,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363731249] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:16:24,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107664765] [2025-03-08 15:16:24,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:16:24,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:16:24,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:16:24,606 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-08 15:16:24,608 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-08 15:16:24,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 15:16:24,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 15:16:24,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:16:24,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:16:24,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:16:24,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:16:24,702 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-08 15:16:24,702 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:16:24,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107664765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:16:24,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:16:24,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:16:24,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387375973] [2025-03-08 15:16:24,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:16:24,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:16:24,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:16:24,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:16:24,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:16:24,722 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-08 15:16:24,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:16:24,739 INFO L93 Difference]: Finished difference Result 60 states and 91 transitions. [2025-03-08 15:16:24,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:16:24,740 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-08 15:16:24,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:16:24,744 INFO L225 Difference]: With dead ends: 60 [2025-03-08 15:16:24,745 INFO L226 Difference]: Without dead ends: 30 [2025-03-08 15:16:24,747 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-08 15:16:24,751 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-08 15:16:24,752 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-08 15:16:24,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-08 15:16:24,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-08 15:16:24,772 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-08 15:16:24,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2025-03-08 15:16:24,776 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 56 [2025-03-08 15:16:24,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:16:24,776 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2025-03-08 15:16:24,776 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-08 15:16:24,776 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2025-03-08 15:16:24,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 15:16:24,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:16:24,778 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-08 15:16:24,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 15:16:24,978 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-08 15:16:24,979 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:16:24,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:16:24,979 INFO L85 PathProgramCache]: Analyzing trace with hash -889408572, now seen corresponding path program 1 times [2025-03-08 15:16:24,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:16:24,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12221345] [2025-03-08 15:16:24,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:16:24,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:16:24,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 15:16:25,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 15:16:25,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:16:25,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:16:25,110 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-08 15:16:25,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:16:25,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12221345] [2025-03-08 15:16:25,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12221345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:16:25,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:16:25,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:16:25,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859574960] [2025-03-08 15:16:25,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:16:25,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:16:25,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:16:25,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:16:25,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:16:25,112 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-08 15:16:25,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:16:25,125 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2025-03-08 15:16:25,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:16:25,126 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-08 15:16:25,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:16:25,126 INFO L225 Difference]: With dead ends: 57 [2025-03-08 15:16:25,126 INFO L226 Difference]: Without dead ends: 30 [2025-03-08 15:16:25,127 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-08 15:16:25,127 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-08 15:16:25,128 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-08 15:16:25,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-08 15:16:25,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-08 15:16:25,132 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-08 15:16:25,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2025-03-08 15:16:25,134 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 56 [2025-03-08 15:16:25,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:16:25,136 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2025-03-08 15:16:25,136 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-08 15:16:25,136 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2025-03-08 15:16:25,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 15:16:25,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:16:25,137 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-08 15:16:25,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:16:25,137 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:16:25,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:16:25,138 INFO L85 PathProgramCache]: Analyzing trace with hash -860779421, now seen corresponding path program 1 times [2025-03-08 15:16:25,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:16:25,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690713255] [2025-03-08 15:16:25,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:16:25,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:16:25,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 15:16:25,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 15:16:25,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:16:25,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:16:25,180 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 15:16:25,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 15:16:25,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 15:16:25,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:16:25,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:16:25,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 15:16:25,238 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 15:16:25,239 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 15:16:25,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:16:25,242 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 15:16:25,265 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 15:16:25,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 03:16:25 BoogieIcfgContainer [2025-03-08 15:16:25,269 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 15:16:25,269 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 15:16:25,269 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 15:16:25,269 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 15:16:25,270 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:16:24" (3/4) ... [2025-03-08 15:16:25,272 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 15:16:25,272 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 15:16:25,273 INFO L158 Benchmark]: Toolchain (without parser) took 1382.01ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 46.6MB in the end (delta: 76.2MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-03-08 15:16:25,273 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:16:25,273 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.21ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 110.6MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:16:25,273 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.65ms. Allocated memory is still 167.8MB. Free memory was 110.6MB in the beginning and 109.2MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:16:25,274 INFO L158 Benchmark]: Boogie Preprocessor took 30.87ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 108.2MB in the end (delta: 965.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:16:25,274 INFO L158 Benchmark]: IcfgBuilder took 250.51ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 95.9MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:16:25,274 INFO L158 Benchmark]: TraceAbstraction took 910.57ms. Allocated memory is still 167.8MB. Free memory was 95.0MB in the beginning and 46.6MB in the end (delta: 48.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-08 15:16:25,274 INFO L158 Benchmark]: Witness Printer took 3.21ms. Allocated memory is still 167.8MB. Free memory is still 46.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:16:25,275 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.25ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 162.21ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 110.6MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.65ms. Allocated memory is still 167.8MB. Free memory was 110.6MB in the beginning and 109.2MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.87ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 108.2MB in the end (delta: 965.2kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 250.51ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 95.9MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 910.57ms. Allocated memory is still 167.8MB. Free memory was 95.0MB in the beginning and 46.6MB in the end (delta: 48.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 3.21ms. Allocated memory is still 167.8MB. Free memory is still 46.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 49, overapproximation of someBinaryFLOATComparisonOperation at line 50, overapproximation of someBinaryFLOATComparisonOperation at line 62, overapproximation of someBinaryFLOATComparisonOperation at line 45, overapproximation of someBinaryFLOATComparisonOperation at line 47, overapproximation of someBinaryFLOATComparisonOperation at line 37. 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, 52 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, 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.1s SatisfiabilityAnalysisTime, 0.2s 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-08 15:16:25,288 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-?-e2fb8be-m [2025-03-08 15:16:27,109 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:16:27,198 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 15:16:27,202 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:16:27,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:16:27,221 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:16:27,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:16:27,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:16:27,223 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:16:27,224 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:16:27,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:16:27,224 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:16:27,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:16:27,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:16:27,225 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:16:27,225 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:16:27,226 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:16:27,226 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:16:27,226 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:16:27,226 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:16:27,226 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:16:27,226 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:16:27,226 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:16:27,226 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 15:16:27,226 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 15:16:27,226 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 15:16:27,226 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:16:27,226 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:16:27,227 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:16:27,227 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:16:27,227 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:16:27,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:16:27,227 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:16:27,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:16:27,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:16:27,228 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:16:27,228 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:16:27,228 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:16:27,228 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:16:27,228 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 15:16:27,228 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 15:16:27,228 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:16:27,228 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:16:27,228 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:16:27,228 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:16:27,229 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-08 15:16:27,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:16:27,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:16:27,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:16:27,468 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:16:27,468 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:16:27,469 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-08 15:16:28,600 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fcb67b02/2c73fc55aa37431c82cbfeebbdd97a23/FLAGb7adcfdf3 [2025-03-08 15:16:28,770 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:16:28,771 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-54.i [2025-03-08 15:16:28,778 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fcb67b02/2c73fc55aa37431c82cbfeebbdd97a23/FLAGb7adcfdf3 [2025-03-08 15:16:29,153 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fcb67b02/2c73fc55aa37431c82cbfeebbdd97a23 [2025-03-08 15:16:29,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:16:29,157 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:16:29,157 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:16:29,158 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:16:29,160 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:16:29,160 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:16:29" (1/1) ... [2025-03-08 15:16:29,161 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42a73736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:29, skipping insertion in model container [2025-03-08 15:16:29,161 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:16:29" (1/1) ... [2025-03-08 15:16:29,172 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:16:29,267 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-08 15:16:29,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:16:29,303 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:16:29,310 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-08 15:16:29,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:16:29,330 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:16:29,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:29 WrapperNode [2025-03-08 15:16:29,331 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:16:29,332 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:16:29,332 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:16:29,332 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:16:29,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:29" (1/1) ... [2025-03-08 15:16:29,343 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:29" (1/1) ... [2025-03-08 15:16:29,354 INFO L138 Inliner]: procedures = 27, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 69 [2025-03-08 15:16:29,355 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:16:29,355 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:16:29,355 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:16:29,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:16:29,364 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:29" (1/1) ... [2025-03-08 15:16:29,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:29" (1/1) ... [2025-03-08 15:16:29,366 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:29" (1/1) ... [2025-03-08 15:16:29,375 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-08 15:16:29,375 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:29" (1/1) ... [2025-03-08 15:16:29,375 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:29" (1/1) ... [2025-03-08 15:16:29,380 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:29" (1/1) ... [2025-03-08 15:16:29,381 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:29" (1/1) ... [2025-03-08 15:16:29,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:29" (1/1) ... [2025-03-08 15:16:29,382 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:29" (1/1) ... [2025-03-08 15:16:29,384 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:16:29,384 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:16:29,384 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:16:29,384 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:16:29,385 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:29" (1/1) ... [2025-03-08 15:16:29,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:16:29,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:16:29,411 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-08 15:16:29,415 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-08 15:16:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:16:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 15:16:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:16:29,435 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:16:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:16:29,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:16:29,488 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:16:29,490 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:16:31,468 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 15:16:31,468 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:16:31,476 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:16:31,477 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:16:31,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:16:31 BoogieIcfgContainer [2025-03-08 15:16:31,477 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:16:31,479 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:16:31,479 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:16:31,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:16:31,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:16:29" (1/3) ... [2025-03-08 15:16:31,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2ca249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:16:31, skipping insertion in model container [2025-03-08 15:16:31,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:29" (2/3) ... [2025-03-08 15:16:31,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2ca249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:16:31, skipping insertion in model container [2025-03-08 15:16:31,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:16:31" (3/3) ... [2025-03-08 15:16:31,484 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-54.i [2025-03-08 15:16:31,495 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:16:31,496 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-08 15:16:31,536 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:16:31,544 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;@416821b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:16:31,544 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:16:31,547 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-08 15:16:31,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 15:16:31,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:16:31,553 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-08 15:16:31,553 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:16:31,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:16:31,556 INFO L85 PathProgramCache]: Analyzing trace with hash -306023518, now seen corresponding path program 1 times [2025-03-08 15:16:31,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:16:31,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1601587449] [2025-03-08 15:16:31,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:16:31,564 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-08 15:16:31,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:16:31,566 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-08 15:16:31,567 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-08 15:16:31,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 15:16:31,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 15:16:31,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:16:31,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:16:31,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:16:31,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:16:31,867 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-08 15:16:31,868 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:16:31,868 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:16:31,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1601587449] [2025-03-08 15:16:31,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1601587449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:16:31,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:16:31,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 15:16:31,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799645998] [2025-03-08 15:16:31,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:16:31,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:16:31,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:16:31,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:16:31,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:16:31,890 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-08 15:16:31,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:16:31,902 INFO L93 Difference]: Finished difference Result 60 states and 91 transitions. [2025-03-08 15:16:31,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:16:31,904 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-08 15:16:31,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:16:31,909 INFO L225 Difference]: With dead ends: 60 [2025-03-08 15:16:31,909 INFO L226 Difference]: Without dead ends: 30 [2025-03-08 15:16:31,911 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-08 15:16:31,914 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-08 15:16:31,914 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-08 15:16:31,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-08 15:16:31,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-08 15:16:31,939 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-08 15:16:31,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2025-03-08 15:16:31,945 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 56 [2025-03-08 15:16:31,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:16:31,946 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2025-03-08 15:16:31,946 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-08 15:16:31,946 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2025-03-08 15:16:31,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 15:16:31,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:16:31,948 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-08 15:16:31,959 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-08 15:16:32,149 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-08 15:16:32,150 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:16:32,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:16:32,151 INFO L85 PathProgramCache]: Analyzing trace with hash -889408572, now seen corresponding path program 1 times [2025-03-08 15:16:32,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:16:32,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [288494215] [2025-03-08 15:16:32,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:16:32,151 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-08 15:16:32,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:16:32,153 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-08 15:16:32,154 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-08 15:16:32,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 15:16:32,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 15:16:32,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:16:32,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:16:32,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 15:16:32,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:16:32,454 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-08 15:16:32,454 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:16:32,454 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:16:32,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [288494215] [2025-03-08 15:16:32,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [288494215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:16:32,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:16:32,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:16:32,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100316759] [2025-03-08 15:16:32,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:16:32,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:16:32,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:16:32,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:16:32,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:16:32,456 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-08 15:16:32,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:16:32,888 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2025-03-08 15:16:32,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:16:32,905 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-08 15:16:32,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:16:32,905 INFO L225 Difference]: With dead ends: 57 [2025-03-08 15:16:32,906 INFO L226 Difference]: Without dead ends: 30 [2025-03-08 15:16:32,906 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-08 15:16:32,906 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:16:32,907 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.4s Time] [2025-03-08 15:16:32,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-08 15:16:32,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-08 15:16:32,909 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-08 15:16:32,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2025-03-08 15:16:32,912 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 56 [2025-03-08 15:16:32,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:16:32,913 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2025-03-08 15:16:32,913 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-08 15:16:32,913 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2025-03-08 15:16:32,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 15:16:32,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:16:32,914 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-08 15:16:32,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 15:16:33,114 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-08 15:16:33,114 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:16:33,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:16:33,115 INFO L85 PathProgramCache]: Analyzing trace with hash -860779421, now seen corresponding path program 1 times [2025-03-08 15:16:33,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:16:33,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1617917510] [2025-03-08 15:16:33,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:16:33,116 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-08 15:16:33,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:16:33,117 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-08 15:16:33,119 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-08 15:16:33,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 15:16:33,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 15:16:33,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:16:33,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:16:33,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 15:16:33,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:16:45,600 WARN L286 SmtUtils]: Spent 5.24s 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-08 15:17:39,975 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-08 15:17:39,975 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:17:39,975 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:17:39,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1617917510] [2025-03-08 15:17:39,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1617917510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:17:39,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:17:39,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:17:39,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229452351] [2025-03-08 15:17:39,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:17:39,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:17:39,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:17:39,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:17:39,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:17:39,976 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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-08 15:17:44,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:17:48,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:17:57,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:18:05,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:18:07,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:18:07,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:18:07,206 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2025-03-08 15:18:07,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:18:07,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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-08 15:18:07,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:18:07,247 INFO L225 Difference]: With dead ends: 38 [2025-03-08 15:18:07,247 INFO L226 Difference]: Without dead ends: 36 [2025-03-08 15:18:07,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:18:07,249 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 5 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.8s IncrementalHoareTripleChecker+Time [2025-03-08 15:18:07,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 126 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 15.8s Time] [2025-03-08 15:18:07,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-08 15:18:07,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2025-03-08 15:18:07,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 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-08 15:18:07,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2025-03-08 15:18:07,253 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 56 [2025-03-08 15:18:07,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:18:07,253 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2025-03-08 15:18:07,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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-08 15:18:07,253 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2025-03-08 15:18:07,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 15:18:07,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:18:07,254 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-08 15:18:07,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 15:18:07,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 15:18:07,455 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:18:07,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:18:07,456 INFO L85 PathProgramCache]: Analyzing trace with hash -859855900, now seen corresponding path program 1 times [2025-03-08 15:18:07,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:18:07,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [805022804] [2025-03-08 15:18:07,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:18:07,456 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-08 15:18:07,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:18:07,459 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 15:18:07,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 15:18:07,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 15:18:07,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 15:18:07,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:18:07,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:18:07,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 15:18:07,681 INFO L279 TraceCheckSpWp]: Computing forward predicates...