./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-12.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aa1e77145a453bb1c8c30584a939ce2ad6e9e6ba71078979a914a9b565af9d38 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:36:12,621 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:36:12,675 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:36:12,678 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:36:12,678 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:36:12,698 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:36:12,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:36:12,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:36:12,699 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:36:12,699 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:36:12,699 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:36:12,700 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:36:12,700 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:36:12,700 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:36:12,700 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:36:12,700 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:36:12,700 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:36:12,700 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:36:12,700 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:36:12,700 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:36:12,700 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:36:12,700 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:36:12,700 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:36:12,700 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:36:12,700 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:36:12,700 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:36:12,700 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:36:12,700 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:36:12,701 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:36:12,701 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:36:12,701 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:36:12,701 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:36:12,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:36:12,701 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:36:12,701 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:36:12,701 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:36:12,701 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:36:12,701 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:36:12,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:36:12,701 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:36:12,701 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:36:12,701 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:36:12,701 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:36:12,701 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 -> aa1e77145a453bb1c8c30584a939ce2ad6e9e6ba71078979a914a9b565af9d38 [2025-03-17 04:36:12,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:36:12,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:36:12,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:36:12,921 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:36:12,921 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:36:12,921 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-12.i [2025-03-17 04:36:14,088 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/578c5c46e/2d9b324c924c4bfca44277d2517f5bf6/FLAGf279cc170 [2025-03-17 04:36:14,318 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:36:14,320 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-12.i [2025-03-17 04:36:14,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/578c5c46e/2d9b324c924c4bfca44277d2517f5bf6/FLAGf279cc170 [2025-03-17 04:36:14,655 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/578c5c46e/2d9b324c924c4bfca44277d2517f5bf6 [2025-03-17 04:36:14,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:36:14,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:36:14,661 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:36:14,661 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:36:14,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:36:14,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:36:14" (1/1) ... [2025-03-17 04:36:14,666 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c39bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:36:14, skipping insertion in model container [2025-03-17 04:36:14,666 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:36:14" (1/1) ... [2025-03-17 04:36:14,680 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:36:14,776 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_amount25_file-12.i[915,928] [2025-03-17 04:36:14,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:36:14,809 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:36:14,815 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_amount25_file-12.i[915,928] [2025-03-17 04:36:14,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:36:14,834 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:36:14,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:36:14 WrapperNode [2025-03-17 04:36:14,835 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:36:14,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:36:14,836 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:36:14,836 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:36:14,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:36:14" (1/1) ... [2025-03-17 04:36:14,845 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:36:14" (1/1) ... [2025-03-17 04:36:14,861 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2025-03-17 04:36:14,862 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:36:14,862 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:36:14,862 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:36:14,862 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:36:14,874 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:36:14" (1/1) ... [2025-03-17 04:36:14,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:36:14" (1/1) ... [2025-03-17 04:36:14,876 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:36:14" (1/1) ... [2025-03-17 04:36:14,888 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 04:36:14,889 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:36:14" (1/1) ... [2025-03-17 04:36:14,889 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:36:14" (1/1) ... [2025-03-17 04:36:14,892 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:36:14" (1/1) ... [2025-03-17 04:36:14,896 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:36:14" (1/1) ... [2025-03-17 04:36:14,897 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:36:14" (1/1) ... [2025-03-17 04:36:14,897 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:36:14" (1/1) ... [2025-03-17 04:36:14,899 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:36:14,899 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:36:14,899 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:36:14,899 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:36:14,900 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:36:14" (1/1) ... [2025-03-17 04:36:14,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:36:14,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:36:14,932 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 04:36:14,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 04:36:14,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:36:14,951 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:36:14,951 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:36:14,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:36:14,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:36:14,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:36:15,002 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:36:15,004 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:36:15,170 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 04:36:15,170 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:36:15,176 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:36:15,176 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:36:15,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:36:15 BoogieIcfgContainer [2025-03-17 04:36:15,177 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:36:15,178 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:36:15,178 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:36:15,181 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:36:15,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:36:14" (1/3) ... [2025-03-17 04:36:15,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57ecb0b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:36:15, skipping insertion in model container [2025-03-17 04:36:15,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:36:14" (2/3) ... [2025-03-17 04:36:15,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57ecb0b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:36:15, skipping insertion in model container [2025-03-17 04:36:15,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:36:15" (3/3) ... [2025-03-17 04:36:15,183 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-12.i [2025-03-17 04:36:15,192 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:36:15,193 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-12.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:36:15,234 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:36:15,244 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;@74dcb718, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:36:15,245 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:36:15,249 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 04:36:15,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 04:36:15,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:36:15,258 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:36:15,258 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:36:15,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:36:15,263 INFO L85 PathProgramCache]: Analyzing trace with hash -2014483481, now seen corresponding path program 1 times [2025-03-17 04:36:15,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:36:15,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157329646] [2025-03-17 04:36:15,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:36:15,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:36:15,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 04:36:15,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 04:36:15,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:36:15,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:36:15,445 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 04:36:15,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:36:15,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157329646] [2025-03-17 04:36:15,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157329646] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:36:15,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576799246] [2025-03-17 04:36:15,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:36:15,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:36:15,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:36:15,450 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:36:15,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 04:36:15,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 04:36:15,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 04:36:15,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:36:15,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:36:15,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:36:15,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:36:15,592 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 04:36:15,593 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:36:15,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576799246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:36:15,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:36:15,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:36:15,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99832646] [2025-03-17 04:36:15,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:36:15,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:36:15,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:36:15,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:36:15,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:36:15,613 INFO L87 Difference]: Start difference. First operand has 45 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 04:36:15,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:36:15,629 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2025-03-17 04:36:15,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:36:15,630 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 98 [2025-03-17 04:36:15,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:36:15,636 INFO L225 Difference]: With dead ends: 87 [2025-03-17 04:36:15,636 INFO L226 Difference]: Without dead ends: 43 [2025-03-17 04:36:15,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:36:15,641 INFO L435 NwaCegarLoop]: 64 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, 64 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:36:15,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:36:15,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-17 04:36:15,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-17 04:36:15,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 04:36:15,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2025-03-17 04:36:15,668 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 98 [2025-03-17 04:36:15,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:36:15,668 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2025-03-17 04:36:15,668 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 04:36:15,668 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2025-03-17 04:36:15,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 04:36:15,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:36:15,671 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:36:15,678 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-17 04:36:15,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 04:36:15,872 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:36:15,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:36:15,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1392804147, now seen corresponding path program 1 times [2025-03-17 04:36:15,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:36:15,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746434126] [2025-03-17 04:36:15,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:36:15,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:36:15,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 04:36:15,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 04:36:15,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:36:15,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:36:16,361 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 04:36:16,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:36:16,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746434126] [2025-03-17 04:36:16,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746434126] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:36:16,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556444290] [2025-03-17 04:36:16,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:36:16,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:36:16,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:36:16,366 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:36:16,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 04:36:16,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 04:36:16,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 04:36:16,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:36:16,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:36:16,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 04:36:16,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:36:16,632 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-03-17 04:36:16,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:36:16,796 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 04:36:16,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556444290] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:36:16,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:36:16,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-17 04:36:16,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379118074] [2025-03-17 04:36:16,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:36:16,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 04:36:16,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:36:16,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 04:36:16,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:36:16,799 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 04:36:17,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:36:17,012 INFO L93 Difference]: Finished difference Result 139 states and 200 transitions. [2025-03-17 04:36:17,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 04:36:17,012 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 98 [2025-03-17 04:36:17,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:36:17,013 INFO L225 Difference]: With dead ends: 139 [2025-03-17 04:36:17,014 INFO L226 Difference]: Without dead ends: 97 [2025-03-17 04:36:17,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 193 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2025-03-17 04:36:17,015 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 75 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:36:17,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 127 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:36:17,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-17 04:36:17,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 48. [2025-03-17 04:36:17,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 04:36:17,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2025-03-17 04:36:17,027 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 98 [2025-03-17 04:36:17,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:36:17,028 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2025-03-17 04:36:17,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 04:36:17,028 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2025-03-17 04:36:17,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 04:36:17,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:36:17,030 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:36:17,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 04:36:17,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-17 04:36:17,230 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:36:17,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:36:17,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1392774356, now seen corresponding path program 1 times [2025-03-17 04:36:17,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:36:17,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495690987] [2025-03-17 04:36:17,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:36:17,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:36:17,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 04:36:17,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 04:36:17,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:36:17,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 04:36:17,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [46512778] [2025-03-17 04:36:17,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:36:17,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:36:17,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:36:17,279 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:36:17,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 04:36:17,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 04:36:17,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 04:36:17,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:36:17,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:36:17,365 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 04:36:17,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 04:36:17,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 04:36:17,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:36:17,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:36:17,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 04:36:17,440 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 04:36:17,441 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 04:36:17,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 04:36:17,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:36:17,646 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 04:36:17,700 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 04:36:17,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:36:17 BoogieIcfgContainer [2025-03-17 04:36:17,703 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 04:36:17,703 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 04:36:17,703 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 04:36:17,703 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 04:36:17,704 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:36:15" (3/4) ... [2025-03-17 04:36:17,706 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 04:36:17,706 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 04:36:17,707 INFO L158 Benchmark]: Toolchain (without parser) took 3047.39ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 90.6MB in the end (delta: 15.5MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2025-03-17 04:36:17,707 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:36:17,707 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.61ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 93.8MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:36:17,708 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.10ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 91.8MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:36:17,708 INFO L158 Benchmark]: Boogie Preprocessor took 36.36ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 89.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:36:17,708 INFO L158 Benchmark]: IcfgBuilder took 277.79ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 74.1MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 04:36:17,709 INFO L158 Benchmark]: TraceAbstraction took 2524.21ms. Allocated memory is still 142.6MB. Free memory was 73.1MB in the beginning and 90.6MB in the end (delta: -17.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:36:17,709 INFO L158 Benchmark]: Witness Printer took 3.08ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 90.6MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:36:17,710 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.14ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 174.61ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 93.8MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.10ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 91.8MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.36ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 89.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 277.79ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 74.1MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2524.21ms. Allocated memory is still 142.6MB. Free memory was 73.1MB in the beginning and 90.6MB in the end (delta: -17.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.08ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 90.6MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryArithmeticFLOAToperation at line 63. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] signed long int var_1_2 = -8; [L24] signed long int var_1_3 = 128; [L25] unsigned char var_1_5 = 0; [L26] float var_1_6 = 128.625; [L27] float var_1_7 = 2.625; [L28] float var_1_8 = 25.5; [L29] float var_1_9 = 4.75; [L30] float var_1_10 = 16.4; [L31] float var_1_11 = 0.2; [L32] float var_1_12 = 499.1; [L33] unsigned char var_1_13 = 0; [L34] signed long int var_1_14 = -8; [L35] unsigned char var_1_15 = 1; [L36] unsigned char last_1_var_1_13 = 0; [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L94] last_1_var_1_13 = var_1_13 [L104] RET updateLastVariables() [L105] CALL updateVariables() [L66] var_1_2 = __VERIFIER_nondet_long() [L67] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=128, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=128, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L67] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=128, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L68] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=128, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=128, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L68] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=128, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L69] var_1_3 = __VERIFIER_nondet_long() [L70] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L70] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L71] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L71] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L72] var_1_5 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L73] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L74] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L74] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L75] var_1_7 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_8=51/2, var_1_9=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_8=51/2, var_1_9=19/4] [L76] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_8=51/2, var_1_9=19/4] [L77] var_1_8 = __VERIFIER_nondet_float() [L78] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_9=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_9=19/4] [L78] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_9=19/4] [L79] var_1_9 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L80] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L81] var_1_10 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L82] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L83] var_1_12 = __VERIFIER_nondet_float() [L84] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L84] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L85] var_1_14 = __VERIFIER_nondet_long() [L86] CALL assume_abort_if_not(var_1_14 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L86] RET assume_abort_if_not(var_1_14 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L87] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L87] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L88] CALL assume_abort_if_not(var_1_14 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L88] RET assume_abort_if_not(var_1_14 != 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L89] var_1_15 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L90] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L91] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L91] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L105] RET updateVariables() [L106] CALL step() [L40] signed long int stepLocal_1 = var_1_3; [L41] signed long int stepLocal_0 = var_1_2; VAL [isInitial=1, last_1_var_1_13=0, stepLocal_0=-1, stepLocal_1=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L42] COND FALSE !(! (-50 < var_1_2)) VAL [isInitial=1, last_1_var_1_13=0, stepLocal_0=-1, stepLocal_1=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L51] COND FALSE !(var_1_2 > (var_1_3 / var_1_14)) [L58] var_1_13 = var_1_5 VAL [isInitial=1, last_1_var_1_13=0, stepLocal_0=-1, stepLocal_1=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L60] COND FALSE !(\read(var_1_13)) VAL [isInitial=1, last_1_var_1_13=0, stepLocal_0=-1, stepLocal_1=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L63] var_1_11 = (((((2.5f) < (((((31.75f) > (var_1_12)) ? (31.75f) : (var_1_12))))) ? (2.5f) : (((((31.75f) > (var_1_12)) ? (31.75f) : (var_1_12)))))) + 0.125f) [L106] RET step() [L107] CALL, EXPR property() [L97-L98] return ((((! (-50 < var_1_2)) ? ((var_1_2 != var_1_3) ? ((var_1_3 <= var_1_2) ? (var_1_1 == ((unsigned char) (last_1_var_1_13 && var_1_5))) : 1) : (var_1_1 == ((unsigned char) var_1_5))) : 1) && (var_1_13 ? (var_1_6 == ((float) (((((((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_9)) > (var_1_10)) ? ((((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_9)) : (var_1_10))))) : 1)) && (var_1_11 == ((float) (((((2.5f) < (((((31.75f) > (var_1_12)) ? (31.75f) : (var_1_12))))) ? (2.5f) : (((((31.75f) > (var_1_12)) ? (31.75f) : (var_1_12)))))) + 0.125f)))) && ((var_1_2 > (var_1_3 / var_1_14)) ? (var_1_1 ? (var_1_13 == ((unsigned char) (! var_1_15))) : (var_1_13 == ((unsigned char) 0))) : (var_1_13 == ((unsigned char) var_1_5))) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 84 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 191 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 86 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 140 IncrementalHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 105 mSDtfsCounter, 140 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 292 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=2, InterpolantAutomatonStates: 17, 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, 49 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 588 NumberOfCodeBlocks, 588 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 485 ConstructedInterpolants, 0 QuantifiedInterpolants, 943 SizeOfPredicates, 2 NumberOfNonLiveVariables, 472 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 2280/2400 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 04:36:17,723 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_amount25_file-12.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aa1e77145a453bb1c8c30584a939ce2ad6e9e6ba71078979a914a9b565af9d38 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:36:19,455 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:36:19,529 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 04:36:19,533 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:36:19,533 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:36:19,553 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:36:19,555 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:36:19,555 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:36:19,555 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:36:19,555 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:36:19,555 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:36:19,556 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:36:19,556 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:36:19,556 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:36:19,556 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:36:19,556 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:36:19,556 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:36:19,557 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:36:19,557 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:36:19,557 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:36:19,557 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:36:19,557 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:36:19,557 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:36:19,558 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 04:36:19,558 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 04:36:19,558 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 04:36:19,558 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:36:19,558 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:36:19,558 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:36:19,558 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:36:19,558 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:36:19,558 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:36:19,559 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:36:19,559 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:36:19,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:36:19,559 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:36:19,559 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:36:19,559 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:36:19,559 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:36:19,559 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 04:36:19,559 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 04:36:19,559 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:36:19,560 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:36:19,560 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:36:19,560 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:36:19,560 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 -> aa1e77145a453bb1c8c30584a939ce2ad6e9e6ba71078979a914a9b565af9d38 [2025-03-17 04:36:19,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:36:19,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:36:19,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:36:19,790 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:36:19,791 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:36:19,791 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-12.i [2025-03-17 04:36:20,903 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa486d341/f0fddfeac2a045d3bc7a857ac60bf441/FLAG4a9260042 [2025-03-17 04:36:21,072 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:36:21,073 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-12.i [2025-03-17 04:36:21,079 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa486d341/f0fddfeac2a045d3bc7a857ac60bf441/FLAG4a9260042 [2025-03-17 04:36:21,472 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa486d341/f0fddfeac2a045d3bc7a857ac60bf441 [2025-03-17 04:36:21,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:36:21,475 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:36:21,476 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:36:21,476 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:36:21,479 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:36:21,479 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:36:21" (1/1) ... [2025-03-17 04:36:21,480 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@391a3f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:36:21, skipping insertion in model container [2025-03-17 04:36:21,480 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:36:21" (1/1) ... [2025-03-17 04:36:21,489 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:36:21,586 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_amount25_file-12.i[915,928] [2025-03-17 04:36:21,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:36:21,623 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:36:21,630 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_amount25_file-12.i[915,928] [2025-03-17 04:36:21,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:36:21,659 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:36:21,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:36:21 WrapperNode [2025-03-17 04:36:21,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:36:21,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:36:21,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:36:21,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:36:21,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:36:21" (1/1) ... [2025-03-17 04:36:21,674 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:36:21" (1/1) ... [2025-03-17 04:36:21,695 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2025-03-17 04:36:21,695 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:36:21,696 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:36:21,696 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:36:21,696 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:36:21,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:36:21" (1/1) ... [2025-03-17 04:36:21,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:36:21" (1/1) ... [2025-03-17 04:36:21,706 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:36:21" (1/1) ... [2025-03-17 04:36:21,720 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 04:36:21,720 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:36:21" (1/1) ... [2025-03-17 04:36:21,720 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:36:21" (1/1) ... [2025-03-17 04:36:21,730 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:36:21" (1/1) ... [2025-03-17 04:36:21,731 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:36:21" (1/1) ... [2025-03-17 04:36:21,732 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:36:21" (1/1) ... [2025-03-17 04:36:21,733 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:36:21" (1/1) ... [2025-03-17 04:36:21,738 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:36:21,739 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:36:21,739 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:36:21,739 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:36:21,740 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:36:21" (1/1) ... [2025-03-17 04:36:21,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:36:21,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:36:21,766 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 04:36:21,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 04:36:21,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:36:21,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 04:36:21,787 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:36:21,788 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:36:21,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:36:21,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:36:21,850 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:36:21,851 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:36:22,420 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 04:36:22,420 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:36:22,430 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:36:22,430 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:36:22,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:36:22 BoogieIcfgContainer [2025-03-17 04:36:22,430 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:36:22,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:36:22,432 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:36:22,436 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:36:22,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:36:21" (1/3) ... [2025-03-17 04:36:22,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa4a7aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:36:22, skipping insertion in model container [2025-03-17 04:36:22,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:36:21" (2/3) ... [2025-03-17 04:36:22,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa4a7aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:36:22, skipping insertion in model container [2025-03-17 04:36:22,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:36:22" (3/3) ... [2025-03-17 04:36:22,440 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-12.i [2025-03-17 04:36:22,450 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:36:22,451 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-12.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:36:22,492 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:36:22,500 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;@36a847fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:36:22,501 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:36:22,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 04:36:22,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 04:36:22,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:36:22,512 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:36:22,512 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:36:22,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:36:22,516 INFO L85 PathProgramCache]: Analyzing trace with hash -2014483481, now seen corresponding path program 1 times [2025-03-17 04:36:22,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:36:22,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663398937] [2025-03-17 04:36:22,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:36:22,526 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 04:36:22,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:36:22,528 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 04:36:22,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 04:36:22,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 04:36:22,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 04:36:22,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:36:22,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:36:22,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:36:22,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:36:22,804 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-17 04:36:22,804 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:36:22,805 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:36:22,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663398937] [2025-03-17 04:36:22,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663398937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:36:22,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:36:22,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 04:36:22,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462241696] [2025-03-17 04:36:22,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:36:22,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:36:22,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:36:22,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:36:22,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:36:22,827 INFO L87 Difference]: Start difference. First operand has 45 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 04:36:22,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:36:22,841 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2025-03-17 04:36:22,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:36:22,842 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 98 [2025-03-17 04:36:22,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:36:22,846 INFO L225 Difference]: With dead ends: 87 [2025-03-17 04:36:22,846 INFO L226 Difference]: Without dead ends: 43 [2025-03-17 04:36:22,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:36:22,850 INFO L435 NwaCegarLoop]: 64 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, 64 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:36:22,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:36:22,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-17 04:36:22,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-17 04:36:22,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 04:36:22,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2025-03-17 04:36:22,891 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 98 [2025-03-17 04:36:22,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:36:22,891 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2025-03-17 04:36:22,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 04:36:22,892 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2025-03-17 04:36:22,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 04:36:22,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:36:22,894 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:36:22,911 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-17 04:36:23,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 04:36:23,095 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:36:23,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:36:23,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1392804147, now seen corresponding path program 1 times [2025-03-17 04:36:23,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:36:23,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [995209558] [2025-03-17 04:36:23,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:36:23,096 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 04:36:23,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:36:23,098 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 04:36:23,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 04:36:23,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 04:36:23,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 04:36:23,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:36:23,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:36:23,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 04:36:23,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:36:23,518 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-03-17 04:36:23,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:36:23,709 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 04:36:23,711 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:36:23,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [995209558] [2025-03-17 04:36:23,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [995209558] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:36:23,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 04:36:23,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-03-17 04:36:23,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275615883] [2025-03-17 04:36:23,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 04:36:23,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 04:36:23,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:36:23,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 04:36:23,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:36:23,713 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 04:36:24,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:36:24,383 INFO L93 Difference]: Finished difference Result 143 states and 204 transitions. [2025-03-17 04:36:24,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 04:36:24,383 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 98 [2025-03-17 04:36:24,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:36:24,385 INFO L225 Difference]: With dead ends: 143 [2025-03-17 04:36:24,386 INFO L226 Difference]: Without dead ends: 101 [2025-03-17 04:36:24,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2025-03-17 04:36:24,388 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 77 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 04:36:24,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 124 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 04:36:24,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-17 04:36:24,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 48. [2025-03-17 04:36:24,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 04:36:24,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2025-03-17 04:36:24,399 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 98 [2025-03-17 04:36:24,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:36:24,399 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2025-03-17 04:36:24,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 04:36:24,400 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2025-03-17 04:36:24,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 04:36:24,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:36:24,402 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:36:24,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-17 04:36:24,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 04:36:24,602 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:36:24,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:36:24,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1392774356, now seen corresponding path program 1 times [2025-03-17 04:36:24,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:36:24,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2115464] [2025-03-17 04:36:24,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:36:24,603 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 04:36:24,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:36:24,606 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 04:36:24,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 04:36:24,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 04:36:24,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 04:36:24,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:36:24,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:36:24,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 04:36:24,801 INFO L279 TraceCheckSpWp]: Computing forward predicates...