./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-2.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_fillercode_fillercodestructure_normal_file-2.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 38ff29ca823d3fabba03e4fbd7eddc473b350ca4f58c43465ea4147ad1b90a75 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:21:52,263 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:21:52,308 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 13:21:52,312 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:21:52,312 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:21:52,344 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:21:52,345 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:21:52,345 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:21:52,345 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:21:52,346 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:21:52,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:21:52,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:21:52,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:21:52,347 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:21:52,347 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:21:52,347 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:21:52,347 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:21:52,347 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:21:52,347 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 13:21:52,347 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:21:52,347 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:21:52,348 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:21:52,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:21:52,348 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:21:52,348 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:21:52,348 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:21:52,348 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:21:52,348 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:21:52,348 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:21:52,348 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:21:52,349 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:21:52,349 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:21:52,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:21:52,349 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:21:52,349 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:21:52,349 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:21:52,349 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:21:52,349 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 13:21:52,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 13:21:52,349 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:21:52,349 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:21:52,350 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:21:52,350 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:21:52,350 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 -> 38ff29ca823d3fabba03e4fbd7eddc473b350ca4f58c43465ea4147ad1b90a75 [2025-03-08 13:21:52,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:21:52,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:21:52,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:21:52,610 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:21:52,610 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:21:52,612 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-2.i [2025-03-08 13:21:53,816 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cefafdb2/d4897c5635e44354bfec93481261f677/FLAGc8fbba304 [2025-03-08 13:21:54,043 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:21:54,045 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-2.i [2025-03-08 13:21:54,052 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cefafdb2/d4897c5635e44354bfec93481261f677/FLAGc8fbba304 [2025-03-08 13:21:54,367 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cefafdb2/d4897c5635e44354bfec93481261f677 [2025-03-08 13:21:54,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:21:54,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:21:54,372 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:21:54,372 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:21:54,374 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:21:54,375 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:21:54" (1/1) ... [2025-03-08 13:21:54,375 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@715f383c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:21:54, skipping insertion in model container [2025-03-08 13:21:54,376 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:21:54" (1/1) ... [2025-03-08 13:21:54,389 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:21:54,489 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_fillercode_fillercodestructure_normal_file-2.i[912,925] [2025-03-08 13:21:54,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:21:54,545 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:21:54,553 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_fillercode_fillercodestructure_normal_file-2.i[912,925] [2025-03-08 13:21:54,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:21:54,591 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:21:54,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:21:54 WrapperNode [2025-03-08 13:21:54,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:21:54,592 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:21:54,592 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:21:54,593 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:21:54,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:21:54" (1/1) ... [2025-03-08 13:21:54,601 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:21:54" (1/1) ... [2025-03-08 13:21:54,625 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2025-03-08 13:21:54,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:21:54,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:21:54,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:21:54,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:21:54,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:21:54" (1/1) ... [2025-03-08 13:21:54,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:21:54" (1/1) ... [2025-03-08 13:21:54,634 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:21:54" (1/1) ... [2025-03-08 13:21:54,647 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 13:21:54,647 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:21:54" (1/1) ... [2025-03-08 13:21:54,647 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:21:54" (1/1) ... [2025-03-08 13:21:54,651 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:21:54" (1/1) ... [2025-03-08 13:21:54,651 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:21:54" (1/1) ... [2025-03-08 13:21:54,652 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:21:54" (1/1) ... [2025-03-08 13:21:54,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:21:54" (1/1) ... [2025-03-08 13:21:54,654 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:21:54,654 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:21:54,654 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:21:54,654 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:21:54,659 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:21:54" (1/1) ... [2025-03-08 13:21:54,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:21:54,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:21:54,682 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 13:21:54,687 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 13:21:54,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:21:54,700 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:21:54,701 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:21:54,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 13:21:54,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:21:54,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:21:54,753 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:21:54,754 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:21:54,918 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 13:21:54,919 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:21:54,926 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:21:54,928 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:21:54,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:21:54 BoogieIcfgContainer [2025-03-08 13:21:54,928 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:21:54,931 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:21:54,931 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:21:54,935 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:21:54,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:21:54" (1/3) ... [2025-03-08 13:21:54,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@561bef0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:21:54, skipping insertion in model container [2025-03-08 13:21:54,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:21:54" (2/3) ... [2025-03-08 13:21:54,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@561bef0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:21:54, skipping insertion in model container [2025-03-08 13:21:54,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:21:54" (3/3) ... [2025-03-08 13:21:54,937 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-2.i [2025-03-08 13:21:54,946 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:21:54,947 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-2.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:21:54,984 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:21:54,993 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;@1f04143d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:21:54,993 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:21:54,995 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 13:21:55,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 13:21:55,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:21:55,003 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:21:55,004 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:21:55,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:21:55,007 INFO L85 PathProgramCache]: Analyzing trace with hash 980209268, now seen corresponding path program 1 times [2025-03-08 13:21:55,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:21:55,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266451216] [2025-03-08 13:21:55,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:21:55,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:21:55,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 13:21:55,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 13:21:55,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:21:55,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:21:55,196 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-08 13:21:55,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:21:55,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266451216] [2025-03-08 13:21:55,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266451216] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:21:55,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641680554] [2025-03-08 13:21:55,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:21:55,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:21:55,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:21:55,200 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 13:21:55,201 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 13:21:55,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 13:21:55,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 13:21:55,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:21:55,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:21:55,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:21:55,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:21:55,340 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-08 13:21:55,341 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:21:55,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641680554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:21:55,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:21:55,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 13:21:55,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431312885] [2025-03-08 13:21:55,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:21:55,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:21:55,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:21:55,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:21:55,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:21:55,365 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 13:21:55,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:21:55,383 INFO L93 Difference]: Finished difference Result 98 states and 160 transitions. [2025-03-08 13:21:55,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:21:55,385 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 91 [2025-03-08 13:21:55,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:21:55,389 INFO L225 Difference]: With dead ends: 98 [2025-03-08 13:21:55,389 INFO L226 Difference]: Without dead ends: 49 [2025-03-08 13:21:55,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:21:55,393 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:21:55,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:21:55,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-08 13:21:55,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-08 13:21:55,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 13:21:55,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2025-03-08 13:21:55,421 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 69 transitions. Word has length 91 [2025-03-08 13:21:55,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:21:55,422 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 69 transitions. [2025-03-08 13:21:55,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 13:21:55,422 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 69 transitions. [2025-03-08 13:21:55,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 13:21:55,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:21:55,424 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:21:55,431 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 13:21:55,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 13:21:55,625 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:21:55,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:21:55,626 INFO L85 PathProgramCache]: Analyzing trace with hash 134718673, now seen corresponding path program 1 times [2025-03-08 13:21:55,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:21:55,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114058075] [2025-03-08 13:21:55,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:21:55,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:21:55,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 13:21:55,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 13:21:55,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:21:55,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 13:21:55,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1682049636] [2025-03-08 13:21:55,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:21:55,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:21:55,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:21:55,759 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:21:55,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 13:21:55,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 13:21:55,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 13:21:55,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:21:55,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:21:55,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 13:21:55,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:21:56,058 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 147 proven. 9 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-08 13:21:56,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:21:56,554 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-08 13:21:56,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:21:56,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114058075] [2025-03-08 13:21:56,555 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 13:21:56,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682049636] [2025-03-08 13:21:56,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682049636] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 13:21:56,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 13:21:56,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-08 13:21:56,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553597941] [2025-03-08 13:21:56,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 13:21:56,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 13:21:56,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:21:56,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 13:21:56,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-08 13:21:56,557 INFO L87 Difference]: Start difference. First operand 49 states and 69 transitions. Second operand has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 5 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) [2025-03-08 13:21:56,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:21:56,826 INFO L93 Difference]: Finished difference Result 123 states and 170 transitions. [2025-03-08 13:21:56,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 13:21:56,827 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 5 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) Word has length 92 [2025-03-08 13:21:56,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:21:56,828 INFO L225 Difference]: With dead ends: 123 [2025-03-08 13:21:56,828 INFO L226 Difference]: Without dead ends: 77 [2025-03-08 13:21:56,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2025-03-08 13:21:56,829 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 94 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:21:56,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 178 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 13:21:56,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-08 13:21:56,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2025-03-08 13:21:56,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 49 states have internal predecessors, (56), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 13:21:56,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2025-03-08 13:21:56,843 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 92 [2025-03-08 13:21:56,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:21:56,843 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2025-03-08 13:21:56,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 5 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) [2025-03-08 13:21:56,843 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2025-03-08 13:21:56,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 13:21:56,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:21:56,844 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:21:56,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 13:21:57,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 13:21:57,045 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:21:57,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:21:57,046 INFO L85 PathProgramCache]: Analyzing trace with hash 553902033, now seen corresponding path program 1 times [2025-03-08 13:21:57,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:21:57,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634214435] [2025-03-08 13:21:57,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:21:57,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:21:57,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 13:21:57,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 13:21:57,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:21:57,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 13:21:57,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2138152516] [2025-03-08 13:21:57,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:21:57,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:21:57,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:21:57,107 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:21:57,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 13:21:57,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 13:21:57,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 13:21:57,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:21:57,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:21:57,169 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 13:21:57,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 13:21:57,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 13:21:57,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:21:57,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:21:57,227 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 13:21:57,227 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 13:21:57,228 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 13:21:57,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 13:21:57,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:21:57,433 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 13:21:57,489 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 13:21:57,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:21:57 BoogieIcfgContainer [2025-03-08 13:21:57,491 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 13:21:57,491 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 13:21:57,491 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 13:21:57,493 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 13:21:57,494 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:21:54" (3/4) ... [2025-03-08 13:21:57,495 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 13:21:57,496 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 13:21:57,497 INFO L158 Benchmark]: Toolchain (without parser) took 3125.79ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 75.3MB in the end (delta: 37.4MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2025-03-08 13:21:57,497 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:21:57,498 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.36ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 99.3MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 13:21:57,499 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.82ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 97.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:21:57,499 INFO L158 Benchmark]: Boogie Preprocessor took 28.13ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 95.1MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:21:57,499 INFO L158 Benchmark]: IcfgBuilder took 273.84ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 78.8MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 13:21:57,499 INFO L158 Benchmark]: TraceAbstraction took 2559.50ms. Allocated memory is still 142.6MB. Free memory was 78.4MB in the beginning and 75.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. [2025-03-08 13:21:57,499 INFO L158 Benchmark]: Witness Printer took 4.47ms. Allocated memory is still 142.6MB. Free memory was 75.3MB in the beginning and 75.3MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:21:57,501 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.36ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 99.3MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.82ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 97.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.13ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 95.1MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 273.84ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 78.8MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2559.50ms. Allocated memory is still 142.6MB. Free memory was 78.4MB in the beginning and 75.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. * Witness Printer took 4.47ms. Allocated memory is still 142.6MB. Free memory was 75.3MB in the beginning and 75.3MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 47, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 54, overapproximation of someBinaryDOUBLEComparisonOperation at line 117, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 46, overapproximation of someBinaryArithmeticFLOAToperation at line 47. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 3.95; [L23] float var_1_4 = 9999999.8; [L24] float var_1_5 = 8.6; [L25] unsigned long int var_1_6 = 10000; [L26] double var_1_8 = 64.5; [L27] float var_1_10 = 255.25; [L28] float var_1_11 = 7.5; [L29] float var_1_12 = 0.0; [L30] float var_1_13 = 64.8; [L31] double var_1_14 = 127.75; [L32] signed char var_1_15 = 8; [L33] signed char var_1_16 = 32; [L34] unsigned char var_1_17 = 0; [L35] unsigned char var_1_18 = 0; [L36] double var_1_19 = 2.25; [L37] unsigned char var_1_20 = 0; [L38] unsigned short int var_1_21 = 256; [L39] unsigned long int last_1_var_1_6 = 10000; VAL [isInitial=0, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_4=49999999/5, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L121] isInitial = 1 [L122] FCALL initially() [L123] COND TRUE 1 [L124] CALL updateLastVariables() [L114] last_1_var_1_6 = var_1_6 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_4=49999999/5, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L124] RET updateLastVariables() [L125] CALL updateVariables() [L90] var_1_4 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L91] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L92] var_1_5 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000, var_1_8=129/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000, var_1_8=129/2] [L93] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000, var_1_8=129/2] [L94] var_1_8 = __VERIFIER_nondet_double() [L95] 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_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L95] 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_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L96] var_1_11 = __VERIFIER_nondet_float() [L97] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L97] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L98] CALL assume_abort_if_not(var_1_11 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L98] RET assume_abort_if_not(var_1_11 != 0.0F) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L99] var_1_12 = __VERIFIER_nondet_float() [L100] CALL assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L100] RET assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L101] var_1_13 = __VERIFIER_nondet_float() [L102] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L102] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L103] var_1_15 = __VERIFIER_nondet_char() [L104] CALL assume_abort_if_not(var_1_15 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L104] RET assume_abort_if_not(var_1_15 >= -1) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L105] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L105] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L106] var_1_16 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L107] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L108] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L108] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L109] var_1_18 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L110] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L111] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L111] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L125] RET updateVariables() [L126] CALL step() [L43] COND TRUE (var_1_15 - ((((0) < (var_1_16)) ? (0) : (var_1_16)))) > last_1_var_1_6 [L44] var_1_14 = var_1_12 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L46] COND TRUE (var_1_5 / var_1_11) >= (var_1_8 - var_1_4) [L47] var_1_10 = (((((var_1_5 - (var_1_12 - var_1_13))) < (var_1_4)) ? ((var_1_5 - (var_1_12 - var_1_13))) : (var_1_4))) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_4=0, var_1_6=10000] [L51] var_1_20 = var_1_16 [L52] var_1_21 = var_1_16 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_4=0, var_1_6=10000] [L53] COND TRUE var_1_21 <= (var_1_16 * var_1_20) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_4=0, var_1_6=10000] [L54] COND TRUE (var_1_5 + var_1_14) <= 127.025f [L55] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_4=0, var_1_6=10000] [L62] unsigned char stepLocal_0 = var_1_20 != var_1_20; VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_4=0, var_1_6=10000] [L63] COND FALSE !(\read(var_1_17)) [L74] var_1_6 = var_1_20 VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_4=0, var_1_6=1] [L76] COND TRUE var_1_6 <= var_1_6 VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_4=0, var_1_6=1] [L77] COND FALSE !(var_1_6 > var_1_6) [L80] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=4, var_1_20=1, var_1_21=1, var_1_4=0, var_1_5=4, var_1_6=1] [L85] COND TRUE var_1_1 < var_1_11 [L86] var_1_19 = (var_1_13 - 256.4) VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_1=4, var_1_20=1, var_1_21=1, var_1_4=0, var_1_5=4, var_1_6=1] [L126] RET step() [L127] CALL, EXPR property() [L117-L118] return ((((((((var_1_6 <= var_1_6) ? ((var_1_6 > var_1_6) ? (var_1_1 == ((float) (var_1_4 - var_1_5))) : (var_1_1 == ((float) var_1_5))) : (var_1_1 == ((float) var_1_4))) && (var_1_17 ? ((((((var_1_14) > (((((var_1_5) > (199.78)) ? (var_1_5) : (199.78))))) ? (var_1_14) : (((((var_1_5) > (199.78)) ? (var_1_5) : (199.78)))))) != (var_1_4 - var_1_8)) ? (((var_1_20 != var_1_20) || var_1_17) ? (var_1_6 == ((unsigned long int) var_1_20)) : (var_1_6 == ((unsigned long int) 5u))) : (var_1_6 == ((unsigned long int) var_1_20))) : (var_1_6 == ((unsigned long int) var_1_20)))) && (((var_1_5 / var_1_11) >= (var_1_8 - var_1_4)) ? (var_1_10 == ((float) (((((var_1_5 - (var_1_12 - var_1_13))) < (var_1_4)) ? ((var_1_5 - (var_1_12 - var_1_13))) : (var_1_4))))) : (var_1_10 == ((float) 4.2f)))) && (((var_1_15 - ((((0) < (var_1_16)) ? (0) : (var_1_16)))) > last_1_var_1_6) ? (var_1_14 == ((double) var_1_12)) : 1)) && ((var_1_21 <= (var_1_16 * var_1_20)) ? (((var_1_5 + var_1_14) <= 127.025f) ? (var_1_17 == ((unsigned char) var_1_18)) : (var_1_17 == ((unsigned char) var_1_18))) : (var_1_17 == ((unsigned char) var_1_18)))) && ((var_1_1 < var_1_11) ? (var_1_19 == ((double) (var_1_13 - 256.4))) : 1)) && (var_1_20 == ((unsigned char) var_1_16))) && (var_1_21 == ((unsigned short int) var_1_16)) ; VAL [\result=0, isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_1=4, var_1_20=1, var_1_21=1, var_1_4=0, var_1_5=4, var_1_6=1] [L127] RET, EXPR property() [L127] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_1=4, var_1_20=1, var_1_21=1, var_1_4=0, var_1_5=4, var_1_6=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_1=4, var_1_20=1, var_1_21=1, var_1_4=0, var_1_5=4, var_1_6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 89 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 3, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 112 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 94 mSDsluCounter, 247 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 112 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 212 IncrementalHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 135 mSDtfsCounter, 212 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=2, InterpolantAutomatonStates: 14, 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, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 552 NumberOfCodeBlocks, 552 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 362 ConstructedInterpolants, 0 QuantifiedInterpolants, 683 SizeOfPredicates, 3 NumberOfNonLiveVariables, 456 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 1206/1248 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 13:21:57,515 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_fillercode_fillercodestructure_normal_file-2.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 38ff29ca823d3fabba03e4fbd7eddc473b350ca4f58c43465ea4147ad1b90a75 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:21:59,308 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:21:59,375 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 13:21:59,379 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:21:59,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:21:59,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:21:59,394 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:21:59,395 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:21:59,395 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:21:59,395 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:21:59,395 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:21:59,395 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:21:59,395 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:21:59,395 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:21:59,395 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:21:59,396 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:21:59,396 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:21:59,396 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:21:59,396 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:21:59,396 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:21:59,396 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:21:59,396 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:21:59,396 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:21:59,396 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 13:21:59,396 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 13:21:59,396 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 13:21:59,396 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:21:59,396 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:21:59,396 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:21:59,396 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:21:59,396 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:21:59,396 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:21:59,396 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:21:59,396 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:21:59,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:21:59,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:21:59,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:21:59,397 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:21:59,397 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:21:59,397 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 13:21:59,397 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 13:21:59,397 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:21:59,397 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:21:59,397 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:21:59,397 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:21:59,397 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 -> 38ff29ca823d3fabba03e4fbd7eddc473b350ca4f58c43465ea4147ad1b90a75 [2025-03-08 13:21:59,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:21:59,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:21:59,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:21:59,635 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:21:59,635 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:21:59,636 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-2.i [2025-03-08 13:22:00,780 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed9a72252/9e64e4ba32364226a968714bedc163d5/FLAG12955457c [2025-03-08 13:22:00,971 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:22:00,971 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-2.i [2025-03-08 13:22:00,978 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed9a72252/9e64e4ba32364226a968714bedc163d5/FLAG12955457c [2025-03-08 13:22:01,340 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed9a72252/9e64e4ba32364226a968714bedc163d5 [2025-03-08 13:22:01,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:22:01,342 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:22:01,343 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:22:01,343 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:22:01,350 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:22:01,351 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:22:01" (1/1) ... [2025-03-08 13:22:01,351 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44f1aceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:01, skipping insertion in model container [2025-03-08 13:22:01,351 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:22:01" (1/1) ... [2025-03-08 13:22:01,362 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:22:01,446 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_fillercode_fillercodestructure_normal_file-2.i[912,925] [2025-03-08 13:22:01,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:22:01,486 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:22:01,493 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_fillercode_fillercodestructure_normal_file-2.i[912,925] [2025-03-08 13:22:01,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:22:01,519 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:22:01,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:01 WrapperNode [2025-03-08 13:22:01,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:22:01,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:22:01,521 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:22:01,521 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:22:01,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:01" (1/1) ... [2025-03-08 13:22:01,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:01" (1/1) ... [2025-03-08 13:22:01,558 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2025-03-08 13:22:01,562 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:22:01,563 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:22:01,563 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:22:01,563 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:22:01,568 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:01" (1/1) ... [2025-03-08 13:22:01,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:01" (1/1) ... [2025-03-08 13:22:01,572 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:01" (1/1) ... [2025-03-08 13:22:01,587 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 13:22:01,593 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:01" (1/1) ... [2025-03-08 13:22:01,593 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:01" (1/1) ... [2025-03-08 13:22:01,604 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:01" (1/1) ... [2025-03-08 13:22:01,605 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:01" (1/1) ... [2025-03-08 13:22:01,606 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:01" (1/1) ... [2025-03-08 13:22:01,607 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:01" (1/1) ... [2025-03-08 13:22:01,613 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:22:01,613 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:22:01,613 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:22:01,613 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:22:01,614 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:01" (1/1) ... [2025-03-08 13:22:01,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:22:01,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:22:01,641 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 13:22:01,646 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 13:22:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:22:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 13:22:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:22:01,661 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:22:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:22:01,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:22:01,716 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:22:01,717 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:22:15,213 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 13:22:15,213 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:22:15,219 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:22:15,219 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:22:15,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:22:15 BoogieIcfgContainer [2025-03-08 13:22:15,220 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:22:15,221 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:22:15,221 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:22:15,224 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:22:15,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:22:01" (1/3) ... [2025-03-08 13:22:15,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c73ab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:22:15, skipping insertion in model container [2025-03-08 13:22:15,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:22:01" (2/3) ... [2025-03-08 13:22:15,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c73ab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:22:15, skipping insertion in model container [2025-03-08 13:22:15,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:22:15" (3/3) ... [2025-03-08 13:22:15,225 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-2.i [2025-03-08 13:22:15,235 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:22:15,236 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-2.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:22:15,266 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:22:15,274 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;@39765001, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:22:15,274 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:22:15,276 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 13:22:15,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 13:22:15,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:22:15,283 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:22:15,283 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:22:15,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:22:15,286 INFO L85 PathProgramCache]: Analyzing trace with hash 980209268, now seen corresponding path program 1 times [2025-03-08 13:22:15,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:22:15,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [202717359] [2025-03-08 13:22:15,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:22:15,293 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 13:22:15,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:22:15,295 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 13:22:15,296 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 13:22:15,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 13:22:15,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 13:22:15,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:22:15,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:22:15,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:22:15,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:22:15,829 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 13:22:15,829 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:22:15,829 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:22:15,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [202717359] [2025-03-08 13:22:15,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [202717359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:22:15,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:22:15,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 13:22:15,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860617473] [2025-03-08 13:22:15,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:22:15,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:22:15,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:22:15,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:22:15,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:22:15,860 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 13:22:15,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:22:15,873 INFO L93 Difference]: Finished difference Result 98 states and 160 transitions. [2025-03-08 13:22:15,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:22:15,875 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2025-03-08 13:22:15,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:22:15,878 INFO L225 Difference]: With dead ends: 98 [2025-03-08 13:22:15,878 INFO L226 Difference]: Without dead ends: 49 [2025-03-08 13:22:15,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:22:15,882 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:22:15,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:22:15,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-08 13:22:15,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-08 13:22:15,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 13:22:15,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2025-03-08 13:22:15,907 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 69 transitions. Word has length 91 [2025-03-08 13:22:15,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:22:15,907 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 69 transitions. [2025-03-08 13:22:15,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 13:22:15,908 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 69 transitions. [2025-03-08 13:22:15,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 13:22:15,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:22:15,911 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:22:15,927 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 13:22:16,112 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 13:22:16,112 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:22:16,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:22:16,113 INFO L85 PathProgramCache]: Analyzing trace with hash 134718673, now seen corresponding path program 1 times [2025-03-08 13:22:16,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:22:16,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756702246] [2025-03-08 13:22:16,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:22:16,113 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 13:22:16,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:22:16,116 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 13:22:16,117 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 13:22:16,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 13:22:16,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 13:22:16,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:22:16,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:22:16,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 13:22:16,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:22:17,310 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 138 proven. 9 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2025-03-08 13:22:17,313 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:22:18,598 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-08 13:22:18,598 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:22:18,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756702246] [2025-03-08 13:22:18,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [756702246] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 13:22:18,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 13:22:18,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-03-08 13:22:18,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078419655] [2025-03-08 13:22:18,601 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 13:22:18,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 13:22:18,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:22:18,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 13:22:18,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 13:22:18,603 INFO L87 Difference]: Start difference. First operand 49 states and 69 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 13:22:24,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:22:28,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:22:32,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:22:33,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:22:33,557 INFO L93 Difference]: Finished difference Result 125 states and 172 transitions. [2025-03-08 13:22:33,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 13:22:33,559 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 92 [2025-03-08 13:22:33,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:22:33,560 INFO L225 Difference]: With dead ends: 125 [2025-03-08 13:22:33,560 INFO L226 Difference]: Without dead ends: 79 [2025-03-08 13:22:33,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2025-03-08 13:22:33,561 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 62 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2025-03-08 13:22:33,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 180 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 214 Invalid, 3 Unknown, 0 Unchecked, 14.5s Time] [2025-03-08 13:22:33,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-08 13:22:33,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2025-03-08 13:22:33,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 49 states have internal predecessors, (56), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 13:22:33,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2025-03-08 13:22:33,570 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 92 [2025-03-08 13:22:33,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:22:33,571 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2025-03-08 13:22:33,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 13:22:33,571 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2025-03-08 13:22:33,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 13:22:33,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:22:33,573 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:22:33,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 13:22:33,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:22:33,773 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:22:33,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:22:33,774 INFO L85 PathProgramCache]: Analyzing trace with hash 553902033, now seen corresponding path program 1 times [2025-03-08 13:22:33,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:22:33,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364951580] [2025-03-08 13:22:33,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:22:33,774 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 13:22:33,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:22:33,776 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:22:33,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 13:22:33,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 13:22:34,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 13:22:34,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:22:34,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:22:34,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 13:22:34,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:22:56,502 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 13:23:04,478 WARN L286 SmtUtils]: Spent 7.98s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 13:23:12,616 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 13:23:20,763 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 13:23:28,907 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 13:23:37,047 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)