./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-25.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a386daf80732c738b76a20e4179fce031e7d8acd0993c165e015b5df9ed7a991 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:46:38,413 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:46:38,469 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 09:46:38,473 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:46:38,474 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:46:38,497 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:46:38,498 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:46:38,498 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:46:38,498 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:46:38,498 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:46:38,498 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:46:38,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:46:38,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:46:38,498 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:46:38,498 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:46:38,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:46:38,499 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:46:38,500 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 09:46:38,500 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 09:46:38,500 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 09:46:38,500 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:46:38,501 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:46:38,501 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:46:38,501 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:46:38,501 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 09:46:38,501 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:46:38,501 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:46:38,501 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:46:38,501 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:46:38,501 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:46:38,502 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:46:38,502 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:46:38,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:46:38,502 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:46:38,502 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:46:38,502 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:46:38,502 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:46:38,502 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 09:46:38,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 09:46:38,502 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:46:38,502 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:46:38,503 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:46:38,503 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:46:38,503 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a386daf80732c738b76a20e4179fce031e7d8acd0993c165e015b5df9ed7a991 [2025-03-08 09:46:38,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:46:38,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:46:38,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:46:38,742 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:46:38,743 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:46:38,743 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-25.i [2025-03-08 09:46:39,860 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/392faf8ad/e6c58758c0fb4a2292d2cb441e58d94f/FLAG32ccd6df1 [2025-03-08 09:46:40,145 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:46:40,146 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-25.i [2025-03-08 09:46:40,159 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/392faf8ad/e6c58758c0fb4a2292d2cb441e58d94f/FLAG32ccd6df1 [2025-03-08 09:46:40,435 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/392faf8ad/e6c58758c0fb4a2292d2cb441e58d94f [2025-03-08 09:46:40,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:46:40,440 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:46:40,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:46:40,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:46:40,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:46:40,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:46:40" (1/1) ... [2025-03-08 09:46:40,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c774eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:40, skipping insertion in model container [2025-03-08 09:46:40,448 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:46:40" (1/1) ... [2025-03-08 09:46:40,462 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:46:40,555 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-25.i[919,932] [2025-03-08 09:46:40,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:46:40,595 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:46:40,601 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-25.i[919,932] [2025-03-08 09:46:40,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:46:40,625 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:46:40,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:40 WrapperNode [2025-03-08 09:46:40,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:46:40,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:46:40,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:46:40,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:46:40,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:40" (1/1) ... [2025-03-08 09:46:40,635 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:40" (1/1) ... [2025-03-08 09:46:40,652 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2025-03-08 09:46:40,652 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:46:40,652 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:46:40,652 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:46:40,653 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:46:40,658 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:40" (1/1) ... [2025-03-08 09:46:40,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:40" (1/1) ... [2025-03-08 09:46:40,660 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:40" (1/1) ... [2025-03-08 09:46:40,675 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 09:46:40,676 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:40" (1/1) ... [2025-03-08 09:46:40,676 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:40" (1/1) ... [2025-03-08 09:46:40,680 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:40" (1/1) ... [2025-03-08 09:46:40,681 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:40" (1/1) ... [2025-03-08 09:46:40,682 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:40" (1/1) ... [2025-03-08 09:46:40,683 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:40" (1/1) ... [2025-03-08 09:46:40,690 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:46:40,690 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:46:40,690 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:46:40,690 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:46:40,691 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:40" (1/1) ... [2025-03-08 09:46:40,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:46:40,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:46:40,715 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 09:46:40,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 09:46:40,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:46:40,735 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 09:46:40,735 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 09:46:40,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 09:46:40,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:46:40,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:46:40,792 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:46:40,794 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:46:40,975 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 09:46:40,975 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:46:40,983 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:46:40,984 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:46:40,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:46:40 BoogieIcfgContainer [2025-03-08 09:46:40,984 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:46:40,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:46:40,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:46:40,989 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:46:40,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:46:40" (1/3) ... [2025-03-08 09:46:40,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2786540a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:46:40, skipping insertion in model container [2025-03-08 09:46:40,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:40" (2/3) ... [2025-03-08 09:46:40,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2786540a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:46:40, skipping insertion in model container [2025-03-08 09:46:40,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:46:40" (3/3) ... [2025-03-08 09:46:40,991 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-25.i [2025-03-08 09:46:41,001 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:46:41,002 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-25.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:46:41,044 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:46:41,054 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;@b3bfa35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:46:41,055 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:46:41,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 09:46:41,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 09:46:41,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:46:41,066 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:46:41,066 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:46:41,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:46:41,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1881373908, now seen corresponding path program 1 times [2025-03-08 09:46:41,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:46:41,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424397234] [2025-03-08 09:46:41,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:46:41,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:46:41,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 09:46:41,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 09:46:41,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:46:41,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:46:41,460 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 09:46:41,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:46:41,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424397234] [2025-03-08 09:46:41,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424397234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:46:41,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:46:41,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:46:41,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136705957] [2025-03-08 09:46:41,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:46:41,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:46:41,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:46:41,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:46:41,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:46:41,477 INFO L87 Difference]: Start difference. First operand has 52 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 09:46:41,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:46:41,598 INFO L93 Difference]: Finished difference Result 145 states and 244 transitions. [2025-03-08 09:46:41,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:46:41,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2025-03-08 09:46:41,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:46:41,606 INFO L225 Difference]: With dead ends: 145 [2025-03-08 09:46:41,606 INFO L226 Difference]: Without dead ends: 96 [2025-03-08 09:46:41,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:46:41,613 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 68 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:46:41,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 187 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:46:41,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-08 09:46:41,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 77. [2025-03-08 09:46:41,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.26) internal successors, (63), 50 states have internal predecessors, (63), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 09:46:41,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 111 transitions. [2025-03-08 09:46:41,647 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 111 transitions. Word has length 86 [2025-03-08 09:46:41,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:46:41,648 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 111 transitions. [2025-03-08 09:46:41,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 09:46:41,648 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2025-03-08 09:46:41,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 09:46:41,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:46:41,654 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:46:41,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 09:46:41,655 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:46:41,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:46:41,656 INFO L85 PathProgramCache]: Analyzing trace with hash -2010456627, now seen corresponding path program 1 times [2025-03-08 09:46:41,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:46:41,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183163146] [2025-03-08 09:46:41,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:46:41,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:46:41,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 09:46:41,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 09:46:41,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:46:41,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:46:41,915 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 09:46:41,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:46:41,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183163146] [2025-03-08 09:46:41,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183163146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:46:41,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:46:41,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:46:41,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50028360] [2025-03-08 09:46:41,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:46:41,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:46:41,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:46:41,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:46:41,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:46:41,930 INFO L87 Difference]: Start difference. First operand 77 states and 111 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 09:46:42,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:46:42,024 INFO L93 Difference]: Finished difference Result 122 states and 177 transitions. [2025-03-08 09:46:42,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 09:46:42,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2025-03-08 09:46:42,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:46:42,027 INFO L225 Difference]: With dead ends: 122 [2025-03-08 09:46:42,028 INFO L226 Difference]: Without dead ends: 75 [2025-03-08 09:46:42,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:46:42,029 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 67 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:46:42,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 58 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:46:42,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-08 09:46:42,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 48. [2025-03-08 09:46:42,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 09:46:42,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2025-03-08 09:46:42,041 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 86 [2025-03-08 09:46:42,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:46:42,042 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2025-03-08 09:46:42,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 09:46:42,043 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2025-03-08 09:46:42,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 09:46:42,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:46:42,045 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:46:42,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 09:46:42,045 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:46:42,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:46:42,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1095785400, now seen corresponding path program 1 times [2025-03-08 09:46:42,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:46:42,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543317605] [2025-03-08 09:46:42,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:46:42,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:46:42,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 09:46:42,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 09:46:42,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:46:42,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 09:46:42,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2069960967] [2025-03-08 09:46:42,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:46:42,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:46:42,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:46:42,124 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:46:42,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 09:46:42,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 09:46:42,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 09:46:42,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:46:42,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:46:42,210 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 09:46:42,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 09:46:42,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 09:46:42,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:46:42,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:46:42,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 09:46:42,286 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 09:46:42,287 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 09:46:42,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 09:46:42,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:46:42,492 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 09:46:42,536 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 09:46:42,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:46:42 BoogieIcfgContainer [2025-03-08 09:46:42,542 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 09:46:42,543 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 09:46:42,543 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 09:46:42,543 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 09:46:42,543 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:46:40" (3/4) ... [2025-03-08 09:46:42,544 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 09:46:42,545 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 09:46:42,546 INFO L158 Benchmark]: Toolchain (without parser) took 2105.32ms. Allocated memory is still 142.6MB. Free memory was 109.4MB in the beginning and 73.9MB in the end (delta: 35.4MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. [2025-03-08 09:46:42,546 INFO L158 Benchmark]: CDTParser took 1.19ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:46:42,546 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.04ms. Allocated memory is still 142.6MB. Free memory was 109.4MB in the beginning and 96.3MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 09:46:42,546 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.95ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 93.0MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:46:42,546 INFO L158 Benchmark]: Boogie Preprocessor took 37.37ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 89.7MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:46:42,547 INFO L158 Benchmark]: IcfgBuilder took 293.75ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 71.1MB in the end (delta: 18.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 09:46:42,547 INFO L158 Benchmark]: TraceAbstraction took 1556.31ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 73.9MB in the end (delta: -2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:46:42,547 INFO L158 Benchmark]: Witness Printer took 2.45ms. Allocated memory is still 142.6MB. Free memory is still 73.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:46:42,548 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.19ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.04ms. Allocated memory is still 142.6MB. Free memory was 109.4MB in the beginning and 96.3MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.95ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 93.0MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.37ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 89.7MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 293.75ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 71.1MB in the end (delta: 18.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1556.31ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 73.9MB in the end (delta: -2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.45ms. Allocated memory is still 142.6MB. Free memory is still 73.9MB. 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 112, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 104, overapproximation of someBinaryFLOATComparisonOperation at line 125, overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 125, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 76. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -256; [L23] signed short int var_1_5 = -256; [L24] double var_1_7 = 256.25; [L25] double var_1_8 = 127.8; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] float var_1_12 = 999.75; [L29] float var_1_13 = 64.5; [L30] float var_1_14 = 127.25; [L31] signed char var_1_15 = -32; [L32] float var_1_16 = 32.7; [L33] unsigned char var_1_17 = 16; [L34] unsigned char var_1_18 = 32; [L35] unsigned short int var_1_19 = 5; [L36] signed long int var_1_21 = 100; [L37] signed short int var_1_22 = 50; [L38] double var_1_23 = 1000000.75; [L39] signed long int last_1_var_1_1 = -256; [L40] signed short int last_1_var_1_5 = -256; [L41] unsigned char last_1_var_1_10 = 0; [L42] unsigned short int last_1_var_1_19 = 5; [L43] signed short int last_1_var_1_22 = 50; VAL [isInitial=0, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256, var_1_7=1025/4, var_1_8=639/5] [L129] isInitial = 1 [L130] FCALL initially() [L131] COND TRUE 1 [L132] CALL updateLastVariables() [L118] last_1_var_1_1 = var_1_1 [L119] last_1_var_1_5 = var_1_5 [L120] last_1_var_1_10 = var_1_10 [L121] last_1_var_1_19 = var_1_19 [L122] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256, var_1_7=1025/4, var_1_8=639/5] [L132] RET updateLastVariables() [L133] CALL updateVariables() [L96] var_1_7 = __VERIFIER_nondet_double() [L97] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256, var_1_8=639/5] [L97] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256, var_1_8=639/5] [L98] var_1_8 = __VERIFIER_nondet_double() [L99] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L99] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L100] var_1_11 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L101] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L102] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L102] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L103] var_1_13 = __VERIFIER_nondet_float() [L104] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L104] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L105] var_1_14 = __VERIFIER_nondet_float() [L106] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L106] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L107] var_1_15 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_15 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L108] RET assume_abort_if_not(var_1_15 >= -128) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L109] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L109] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L110] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L110] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L111] var_1_16 = __VERIFIER_nondet_float() [L112] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L112] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L113] var_1_18 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_17=16, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_17=16, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L114] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_17=16, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L115] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L115] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L133] RET updateVariables() [L134] CALL step() [L47] COND FALSE !(last_1_var_1_10 && (last_1_var_1_5 >= last_1_var_1_1)) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L52] COND TRUE last_1_var_1_1 >= last_1_var_1_5 [L53] var_1_1 = last_1_var_1_5 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L58] var_1_10 = (last_1_var_1_10 && var_1_11) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L59] COND FALSE !(var_1_8 != ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L64] var_1_22 = last_1_var_1_22 [L65] var_1_23 = var_1_14 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=2, var_1_5=-256] [L66] COND TRUE var_1_22 < var_1_18 [L67] var_1_19 = last_1_var_1_19 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=2, var_1_5=-256] [L75] var_1_21 = var_1_22 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_5=-256] [L76] COND TRUE ! (var_1_23 <= var_1_7) [L77] var_1_12 = ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_5=-256] [L85] COND FALSE !(var_1_10 && var_1_10) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_5=-256] [L88] COND TRUE (var_1_7 - var_1_8) > var_1_12 [L89] var_1_5 = var_1_19 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_5=5] [L134] RET step() [L135] CALL, EXPR property() [L125-L126] return (((((((((last_1_var_1_10 && (last_1_var_1_5 >= last_1_var_1_1)) ? ((256 != last_1_var_1_5) ? (var_1_1 == ((signed long int) (last_1_var_1_1 + last_1_var_1_5))) : 1) : ((last_1_var_1_1 >= last_1_var_1_5) ? (var_1_1 == ((signed long int) last_1_var_1_5)) : (var_1_1 == ((signed long int) last_1_var_1_1)))) && ((var_1_10 && var_1_10) ? (var_1_5 == ((signed short int) ((((var_1_19) < (-100)) ? (var_1_19) : (-100))))) : (((var_1_7 - var_1_8) > var_1_12) ? (var_1_5 == ((signed short int) var_1_19)) : (var_1_5 == ((signed short int) var_1_19))))) && (var_1_10 == ((unsigned char) (last_1_var_1_10 && var_1_11)))) && ((! (var_1_23 <= var_1_7)) ? (var_1_12 == ((float) ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))))) : (((((((var_1_1) > (var_1_17)) ? (var_1_1) : (var_1_17))) / var_1_15) < var_1_19) ? (var_1_12 == ((float) var_1_13)) : (var_1_12 == ((float) (var_1_16 + 49.6f)))))) && ((var_1_8 != ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) ? (var_1_10 ? (var_1_17 == ((unsigned char) var_1_18)) : 1) : 1)) && ((var_1_22 < var_1_18) ? (var_1_19 == ((unsigned short int) last_1_var_1_19)) : (((var_1_10 || var_1_10) || var_1_10) ? (var_1_19 == ((unsigned short int) last_1_var_1_19)) : (var_1_19 == ((unsigned short int) var_1_22))))) && (var_1_21 == ((signed long int) var_1_22))) && (var_1_22 == ((signed short int) last_1_var_1_22))) && (var_1_23 == ((double) var_1_14)) ; VAL [\result=0, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_5=5] [L135] RET, EXPR property() [L135] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_5=5] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_5=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 88 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 135 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 135 mSDsluCounter, 245 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 123 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 122 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=1, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 46 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 346 NumberOfCodeBlocks, 346 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 170 ConstructedInterpolants, 0 QuantifiedInterpolants, 456 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 528/528 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 09:46:42,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-25.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a386daf80732c738b76a20e4179fce031e7d8acd0993c165e015b5df9ed7a991 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:46:44,369 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:46:44,452 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 09:46:44,459 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:46:44,461 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:46:44,482 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:46:44,483 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:46:44,484 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:46:44,484 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:46:44,484 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:46:44,485 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:46:44,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:46:44,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:46:44,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:46:44,485 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:46:44,486 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:46:44,486 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:46:44,486 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 09:46:44,486 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 09:46:44,486 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:46:44,486 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:46:44,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:46:44,486 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:46:44,487 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 09:46:44,487 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 09:46:44,487 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 09:46:44,487 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 09:46:44,487 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:46:44,487 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:46:44,487 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:46:44,488 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:46:44,488 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:46:44,488 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:46:44,488 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:46:44,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:46:44,488 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:46:44,488 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:46:44,488 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:46:44,488 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:46:44,488 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 09:46:44,488 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 09:46:44,489 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:46:44,489 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:46:44,489 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:46:44,489 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:46:44,489 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a386daf80732c738b76a20e4179fce031e7d8acd0993c165e015b5df9ed7a991 [2025-03-08 09:46:44,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:46:44,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:46:44,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:46:44,757 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:46:44,757 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:46:44,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-25.i [2025-03-08 09:46:45,942 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53a1ba82d/622e2ff735a34c92b13fedd98d30cae8/FLAGb9ba66f7b [2025-03-08 09:46:46,146 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:46:46,146 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-25.i [2025-03-08 09:46:46,154 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53a1ba82d/622e2ff735a34c92b13fedd98d30cae8/FLAGb9ba66f7b [2025-03-08 09:46:46,501 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53a1ba82d/622e2ff735a34c92b13fedd98d30cae8 [2025-03-08 09:46:46,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:46:46,504 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:46:46,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:46:46,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:46:46,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:46:46,510 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:46:46" (1/1) ... [2025-03-08 09:46:46,512 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34ed5a99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:46, skipping insertion in model container [2025-03-08 09:46:46,512 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:46:46" (1/1) ... [2025-03-08 09:46:46,526 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:46:46,621 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-25.i[919,932] [2025-03-08 09:46:46,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:46:46,664 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:46:46,672 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-25.i[919,932] [2025-03-08 09:46:46,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:46:46,704 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:46:46,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:46 WrapperNode [2025-03-08 09:46:46,705 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:46:46,706 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:46:46,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:46:46,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:46:46,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:46" (1/1) ... [2025-03-08 09:46:46,723 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:46" (1/1) ... [2025-03-08 09:46:46,746 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2025-03-08 09:46:46,746 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:46:46,747 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:46:46,747 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:46:46,747 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:46:46,753 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:46" (1/1) ... [2025-03-08 09:46:46,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:46" (1/1) ... [2025-03-08 09:46:46,755 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:46" (1/1) ... [2025-03-08 09:46:46,778 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 09:46:46,778 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:46" (1/1) ... [2025-03-08 09:46:46,778 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:46" (1/1) ... [2025-03-08 09:46:46,792 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:46" (1/1) ... [2025-03-08 09:46:46,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:46" (1/1) ... [2025-03-08 09:46:46,794 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:46" (1/1) ... [2025-03-08 09:46:46,795 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:46" (1/1) ... [2025-03-08 09:46:46,801 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:46:46,802 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:46:46,802 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:46:46,803 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:46:46,803 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:46" (1/1) ... [2025-03-08 09:46:46,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:46:46,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:46:46,835 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 09:46:46,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 09:46:46,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:46:46,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 09:46:46,857 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 09:46:46,857 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 09:46:46,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:46:46,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:46:46,908 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:46:46,910 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:46:48,396 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 09:46:48,396 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:46:48,405 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:46:48,406 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:46:48,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:46:48 BoogieIcfgContainer [2025-03-08 09:46:48,406 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:46:48,408 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:46:48,408 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:46:48,411 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:46:48,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:46:46" (1/3) ... [2025-03-08 09:46:48,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a9270f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:46:48, skipping insertion in model container [2025-03-08 09:46:48,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:46" (2/3) ... [2025-03-08 09:46:48,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a9270f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:46:48, skipping insertion in model container [2025-03-08 09:46:48,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:46:48" (3/3) ... [2025-03-08 09:46:48,413 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-25.i [2025-03-08 09:46:48,423 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:46:48,424 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-25.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:46:48,460 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:46:48,468 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;@53db8c24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:46:48,468 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:46:48,471 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 09:46:48,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 09:46:48,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:46:48,481 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:46:48,481 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:46:48,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:46:48,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1881373908, now seen corresponding path program 1 times [2025-03-08 09:46:48,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:46:48,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590422088] [2025-03-08 09:46:48,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:46:48,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 09:46:48,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 09:46:48,496 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 09:46:48,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 09:46:48,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 09:46:48,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 09:46:48,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:46:48,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:46:48,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 09:46:48,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:46:49,053 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 09:46:49,053 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:46:49,054 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:46:49,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [590422088] [2025-03-08 09:46:49,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [590422088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:46:49,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:46:49,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 09:46:49,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748680293] [2025-03-08 09:46:49,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:46:49,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:46:49,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:46:49,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:46:49,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:46:49,073 INFO L87 Difference]: Start difference. First operand has 52 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 09:46:49,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:46:49,358 INFO L93 Difference]: Finished difference Result 97 states and 157 transitions. [2025-03-08 09:46:49,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 09:46:49,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2025-03-08 09:46:49,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:46:49,376 INFO L225 Difference]: With dead ends: 97 [2025-03-08 09:46:49,376 INFO L226 Difference]: Without dead ends: 48 [2025-03-08 09:46:49,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:46:49,380 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 64 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:46:49,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 58 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:46:49,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-08 09:46:49,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-08 09:46:49,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 09:46:49,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2025-03-08 09:46:49,415 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 86 [2025-03-08 09:46:49,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:46:49,416 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2025-03-08 09:46:49,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 09:46:49,416 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2025-03-08 09:46:49,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 09:46:49,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:46:49,418 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:46:49,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 09:46:49,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 09:46:49,619 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:46:49,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:46:49,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1095785400, now seen corresponding path program 1 times [2025-03-08 09:46:49,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:46:49,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17453660] [2025-03-08 09:46:49,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:46:49,621 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 09:46:49,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 09:46:49,623 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 09:46:49,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 09:46:49,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 09:46:49,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 09:46:49,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:46:49,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:46:49,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 09:46:49,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:47:42,805 WARN L286 SmtUtils]: Spent 15.33s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)