./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 02ce82ba0ace3f5b040163bfedd713ab4e5a143077898ba922a6491fc85c9af7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:08:26,257 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:08:26,315 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:08:26,320 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:08:26,320 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:08:26,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:08:26,342 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:08:26,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:08:26,343 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:08:26,343 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:08:26,343 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:08:26,344 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:08:26,344 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:08:26,344 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:08:26,344 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:08:26,344 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:08:26,345 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:08:26,345 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:08:26,345 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:08:26,345 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:08:26,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:08:26,345 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:08:26,345 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:08:26,345 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:08:26,345 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:08:26,345 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:08:26,345 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:08:26,345 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:08:26,345 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:08:26,346 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:08:26,346 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:08:26,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:08:26,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:08:26,346 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:08:26,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:08:26,346 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:08:26,346 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:08:26,347 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:08:26,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:08:26,347 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:08:26,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:08:26,347 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:08:26,347 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:08:26,347 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-jdk21/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 -> 02ce82ba0ace3f5b040163bfedd713ab4e5a143077898ba922a6491fc85c9af7 [2025-02-06 02:08:26,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:08:26,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:08:26,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:08:26,611 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:08:26,611 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:08:26,612 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-1.i [2025-02-06 02:08:27,827 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56e395cfb/50d6badc35174fb9be4f39f7590e95a6/FLAG503eba169 [2025-02-06 02:08:28,119 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:08:28,121 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-1.i [2025-02-06 02:08:28,129 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56e395cfb/50d6badc35174fb9be4f39f7590e95a6/FLAG503eba169 [2025-02-06 02:08:28,427 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56e395cfb/50d6badc35174fb9be4f39f7590e95a6 [2025-02-06 02:08:28,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:08:28,430 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:08:28,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:08:28,431 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:08:28,434 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:08:28,434 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:08:28" (1/1) ... [2025-02-06 02:08:28,435 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67996eec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:08:28, skipping insertion in model container [2025-02-06 02:08:28,435 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:08:28" (1/1) ... [2025-02-06 02:08:28,445 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:08:28,545 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-1.i[914,927] [2025-02-06 02:08:28,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:08:28,571 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:08:28,578 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-1.i[914,927] [2025-02-06 02:08:28,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:08:28,595 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:08:28,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:08:28 WrapperNode [2025-02-06 02:08:28,596 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:08:28,597 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:08:28,597 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:08:28,597 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:08:28,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:08:28" (1/1) ... [2025-02-06 02:08:28,605 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:08:28" (1/1) ... [2025-02-06 02:08:28,617 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 75 [2025-02-06 02:08:28,617 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:08:28,618 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:08:28,618 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:08:28,618 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:08:28,623 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:08:28" (1/1) ... [2025-02-06 02:08:28,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:08:28" (1/1) ... [2025-02-06 02:08:28,627 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:08:28" (1/1) ... [2025-02-06 02:08:28,635 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-02-06 02:08:28,636 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:08:28" (1/1) ... [2025-02-06 02:08:28,636 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:08:28" (1/1) ... [2025-02-06 02:08:28,639 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:08:28" (1/1) ... [2025-02-06 02:08:28,639 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:08:28" (1/1) ... [2025-02-06 02:08:28,640 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:08:28" (1/1) ... [2025-02-06 02:08:28,640 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:08:28" (1/1) ... [2025-02-06 02:08:28,641 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:08:28,642 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:08:28,642 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:08:28,642 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:08:28,643 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:08:28" (1/1) ... [2025-02-06 02:08:28,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:08:28,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:08:28,670 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:08:28,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:08:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:08:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:08:28,691 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:08:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:08:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:08:28,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:08:28,735 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:08:28,737 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:08:28,843 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-06 02:08:28,844 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:08:28,850 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:08:28,850 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:08:28,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:08:28 BoogieIcfgContainer [2025-02-06 02:08:28,850 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:08:28,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:08:28,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:08:28,855 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:08:28,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:08:28" (1/3) ... [2025-02-06 02:08:28,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c64aff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:08:28, skipping insertion in model container [2025-02-06 02:08:28,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:08:28" (2/3) ... [2025-02-06 02:08:28,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c64aff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:08:28, skipping insertion in model container [2025-02-06 02:08:28,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:08:28" (3/3) ... [2025-02-06 02:08:28,857 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-1.i [2025-02-06 02:08:28,866 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:08:28,868 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-1.i that has 2 procedures, 35 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:08:28,910 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:08:28,920 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;@37d5b62b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:08:28,920 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:08:28,925 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 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-02-06 02:08:28,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 02:08:28,930 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:08:28,930 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] [2025-02-06 02:08:28,932 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:08:28,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:08:28,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1802767730, now seen corresponding path program 1 times [2025-02-06 02:08:28,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:08:28,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421367326] [2025-02-06 02:08:28,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:08:28,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:08:29,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 02:08:29,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 02:08:29,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:08:29,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:08:29,127 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-02-06 02:08:29,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:08:29,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421367326] [2025-02-06 02:08:29,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421367326] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:08:29,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251432109] [2025-02-06 02:08:29,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:08:29,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:08:29,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:08:29,131 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:08:29,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 02:08:29,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 02:08:29,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 02:08:29,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:08:29,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:08:29,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:08:29,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:08:29,226 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-02-06 02:08:29,227 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:08:29,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251432109] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:08:29,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:08:29,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:08:29,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139874912] [2025-02-06 02:08:29,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:08:29,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:08:29,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:08:29,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:08:29,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:08:29,245 INFO L87 Difference]: Start difference. First operand has 35 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 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 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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-02-06 02:08:29,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:08:29,257 INFO L93 Difference]: Finished difference Result 64 states and 99 transitions. [2025-02-06 02:08:29,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:08:29,259 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (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 66 [2025-02-06 02:08:29,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:08:29,263 INFO L225 Difference]: With dead ends: 64 [2025-02-06 02:08:29,263 INFO L226 Difference]: Without dead ends: 32 [2025-02-06 02:08:29,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 67 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-02-06 02:08:29,267 INFO L435 NwaCegarLoop]: 42 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, 42 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-02-06 02:08:29,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:08:29,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-06 02:08:29,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-02-06 02:08:29,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 02:08:29,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2025-02-06 02:08:29,291 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 66 [2025-02-06 02:08:29,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:08:29,292 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2025-02-06 02:08:29,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (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-02-06 02:08:29,292 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2025-02-06 02:08:29,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 02:08:29,294 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:08:29,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] [2025-02-06 02:08:29,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 02:08:29,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 02:08:29,495 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:08:29,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:08:29,496 INFO L85 PathProgramCache]: Analyzing trace with hash 444082384, now seen corresponding path program 1 times [2025-02-06 02:08:29,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:08:29,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467655329] [2025-02-06 02:08:29,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:08:29,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:08:29,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 02:08:29,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 02:08:29,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:08:29,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 02:08:29,551 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 02:08:29,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 02:08:29,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 02:08:29,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:08:29,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 02:08:29,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 02:08:29,614 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 02:08:29,615 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 02:08:29,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:08:29,618 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 02:08:29,645 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 02:08:29,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:08:29 BoogieIcfgContainer [2025-02-06 02:08:29,648 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 02:08:29,649 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 02:08:29,649 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 02:08:29,649 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 02:08:29,649 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:08:28" (3/4) ... [2025-02-06 02:08:29,651 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 02:08:29,652 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 02:08:29,652 INFO L158 Benchmark]: Toolchain (without parser) took 1222.80ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 41.1MB in the end (delta: 72.4MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-02-06 02:08:29,653 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:08:29,653 INFO L158 Benchmark]: CACSL2BoogieTranslator took 165.62ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 101.5MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:08:29,653 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.51ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 100.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:08:29,653 INFO L158 Benchmark]: Boogie Preprocessor took 23.91ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 99.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:08:29,653 INFO L158 Benchmark]: IcfgBuilder took 208.58ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 86.1MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 02:08:29,654 INFO L158 Benchmark]: TraceAbstraction took 796.29ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 41.5MB in the end (delta: 43.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-06 02:08:29,654 INFO L158 Benchmark]: Witness Printer took 3.21ms. Allocated memory is still 142.6MB. Free memory is still 41.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:08:29,655 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.27ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 165.62ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 101.5MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.51ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 100.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.91ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 99.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 208.58ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 86.1MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 796.29ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 41.5MB in the end (delta: 43.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 3.21ms. Allocated memory is still 142.6MB. Free memory is still 41.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 38, overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 46, overapproximation of someBinaryFLOATComparisonOperation at line 44, overapproximation of someUnaryFLOAToperation at line 39. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 9.8; [L23] float var_1_2 = 10.375; [L24] float var_1_4 = 256.2; [L25] unsigned long int var_1_5 = 8; [L26] unsigned long int var_1_6 = 3674304896; [L27] unsigned long int var_1_7 = 8; [L28] unsigned char var_1_8 = 0; [L29] unsigned char var_1_9 = 0; [L30] signed short int var_1_10 = -25; [L31] signed short int var_1_11 = -5; VAL [isInitial=0, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_2=83/8, var_1_4=1281/5, var_1_5=8, var_1_6=3674304896, var_1_7=8, var_1_8=0, var_1_9=0] [L67] isInitial = 1 [L68] FCALL initially() [L69] COND TRUE 1 [L70] FCALL updateLastVariables() [L71] CALL updateVariables() [L43] var_1_2 = __VERIFIER_nondet_float() [L44] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_4=1281/5, var_1_5=8, var_1_6=3674304896, var_1_7=8, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_4=1281/5, var_1_5=8, var_1_6=3674304896, var_1_7=8, var_1_8=0, var_1_9=0] [L44] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_4=1281/5, var_1_5=8, var_1_6=3674304896, var_1_7=8, var_1_8=0, var_1_9=0] [L45] var_1_4 = __VERIFIER_nondet_float() [L46] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=3674304896, var_1_7=8, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=3674304896, var_1_7=8, var_1_8=0, var_1_9=0] [L46] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=3674304896, var_1_7=8, var_1_8=0, var_1_9=0] [L47] var_1_6 = __VERIFIER_nondet_ulong() [L48] CALL assume_abort_if_not(var_1_6 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=8, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=8, var_1_8=0, var_1_9=0] [L48] RET assume_abort_if_not(var_1_6 >= 2147483647) VAL [isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=8, var_1_8=0, var_1_9=0] [L49] CALL assume_abort_if_not(var_1_6 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=8, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=8, var_1_8=0, var_1_9=0] [L49] RET assume_abort_if_not(var_1_6 <= 4294967294) VAL [isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=8, var_1_8=0, var_1_9=0] [L50] var_1_7 = __VERIFIER_nondet_ulong() [L51] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_8=0, var_1_9=0] [L51] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_8=0, var_1_9=0] [L52] CALL assume_abort_if_not(var_1_7 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=2147483147, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=2147483147, var_1_8=0, var_1_9=0] [L52] RET assume_abort_if_not(var_1_7 <= 4294967294) VAL [isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=2147483147, var_1_8=0, var_1_9=0] [L53] var_1_9 = __VERIFIER_nondet_uchar() [L54] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=2147483147, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=2147483147, var_1_8=0] [L54] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=2147483147, var_1_8=0] [L55] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=2147483147, var_1_8=0, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=2147483147, var_1_8=0, var_1_9=-256] [L55] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=2147483147, var_1_8=0, var_1_9=-256] [L56] var_1_11 = __VERIFIER_nondet_short() [L57] CALL assume_abort_if_not(var_1_11 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=32766, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=2147483147, var_1_8=0, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=32766, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=2147483147, var_1_8=0, var_1_9=-256] [L57] RET assume_abort_if_not(var_1_11 >= -32767) VAL [isInitial=1, var_1_10=-25, var_1_11=32766, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=2147483147, var_1_8=0, var_1_9=-256] [L58] CALL assume_abort_if_not(var_1_11 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=32766, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=2147483147, var_1_8=0, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=32766, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=2147483147, var_1_8=0, var_1_9=-256] [L58] RET assume_abort_if_not(var_1_11 <= 32766) VAL [isInitial=1, var_1_10=-25, var_1_11=32766, var_1_1=49/5, var_1_5=8, var_1_6=2147483647, var_1_7=2147483147, var_1_8=0, var_1_9=-256] [L71] RET updateVariables() [L72] CALL step() [L35] var_1_5 = (((((var_1_6 - 500u)) < (var_1_7)) ? ((var_1_6 - 500u)) : (var_1_7))) [L36] var_1_8 = var_1_9 [L37] var_1_10 = var_1_11 VAL [isInitial=1, var_1_10=32766, var_1_11=32766, var_1_1=49/5, var_1_5=2147483147, var_1_6=2147483647, var_1_7=2147483147, var_1_8=-256, var_1_9=-256] [L38] COND TRUE (var_1_2 <= 8.75f) || var_1_8 [L39] var_1_1 = ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) VAL [isInitial=1, var_1_10=32766, var_1_11=32766, var_1_1=3674304901, var_1_4=3674304901, var_1_5=2147483147, var_1_6=2147483647, var_1_7=2147483147, var_1_8=-256, var_1_9=-256] [L72] RET step() [L73] CALL, EXPR property() [L63-L64] return (((((var_1_2 <= 8.75f) || var_1_8) ? (var_1_1 == ((float) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : 1) && (var_1_5 == ((unsigned long int) (((((var_1_6 - 500u)) < (var_1_7)) ? ((var_1_6 - 500u)) : (var_1_7)))))) && (var_1_8 == ((unsigned char) var_1_9))) && (var_1_10 == ((signed short int) var_1_11)) ; VAL [\result=0, isInitial=1, var_1_10=32766, var_1_11=32766, var_1_1=3674304901, var_1_4=3674304901, var_1_5=2147483147, var_1_6=2147483647, var_1_7=2147483147, var_1_8=-256, var_1_9=-256] [L73] RET, EXPR property() [L73] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=32766, var_1_11=32766, var_1_1=3674304901, var_1_4=3674304901, var_1_5=2147483147, var_1_6=2147483647, var_1_7=2147483147, var_1_8=-256, var_1_9=-256] [L19] reach_error() VAL [isInitial=1, var_1_10=32766, var_1_11=32766, var_1_1=3674304901, var_1_4=3674304901, var_1_5=2147483147, var_1_6=2147483647, var_1_7=2147483147, var_1_8=-256, var_1_9=-256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 42 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 130 SizeOfPredicates, 0 NumberOfNonLiveVariables, 166 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 342/360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 02:08:29,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 02ce82ba0ace3f5b040163bfedd713ab4e5a143077898ba922a6491fc85c9af7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:08:31,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:08:31,873 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 02:08:31,878 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:08:31,879 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:08:31,906 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:08:31,907 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:08:31,907 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:08:31,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:08:31,907 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:08:31,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:08:31,908 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:08:31,909 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:08:31,909 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:08:31,909 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:08:31,909 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:08:31,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:08:31,909 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:08:31,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:08:31,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:08:31,909 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:08:31,909 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:08:31,909 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:08:31,909 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 02:08:31,909 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 02:08:31,909 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 02:08:31,910 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:08:31,910 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:08:31,910 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:08:31,910 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:08:31,910 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:08:31,910 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:08:31,910 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:08:31,910 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:08:31,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:08:31,910 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:08:31,910 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:08:31,910 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:08:31,910 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:08:31,910 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 02:08:31,910 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 02:08:31,910 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:08:31,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:08:31,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:08:31,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:08:31,910 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-jdk21/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 -> 02ce82ba0ace3f5b040163bfedd713ab4e5a143077898ba922a6491fc85c9af7 [2025-02-06 02:08:32,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:08:32,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:08:32,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:08:32,180 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:08:32,180 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:08:32,181 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-1.i [2025-02-06 02:08:33,373 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b7b94a682/e662a1c9cffb4f3daa0f914524921f89/FLAG095c41d9c [2025-02-06 02:08:33,610 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:08:33,611 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-1.i [2025-02-06 02:08:33,619 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b7b94a682/e662a1c9cffb4f3daa0f914524921f89/FLAG095c41d9c [2025-02-06 02:08:33,946 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b7b94a682/e662a1c9cffb4f3daa0f914524921f89 [2025-02-06 02:08:33,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:08:33,949 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:08:33,950 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:08:33,950 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:08:33,953 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:08:33,954 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:08:33" (1/1) ... [2025-02-06 02:08:33,954 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f593fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:08:33, skipping insertion in model container [2025-02-06 02:08:33,954 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:08:33" (1/1) ... [2025-02-06 02:08:33,966 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:08:34,065 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-1.i[914,927] [2025-02-06 02:08:34,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:08:34,096 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:08:34,104 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-1.i[914,927] [2025-02-06 02:08:34,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:08:34,132 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:08:34,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:08:34 WrapperNode [2025-02-06 02:08:34,134 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:08:34,135 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:08:34,135 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:08:34,136 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:08:34,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:08:34" (1/1) ... [2025-02-06 02:08:34,147 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:08:34" (1/1) ... [2025-02-06 02:08:34,159 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 74 [2025-02-06 02:08:34,159 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:08:34,160 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:08:34,160 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:08:34,160 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:08:34,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:08:34" (1/1) ... [2025-02-06 02:08:34,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:08:34" (1/1) ... [2025-02-06 02:08:34,168 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:08:34" (1/1) ... [2025-02-06 02:08:34,180 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-02-06 02:08:34,180 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:08:34" (1/1) ... [2025-02-06 02:08:34,180 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:08:34" (1/1) ... [2025-02-06 02:08:34,184 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:08:34" (1/1) ... [2025-02-06 02:08:34,185 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:08:34" (1/1) ... [2025-02-06 02:08:34,186 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:08:34" (1/1) ... [2025-02-06 02:08:34,186 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:08:34" (1/1) ... [2025-02-06 02:08:34,188 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:08:34,189 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:08:34,189 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:08:34,189 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:08:34,189 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:08:34" (1/1) ... [2025-02-06 02:08:34,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:08:34,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:08:34,220 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:08:34,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:08:34,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:08:34,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 02:08:34,246 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:08:34,246 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:08:34,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:08:34,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:08:34,304 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:08:34,306 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:08:34,436 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-06 02:08:34,436 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:08:34,442 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:08:34,443 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:08:34,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:08:34 BoogieIcfgContainer [2025-02-06 02:08:34,443 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:08:34,445 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:08:34,446 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:08:34,449 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:08:34,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:08:33" (1/3) ... [2025-02-06 02:08:34,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ee1325c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:08:34, skipping insertion in model container [2025-02-06 02:08:34,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:08:34" (2/3) ... [2025-02-06 02:08:34,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ee1325c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:08:34, skipping insertion in model container [2025-02-06 02:08:34,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:08:34" (3/3) ... [2025-02-06 02:08:34,452 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-1.i [2025-02-06 02:08:34,463 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:08:34,465 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-1.i that has 2 procedures, 35 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:08:34,508 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:08:34,516 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;@37917489, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:08:34,516 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:08:34,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 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-02-06 02:08:34,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 02:08:34,525 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:08:34,526 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] [2025-02-06 02:08:34,526 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:08:34,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:08:34,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1802767730, now seen corresponding path program 1 times [2025-02-06 02:08:34,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:08:34,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [488274913] [2025-02-06 02:08:34,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:08:34,541 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-02-06 02:08:34,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:08:34,546 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-02-06 02:08:34,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 02:08:34,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 02:08:34,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 02:08:34,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:08:34,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:08:34,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:08:34,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:08:34,712 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-02-06 02:08:34,712 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:08:34,713 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:08:34,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [488274913] [2025-02-06 02:08:34,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [488274913] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:08:34,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:08:34,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 02:08:34,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436513292] [2025-02-06 02:08:34,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:08:34,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:08:34,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:08:34,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:08:34,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:08:34,731 INFO L87 Difference]: Start difference. First operand has 35 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 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 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-06 02:08:34,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:08:34,743 INFO L93 Difference]: Finished difference Result 64 states and 99 transitions. [2025-02-06 02:08:34,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:08:34,744 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 66 [2025-02-06 02:08:34,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:08:34,748 INFO L225 Difference]: With dead ends: 64 [2025-02-06 02:08:34,748 INFO L226 Difference]: Without dead ends: 32 [2025-02-06 02:08:34,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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-02-06 02:08:34,754 INFO L435 NwaCegarLoop]: 42 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, 42 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-02-06 02:08:34,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:08:34,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-06 02:08:34,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-02-06 02:08:34,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 02:08:34,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2025-02-06 02:08:34,784 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 66 [2025-02-06 02:08:34,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:08:34,786 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2025-02-06 02:08:34,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-06 02:08:34,786 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2025-02-06 02:08:34,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 02:08:34,788 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:08:34,788 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] [2025-02-06 02:08:34,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 02:08:34,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-02-06 02:08:34,989 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:08:34,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:08:34,990 INFO L85 PathProgramCache]: Analyzing trace with hash 444082384, now seen corresponding path program 1 times [2025-02-06 02:08:34,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:08:34,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324505172] [2025-02-06 02:08:34,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:08:34,993 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-02-06 02:08:34,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:08:34,995 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-02-06 02:08:34,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 02:08:35,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 02:08:35,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 02:08:35,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:08:35,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:08:35,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 02:08:35,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:08:39,281 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 43 proven. 24 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-02-06 02:08:39,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:08:42,332 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-02-06 02:08:42,332 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:08:42,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324505172] [2025-02-06 02:08:42,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1324505172] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:08:42,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 02:08:42,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2025-02-06 02:08:42,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905790100] [2025-02-06 02:08:42,334 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 02:08:42,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 02:08:42,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:08:42,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 02:08:42,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-02-06 02:08:42,336 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-06 02:08:43,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:08:43,456 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2025-02-06 02:08:43,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 02:08:43,457 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 66 [2025-02-06 02:08:43,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:08:43,458 INFO L225 Difference]: With dead ends: 60 [2025-02-06 02:08:43,458 INFO L226 Difference]: Without dead ends: 58 [2025-02-06 02:08:43,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2025-02-06 02:08:43,459 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 49 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:08:43,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 213 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:08:43,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-06 02:08:43,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2025-02-06 02:08:43,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 32 states have internal predecessors, (33), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 02:08:43,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2025-02-06 02:08:43,466 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 66 [2025-02-06 02:08:43,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:08:43,466 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2025-02-06 02:08:43,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-06 02:08:43,467 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2025-02-06 02:08:43,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 02:08:43,468 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:08:43,468 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] [2025-02-06 02:08:43,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 02:08:43,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-02-06 02:08:43,669 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:08:43,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:08:43,669 INFO L85 PathProgramCache]: Analyzing trace with hash 445005905, now seen corresponding path program 1 times [2025-02-06 02:08:43,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:08:43,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2085706349] [2025-02-06 02:08:43,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:08:43,669 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-02-06 02:08:43,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:08:43,673 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-02-06 02:08:43,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 02:08:43,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 02:08:43,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 02:08:43,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:08:43,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:08:43,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 02:08:43,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:08:45,296 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 79 proven. 6 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-02-06 02:08:45,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:08:46,274 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-02-06 02:08:46,274 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:08:46,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2085706349] [2025-02-06 02:08:46,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2085706349] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:08:46,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 02:08:46,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2025-02-06 02:08:46,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144213516] [2025-02-06 02:08:46,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 02:08:46,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 02:08:46,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:08:46,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 02:08:46,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-02-06 02:08:46,276 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 02:08:46,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:08:46,643 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2025-02-06 02:08:46,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 02:08:46,644 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 66 [2025-02-06 02:08:46,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:08:46,644 INFO L225 Difference]: With dead ends: 64 [2025-02-06 02:08:46,644 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 02:08:46,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2025-02-06 02:08:46,645 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 51 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:08:46,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 165 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:08:46,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 02:08:46,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 02:08:46,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 02:08:46,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 02:08:46,646 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2025-02-06 02:08:46,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:08:46,646 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 02:08:46,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 02:08:46,646 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 02:08:46,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 02:08:46,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 02:08:46,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-06 02:08:46,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/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-02-06 02:08:46,851 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-06 02:08:46,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 02:08:47,814 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 02:08:47,827 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-02-06 02:08:47,828 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-02-06 02:08:47,828 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-02-06 02:08:47,828 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-02-06 02:08:47,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:08:47 BoogieIcfgContainer [2025-02-06 02:08:47,830 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 02:08:47,831 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 02:08:47,833 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 02:08:47,833 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 02:08:47,834 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:08:34" (3/4) ... [2025-02-06 02:08:47,835 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 02:08:47,839 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-06 02:08:47,841 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-02-06 02:08:47,842 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-06 02:08:47,842 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 02:08:47,842 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 02:08:47,899 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 02:08:47,899 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 02:08:47,899 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 02:08:47,901 INFO L158 Benchmark]: Toolchain (without parser) took 13951.14ms. Allocated memory was 117.4MB in the beginning and 604.0MB in the end (delta: 486.5MB). Free memory was 92.3MB in the beginning and 320.5MB in the end (delta: -228.1MB). Peak memory consumption was 257.4MB. Max. memory is 16.1GB. [2025-02-06 02:08:47,902 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory is still 62.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:08:47,902 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.80ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 79.8MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:08:47,904 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.33ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 78.4MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:08:47,904 INFO L158 Benchmark]: Boogie Preprocessor took 28.35ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 76.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:08:47,904 INFO L158 Benchmark]: IcfgBuilder took 254.65ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 64.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:08:47,904 INFO L158 Benchmark]: TraceAbstraction took 13384.47ms. Allocated memory was 117.4MB in the beginning and 604.0MB in the end (delta: 486.5MB). Free memory was 63.6MB in the beginning and 324.8MB in the end (delta: -261.2MB). Peak memory consumption was 232.2MB. Max. memory is 16.1GB. [2025-02-06 02:08:47,904 INFO L158 Benchmark]: Witness Printer took 69.02ms. Allocated memory is still 604.0MB. Free memory was 324.8MB in the beginning and 320.5MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:08:47,905 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.17ms. Allocated memory is still 83.9MB. Free memory is still 62.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.80ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 79.8MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.33ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 78.4MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.35ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 76.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 254.65ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 64.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 13384.47ms. Allocated memory was 117.4MB in the beginning and 604.0MB in the end (delta: 486.5MB). Free memory was 63.6MB in the beginning and 324.8MB in the end (delta: -261.2MB). Peak memory consumption was 232.2MB. Max. memory is 16.1GB. * Witness Printer took 69.02ms. Allocated memory is still 604.0MB. Free memory was 324.8MB in the beginning and 320.5MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.4s, OverallIterations: 3, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 111 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 100 mSDsluCounter, 420 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 310 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 452 IncrementalHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 110 mSDtfsCounter, 452 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 342 GetRequests, 299 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=2, InterpolantAutomatonStates: 33, 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, 3 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 325 ConstructedInterpolants, 2 QuantifiedInterpolants, 2600 SizeOfPredicates, 32 NumberOfNonLiveVariables, 342 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 840/900 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 69]: Location Invariant Derived location invariant: (var_1_9 <= 0) RESULT: Ultimate proved your program to be correct! [2025-02-06 02:08:47,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 Writing output log to file Ultimate.log Result: TRUE