./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-76.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-76.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 cde8d0b7ae63daaf73229c98a276eed51f74faeadb0d74d5645e79b969a982b1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:26:11,785 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:26:11,834 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:26:11,838 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:26:11,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:26:11,859 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:26:11,859 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:26:11,859 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:26:11,860 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:26:11,860 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:26:11,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:26:11,860 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:26:11,860 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:26:11,860 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:26:11,860 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:26:11,860 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:26:11,860 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:26:11,860 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:26:11,860 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:26:11,861 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:26:11,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:26:11,861 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:26:11,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:26:11,862 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:26:11,862 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:26:11,862 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:26:11,862 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:26:11,862 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:26:11,862 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:26:11,862 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:26:11,863 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:26:11,863 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:26:11,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:26:11,863 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:26:11,863 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:26:11,863 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:26:11,863 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:26:11,863 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:26:11,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:26:11,863 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:26:11,863 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:26:11,864 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:26:11,864 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:26:11,864 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 -> cde8d0b7ae63daaf73229c98a276eed51f74faeadb0d74d5645e79b969a982b1 [2025-03-04 00:26:12,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:26:12,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:26:12,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:26:12,063 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:26:12,063 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:26:12,064 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-76.i [2025-03-04 00:26:13,133 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a6158e1b/813f8d2dd7194bf7a5608965e1a8cf6c/FLAGa17d38921 [2025-03-04 00:26:13,364 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:26:13,365 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-76.i [2025-03-04 00:26:13,371 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a6158e1b/813f8d2dd7194bf7a5608965e1a8cf6c/FLAGa17d38921 [2025-03-04 00:26:13,380 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a6158e1b/813f8d2dd7194bf7a5608965e1a8cf6c [2025-03-04 00:26:13,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:26:13,383 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:26:13,384 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:26:13,384 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:26:13,386 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:26:13,387 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:26:13" (1/1) ... [2025-03-04 00:26:13,387 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ece7a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:13, skipping insertion in model container [2025-03-04 00:26:13,388 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:26:13" (1/1) ... [2025-03-04 00:26:13,401 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:26:13,498 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-76.i[915,928] [2025-03-04 00:26:13,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:26:13,547 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:26:13,557 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-76.i[915,928] [2025-03-04 00:26:13,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:26:13,598 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:26:13,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:13 WrapperNode [2025-03-04 00:26:13,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:26:13,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:26:13,600 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:26:13,601 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:26:13,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:13" (1/1) ... [2025-03-04 00:26:13,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:13" (1/1) ... [2025-03-04 00:26:13,631 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2025-03-04 00:26:13,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:26:13,634 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:26:13,634 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:26:13,634 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:26:13,644 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:13" (1/1) ... [2025-03-04 00:26:13,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:13" (1/1) ... [2025-03-04 00:26:13,646 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:13" (1/1) ... [2025-03-04 00:26:13,654 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:26:13,654 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:13" (1/1) ... [2025-03-04 00:26:13,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:13" (1/1) ... [2025-03-04 00:26:13,657 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:13" (1/1) ... [2025-03-04 00:26:13,658 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:13" (1/1) ... [2025-03-04 00:26:13,658 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:13" (1/1) ... [2025-03-04 00:26:13,659 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:13" (1/1) ... [2025-03-04 00:26:13,662 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:26:13,662 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:26:13,663 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:26:13,663 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:26:13,663 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:13" (1/1) ... [2025-03-04 00:26:13,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:26:13,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:26:13,690 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:26:13,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:26:13,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:26:13,706 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:26:13,706 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:26:13,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:26:13,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:26:13,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:26:13,752 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:26:13,753 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:26:13,903 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-04 00:26:13,903 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:26:13,910 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:26:13,910 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:26:13,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:26:13 BoogieIcfgContainer [2025-03-04 00:26:13,911 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:26:13,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:26:13,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:26:13,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:26:13,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:26:13" (1/3) ... [2025-03-04 00:26:13,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64695188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:26:13, skipping insertion in model container [2025-03-04 00:26:13,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:13" (2/3) ... [2025-03-04 00:26:13,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64695188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:26:13, skipping insertion in model container [2025-03-04 00:26:13,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:26:13" (3/3) ... [2025-03-04 00:26:13,918 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-76.i [2025-03-04 00:26:13,927 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:26:13,928 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-76.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:26:13,966 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:26:13,973 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;@5081cfd3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:26:13,973 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:26:13,979 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 00:26:13,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 00:26:13,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:26:13,984 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:26:13,984 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:26:13,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:26:13,989 INFO L85 PathProgramCache]: Analyzing trace with hash 172922931, now seen corresponding path program 1 times [2025-03-04 00:26:13,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:26:13,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829104555] [2025-03-04 00:26:13,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:26:13,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:26:14,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 00:26:14,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 00:26:14,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:26:14,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:26:14,176 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-04 00:26:14,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:26:14,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829104555] [2025-03-04 00:26:14,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829104555] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:26:14,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408506812] [2025-03-04 00:26:14,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:26:14,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:26:14,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:26:14,180 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:26:14,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:26:14,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 00:26:14,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 00:26:14,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:26:14,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:26:14,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:26:14,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:26:14,306 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-04 00:26:14,306 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:26:14,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408506812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:26:14,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:26:14,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:26:14,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354200624] [2025-03-04 00:26:14,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:26:14,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:26:14,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:26:14,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:26:14,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:26:14,328 INFO L87 Difference]: Start difference. First operand has 39 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 00:26:14,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:26:14,343 INFO L93 Difference]: Finished difference Result 72 states and 113 transitions. [2025-03-04 00:26:14,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:26:14,345 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 69 [2025-03-04 00:26:14,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:26:14,349 INFO L225 Difference]: With dead ends: 72 [2025-03-04 00:26:14,349 INFO L226 Difference]: Without dead ends: 36 [2025-03-04 00:26:14,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:26:14,354 INFO L435 NwaCegarLoop]: 49 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, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:26:14,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:26:14,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-04 00:26:14,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-04 00:26:14,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 00:26:14,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2025-03-04 00:26:14,379 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 69 [2025-03-04 00:26:14,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:26:14,380 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2025-03-04 00:26:14,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 00:26:14,380 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2025-03-04 00:26:14,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 00:26:14,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:26:14,383 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:26:14,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:26:14,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:26:14,585 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:26:14,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:26:14,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1257729525, now seen corresponding path program 1 times [2025-03-04 00:26:14,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:26:14,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125680148] [2025-03-04 00:26:14,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:26:14,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:26:14,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 00:26:14,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 00:26:14,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:26:14,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:26:14,816 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 00:26:14,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:26:14,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125680148] [2025-03-04 00:26:14,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125680148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:26:14,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:26:14,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:26:14,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059911995] [2025-03-04 00:26:14,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:26:14,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:26:14,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:26:14,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:26:14,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:26:14,820 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-04 00:26:14,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:26:14,864 INFO L93 Difference]: Finished difference Result 102 states and 141 transitions. [2025-03-04 00:26:14,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:26:14,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 69 [2025-03-04 00:26:14,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:26:14,866 INFO L225 Difference]: With dead ends: 102 [2025-03-04 00:26:14,866 INFO L226 Difference]: Without dead ends: 69 [2025-03-04 00:26:14,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:26:14,867 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 25 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:26:14,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 130 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:26:14,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-04 00:26:14,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2025-03-04 00:26:14,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 states have internal predecessors, (53), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 00:26:14,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2025-03-04 00:26:14,881 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 69 [2025-03-04 00:26:14,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:26:14,882 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2025-03-04 00:26:14,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-04 00:26:14,882 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2025-03-04 00:26:14,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 00:26:14,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:26:14,883 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:26:14,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:26:14,883 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:26:14,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:26:14,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1286358676, now seen corresponding path program 1 times [2025-03-04 00:26:14,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:26:14,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159813359] [2025-03-04 00:26:14,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:26:14,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:26:14,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 00:26:14,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 00:26:14,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:26:14,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:26:14,958 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:26:14,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 00:26:15,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 00:26:15,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:26:15,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:26:15,034 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:26:15,034 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:26:15,035 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:26:15,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:26:15,038 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-04 00:26:15,082 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:26:15,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:26:15 BoogieIcfgContainer [2025-03-04 00:26:15,085 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:26:15,085 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:26:15,085 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:26:15,085 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:26:15,086 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:26:13" (3/4) ... [2025-03-04 00:26:15,087 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:26:15,088 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:26:15,088 INFO L158 Benchmark]: Toolchain (without parser) took 1705.44ms. Allocated memory is still 201.3MB. Free memory was 159.1MB in the beginning and 148.2MB in the end (delta: 10.9MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2025-03-04 00:26:15,088 INFO L158 Benchmark]: CDTParser took 0.88ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:26:15,089 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.90ms. Allocated memory is still 201.3MB. Free memory was 158.8MB in the beginning and 146.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:26:15,089 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.77ms. Allocated memory is still 201.3MB. Free memory was 146.3MB in the beginning and 144.4MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:26:15,089 INFO L158 Benchmark]: Boogie Preprocessor took 27.71ms. Allocated memory is still 201.3MB. Free memory was 144.4MB in the beginning and 142.0MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:26:15,089 INFO L158 Benchmark]: IcfgBuilder took 248.34ms. Allocated memory is still 201.3MB. Free memory was 142.0MB in the beginning and 126.8MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:26:15,090 INFO L158 Benchmark]: TraceAbstraction took 1172.31ms. Allocated memory is still 201.3MB. Free memory was 126.2MB in the beginning and 148.2MB in the end (delta: -22.0MB). Peak memory consumption was 81.2MB. Max. memory is 16.1GB. [2025-03-04 00:26:15,090 INFO L158 Benchmark]: Witness Printer took 2.71ms. Allocated memory is still 201.3MB. Free memory was 148.2MB in the beginning and 148.2MB in the end (delta: 39.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:26:15,091 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.88ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.90ms. Allocated memory is still 201.3MB. Free memory was 158.8MB in the beginning and 146.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.77ms. Allocated memory is still 201.3MB. Free memory was 146.3MB in the beginning and 144.4MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.71ms. Allocated memory is still 201.3MB. Free memory was 144.4MB in the beginning and 142.0MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 248.34ms. Allocated memory is still 201.3MB. Free memory was 142.0MB in the beginning and 126.8MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1172.31ms. Allocated memory is still 201.3MB. Free memory was 126.2MB in the beginning and 148.2MB in the end (delta: -22.0MB). Peak memory consumption was 81.2MB. Max. memory is 16.1GB. * Witness Printer took 2.71ms. Allocated memory is still 201.3MB. Free memory was 148.2MB in the beginning and 148.2MB in the end (delta: 39.1kB). Peak memory consumption was 8.4MB. 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 82, overapproximation of someBinaryFLOATComparisonOperation at line 70, overapproximation of someBinaryFLOATComparisonOperation at line 72, overapproximation of someBinaryFLOATComparisonOperation at line 53. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_5 = 0; [L24] unsigned char var_1_6 = 0; [L25] unsigned char var_1_7 = 0; [L26] signed short int var_1_8 = 4; [L27] float var_1_10 = 16.4; [L28] signed short int var_1_11 = -25; [L29] float var_1_13 = 128.1; [L30] float var_1_14 = 31.4; [L31] unsigned char var_1_15 = 2; [L32] unsigned char var_1_16 = 0; [L33] signed long int var_1_17 = 5; [L34] float last_1_var_1_13 = 128.1; [L35] signed long int last_1_var_1_17 = 5; VAL [isInitial=0, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L86] isInitial = 1 [L87] FCALL initially() [L88] COND TRUE 1 [L89] CALL updateLastVariables() [L78] last_1_var_1_13 = var_1_13 [L79] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L89] RET updateLastVariables() [L90] CALL updateVariables() [L60] var_1_5 = __VERIFIER_nondet_uchar() [L61] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=4] [L61] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=4] [L62] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L62] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L63] var_1_6 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_7=0, var_1_8=4] [L64] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_7=0, var_1_8=4] [L65] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L65] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L66] var_1_7 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_8=4] [L67] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_8=4] [L68] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L68] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L69] var_1_10 = __VERIFIER_nondet_float() [L70] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L70] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L71] var_1_14 = __VERIFIER_nondet_float() [L72] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L72] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L73] var_1_16 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L74] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L75] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_16=254, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_16=254, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L75] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_16=254, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L90] RET updateVariables() [L91] CALL step() [L39] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_16=254, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L44] var_1_17 = var_1_8 [L45] var_1_13 = var_1_14 [L46] var_1_15 = var_1_16 [L47] signed long int stepLocal_0 = (- 5) + var_1_17; VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, stepLocal_0=-1, var_1_11=-25, var_1_13=259, var_1_14=259, var_1_15=254, var_1_16=254, var_1_17=4, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L48] COND FALSE !(stepLocal_0 >= var_1_15) [L51] var_1_1 = ((var_1_5 && var_1_6) || var_1_7) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=259, var_1_14=259, var_1_15=254, var_1_16=254, var_1_17=4, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L53] COND TRUE var_1_10 >= 500.875f [L54] var_1_11 = ((((((((((((-50) < 0 ) ? -(-50) : (-50)))) > (var_1_8)) ? (((((-50) < 0 ) ? -(-50) : (-50)))) : (var_1_8)))) < (var_1_15)) ? (((((((((-50) < 0 ) ? -(-50) : (-50)))) > (var_1_8)) ? (((((-50) < 0 ) ? -(-50) : (-50)))) : (var_1_8)))) : (var_1_15))) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=50, var_1_13=259, var_1_14=259, var_1_15=254, var_1_16=254, var_1_17=4, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L91] RET step() [L92] CALL, EXPR property() [L82-L83] return ((((((((- 5) + var_1_17) >= var_1_15) ? (var_1_1 == ((unsigned char) (! var_1_5))) : (var_1_1 == ((unsigned char) ((var_1_5 && var_1_6) || var_1_7)))) && (var_1_5 ? ((0.4f > ((((last_1_var_1_13) < ((var_1_10 - 1.375f))) ? (last_1_var_1_13) : ((var_1_10 - 1.375f))))) ? (var_1_8 == ((signed short int) last_1_var_1_17)) : 1) : 1)) && ((var_1_10 >= 500.875f) ? (var_1_11 == ((signed short int) ((((((((((((-50) < 0 ) ? -(-50) : (-50)))) > (var_1_8)) ? (((((-50) < 0 ) ? -(-50) : (-50)))) : (var_1_8)))) < (var_1_15)) ? (((((((((-50) < 0 ) ? -(-50) : (-50)))) > (var_1_8)) ? (((((-50) < 0 ) ? -(-50) : (-50)))) : (var_1_8)))) : (var_1_15))))) : (var_1_11 == ((signed short int) var_1_15)))) && (var_1_13 == ((float) var_1_14))) && (var_1_15 == ((unsigned char) var_1_16))) && (var_1_17 == ((signed long int) var_1_8)) ; VAL [\result=0, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=50, var_1_13=259, var_1_14=259, var_1_15=254, var_1_16=254, var_1_17=4, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L92] RET, EXPR property() [L92] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=50, var_1_13=259, var_1_14=259, var_1_15=254, var_1_16=254, var_1_17=4, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=50, var_1_13=259, var_1_14=259, var_1_15=254, var_1_16=254, var_1_17=4, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 179 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 85 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14 IncrementalHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 94 mSDtfsCounter, 14 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=2, InterpolantAutomatonStates: 6, 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 252 SizeOfPredicates, 0 NumberOfNonLiveVariables, 184 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 522/540 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 00:26:15,103 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-76.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 cde8d0b7ae63daaf73229c98a276eed51f74faeadb0d74d5645e79b969a982b1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:26:16,807 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:26:16,888 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:26:16,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:26:16,895 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:26:16,916 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:26:16,916 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:26:16,916 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:26:16,917 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:26:16,917 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:26:16,918 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:26:16,918 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:26:16,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:26:16,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:26:16,919 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:26:16,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:26:16,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:26:16,920 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:26:16,920 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:26:16,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:26:16,920 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:26:16,920 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:26:16,920 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:26:16,920 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:26:16,920 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:26:16,921 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:26:16,921 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:26:16,921 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:26:16,921 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:26:16,921 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:26:16,921 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:26:16,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:26:16,922 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:26:16,922 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:26:16,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:26:16,922 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:26:16,922 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:26:16,922 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:26:16,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:26:16,922 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:26:16,922 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:26:16,922 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:26:16,922 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:26:16,922 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:26:16,922 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:26:16,922 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 -> cde8d0b7ae63daaf73229c98a276eed51f74faeadb0d74d5645e79b969a982b1 [2025-03-04 00:26:17,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:26:17,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:26:17,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:26:17,157 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:26:17,157 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:26:17,160 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-76.i [2025-03-04 00:26:18,280 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8125d101b/68a1e394aa0044acaa63afdb2da8eaf1/FLAGaea1cbb12 [2025-03-04 00:26:18,497 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:26:18,498 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-76.i [2025-03-04 00:26:18,505 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8125d101b/68a1e394aa0044acaa63afdb2da8eaf1/FLAGaea1cbb12 [2025-03-04 00:26:18,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8125d101b/68a1e394aa0044acaa63afdb2da8eaf1 [2025-03-04 00:26:18,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:26:18,523 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:26:18,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:26:18,525 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:26:18,528 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:26:18,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:26:18" (1/1) ... [2025-03-04 00:26:18,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d75a94b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:18, skipping insertion in model container [2025-03-04 00:26:18,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:26:18" (1/1) ... [2025-03-04 00:26:18,544 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:26:18,636 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-76.i[915,928] [2025-03-04 00:26:18,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:26:18,681 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:26:18,688 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-76.i[915,928] [2025-03-04 00:26:18,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:26:18,718 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:26:18,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:18 WrapperNode [2025-03-04 00:26:18,719 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:26:18,720 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:26:18,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:26:18,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:26:18,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:18" (1/1) ... [2025-03-04 00:26:18,730 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:18" (1/1) ... [2025-03-04 00:26:18,742 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2025-03-04 00:26:18,743 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:26:18,743 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:26:18,743 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:26:18,743 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:26:18,748 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:18" (1/1) ... [2025-03-04 00:26:18,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:18" (1/1) ... [2025-03-04 00:26:18,751 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:18" (1/1) ... [2025-03-04 00:26:18,769 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:26:18,769 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:18" (1/1) ... [2025-03-04 00:26:18,769 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:18" (1/1) ... [2025-03-04 00:26:18,776 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:18" (1/1) ... [2025-03-04 00:26:18,777 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:18" (1/1) ... [2025-03-04 00:26:18,782 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:18" (1/1) ... [2025-03-04 00:26:18,782 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:18" (1/1) ... [2025-03-04 00:26:18,784 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:26:18,784 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:26:18,784 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:26:18,785 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:26:18,785 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:18" (1/1) ... [2025-03-04 00:26:18,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:26:18,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:26:18,818 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:26:18,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:26:18,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:26:18,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:26:18,842 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:26:18,842 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:26:18,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:26:18,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:26:18,896 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:26:18,897 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:26:19,228 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-04 00:26:19,229 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:26:19,236 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:26:19,236 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:26:19,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:26:19 BoogieIcfgContainer [2025-03-04 00:26:19,236 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:26:19,238 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:26:19,238 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:26:19,241 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:26:19,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:26:18" (1/3) ... [2025-03-04 00:26:19,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d5f4ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:26:19, skipping insertion in model container [2025-03-04 00:26:19,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:18" (2/3) ... [2025-03-04 00:26:19,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d5f4ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:26:19, skipping insertion in model container [2025-03-04 00:26:19,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:26:19" (3/3) ... [2025-03-04 00:26:19,242 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-76.i [2025-03-04 00:26:19,252 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:26:19,252 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-76.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:26:19,284 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:26:19,291 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;@237afda4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:26:19,292 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:26:19,295 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 00:26:19,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 00:26:19,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:26:19,300 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:26:19,301 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:26:19,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:26:19,305 INFO L85 PathProgramCache]: Analyzing trace with hash 172922931, now seen corresponding path program 1 times [2025-03-04 00:26:19,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:26:19,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499870696] [2025-03-04 00:26:19,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:26:19,314 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:26:19,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:26:19,317 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:26:19,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 00:26:19,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 00:26:19,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 00:26:19,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:26:19,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:26:19,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:26:19,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:26:19,514 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-04 00:26:19,514 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:26:19,514 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:26:19,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499870696] [2025-03-04 00:26:19,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499870696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:26:19,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:26:19,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:26:19,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476197636] [2025-03-04 00:26:19,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:26:19,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:26:19,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:26:19,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:26:19,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:26:19,535 INFO L87 Difference]: Start difference. First operand has 39 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 00:26:19,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:26:19,550 INFO L93 Difference]: Finished difference Result 72 states and 113 transitions. [2025-03-04 00:26:19,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:26:19,553 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 69 [2025-03-04 00:26:19,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:26:19,558 INFO L225 Difference]: With dead ends: 72 [2025-03-04 00:26:19,558 INFO L226 Difference]: Without dead ends: 36 [2025-03-04 00:26:19,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:26:19,563 INFO L435 NwaCegarLoop]: 49 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, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:26:19,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:26:19,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-04 00:26:19,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-04 00:26:19,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 00:26:19,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2025-03-04 00:26:19,594 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 69 [2025-03-04 00:26:19,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:26:19,594 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2025-03-04 00:26:19,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 00:26:19,595 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2025-03-04 00:26:19,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 00:26:19,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:26:19,597 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:26:19,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 00:26:19,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:26:19,798 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:26:19,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:26:19,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1257729525, now seen corresponding path program 1 times [2025-03-04 00:26:19,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:26:19,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136521016] [2025-03-04 00:26:19,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:26:19,799 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:26:19,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:26:19,801 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:26:19,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 00:26:19,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 00:26:19,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 00:26:19,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:26:19,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:26:19,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 00:26:19,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:26:20,139 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 00:26:20,140 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:26:20,140 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:26:20,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [136521016] [2025-03-04 00:26:20,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [136521016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:26:20,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:26:20,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:26:20,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298351457] [2025-03-04 00:26:20,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:26:20,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:26:20,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:26:20,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:26:20,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:26:20,142 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-04 00:26:20,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:26:20,277 INFO L93 Difference]: Finished difference Result 102 states and 141 transitions. [2025-03-04 00:26:20,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:26:20,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 69 [2025-03-04 00:26:20,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:26:20,282 INFO L225 Difference]: With dead ends: 102 [2025-03-04 00:26:20,282 INFO L226 Difference]: Without dead ends: 69 [2025-03-04 00:26:20,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:26:20,283 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 12 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:26:20,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 130 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:26:20,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-04 00:26:20,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2025-03-04 00:26:20,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 states have internal predecessors, (53), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 00:26:20,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2025-03-04 00:26:20,293 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 69 [2025-03-04 00:26:20,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:26:20,293 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2025-03-04 00:26:20,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-04 00:26:20,293 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2025-03-04 00:26:20,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 00:26:20,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:26:20,294 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:26:20,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 00:26:20,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:26:20,495 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:26:20,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:26:20,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1286358676, now seen corresponding path program 1 times [2025-03-04 00:26:20,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:26:20,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269279908] [2025-03-04 00:26:20,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:26:20,496 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:26:20,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:26:20,499 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:26:20,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 00:26:20,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 00:26:20,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 00:26:20,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:26:20,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:26:20,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 00:26:20,664 INFO L279 TraceCheckSpWp]: Computing forward predicates...