./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-80.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_operatoramount_amount50_file-80.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 fe1fe0b5e0a3ec8c50f7deed8e5c41ff7c08f0d5f402373171036b554bec1d5c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:58:45,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:58:45,352 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:58:45,358 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:58:45,358 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:58:45,381 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:58:45,383 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:58:45,383 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:58:45,383 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:58:45,384 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:58:45,384 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:58:45,384 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:58:45,385 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:58:45,385 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:58:45,385 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:58:45,385 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:58:45,385 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:58:45,386 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:58:45,386 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:58:45,386 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:58:45,386 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:58:45,386 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:58:45,386 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:58:45,386 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:58:45,386 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:58:45,386 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:58:45,386 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:58:45,386 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:58:45,386 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:58:45,386 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:58:45,387 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:58:45,387 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:58:45,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:58:45,387 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:58:45,387 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:58:45,387 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:58:45,387 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:58:45,387 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:58:45,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:58:45,387 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:58:45,388 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:58:45,388 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:58:45,388 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:58:45,388 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 -> fe1fe0b5e0a3ec8c50f7deed8e5c41ff7c08f0d5f402373171036b554bec1d5c [2025-03-08 15:58:45,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:58:45,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:58:45,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:58:45,641 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:58:45,642 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:58:45,643 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-80.i [2025-03-08 15:58:46,816 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3144dee77/fcedc17ccf5a459ead48112bd79e2c54/FLAG641d8dece [2025-03-08 15:58:47,064 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:58:47,065 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-80.i [2025-03-08 15:58:47,071 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3144dee77/fcedc17ccf5a459ead48112bd79e2c54/FLAG641d8dece [2025-03-08 15:58:47,390 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3144dee77/fcedc17ccf5a459ead48112bd79e2c54 [2025-03-08 15:58:47,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:58:47,395 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:58:47,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:58:47,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:58:47,399 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:58:47,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:58:47" (1/1) ... [2025-03-08 15:58:47,400 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b22eac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:47, skipping insertion in model container [2025-03-08 15:58:47,400 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:58:47" (1/1) ... [2025-03-08 15:58:47,414 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:58:47,513 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-80.i[915,928] [2025-03-08 15:58:47,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:58:47,557 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:58:47,563 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-80.i[915,928] [2025-03-08 15:58:47,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:58:47,591 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:58:47,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:47 WrapperNode [2025-03-08 15:58:47,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:58:47,593 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:58:47,593 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:58:47,593 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:58:47,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 03:58:47" (1/1) ... [2025-03-08 15:58:47,604 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:47" (1/1) ... [2025-03-08 15:58:47,638 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2025-03-08 15:58:47,638 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:58:47,639 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:58:47,639 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:58:47,639 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:58:47,644 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:47" (1/1) ... [2025-03-08 15:58:47,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:47" (1/1) ... [2025-03-08 15:58:47,647 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:47" (1/1) ... [2025-03-08 15:58:47,659 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 15:58:47,659 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:47" (1/1) ... [2025-03-08 15:58:47,659 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:47" (1/1) ... [2025-03-08 15:58:47,665 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:47" (1/1) ... [2025-03-08 15:58:47,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:47" (1/1) ... [2025-03-08 15:58:47,668 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:47" (1/1) ... [2025-03-08 15:58:47,669 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:47" (1/1) ... [2025-03-08 15:58:47,672 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:58:47,672 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:58:47,672 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:58:47,673 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:58:47,673 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:47" (1/1) ... [2025-03-08 15:58:47,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:58:47,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:58:47,697 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 15:58:47,699 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 15:58:47,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:58:47,714 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:58:47,714 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:58:47,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:58:47,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:58:47,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:58:47,770 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:58:47,771 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:58:47,971 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 15:58:47,972 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:58:47,982 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:58:47,987 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:58:47,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:58:47 BoogieIcfgContainer [2025-03-08 15:58:47,987 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:58:47,989 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:58:47,989 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:58:47,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:58:47,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:58:47" (1/3) ... [2025-03-08 15:58:47,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2029cdf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:58:47, skipping insertion in model container [2025-03-08 15:58:47,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:47" (2/3) ... [2025-03-08 15:58:47,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2029cdf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:58:47, skipping insertion in model container [2025-03-08 15:58:47,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:58:47" (3/3) ... [2025-03-08 15:58:47,994 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-80.i [2025-03-08 15:58:48,005 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:58:48,006 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount50_file-80.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:58:48,062 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:58:48,069 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;@105770ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:58:48,070 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:58:48,073 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 15:58:48,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 15:58:48,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:58:48,080 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:58:48,081 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:58:48,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:58:48,085 INFO L85 PathProgramCache]: Analyzing trace with hash -75793549, now seen corresponding path program 1 times [2025-03-08 15:58:48,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:58:48,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841170216] [2025-03-08 15:58:48,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:58:48,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:58:48,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 15:58:48,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 15:58:48,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:58:48,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:58:48,314 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-08 15:58:48,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:58:48,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841170216] [2025-03-08 15:58:48,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841170216] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:58:48,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726144032] [2025-03-08 15:58:48,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:58:48,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:58:48,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:58:48,319 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 15:58:48,320 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 15:58:48,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 15:58:48,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 15:58:48,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:58:48,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:58:48,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:58:48,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:58:48,489 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-08 15:58:48,491 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:58:48,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726144032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:58:48,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:58:48,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:58:48,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930504749] [2025-03-08 15:58:48,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:58:48,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:58:48,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:58:48,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:58:48,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:58:48,513 INFO L87 Difference]: Start difference. First operand has 60 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 15:58:48,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:58:48,529 INFO L93 Difference]: Finished difference Result 114 states and 192 transitions. [2025-03-08 15:58:48,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:58:48,533 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 125 [2025-03-08 15:58:48,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:58:48,538 INFO L225 Difference]: With dead ends: 114 [2025-03-08 15:58:48,539 INFO L226 Difference]: Without dead ends: 57 [2025-03-08 15:58:48,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 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 15:58:48,545 INFO L435 NwaCegarLoop]: 84 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, 84 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 15:58:48,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:58:48,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-08 15:58:48,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-08 15:58:48,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 15:58:48,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 84 transitions. [2025-03-08 15:58:48,579 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 84 transitions. Word has length 125 [2025-03-08 15:58:48,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:58:48,580 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 84 transitions. [2025-03-08 15:58:48,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 15:58:48,581 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 84 transitions. [2025-03-08 15:58:48,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 15:58:48,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:58:48,584 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:58:48,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 15:58:48,785 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 15:58:48,785 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:58:48,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:58:48,786 INFO L85 PathProgramCache]: Analyzing trace with hash 696073522, now seen corresponding path program 1 times [2025-03-08 15:58:48,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:58:48,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907792982] [2025-03-08 15:58:48,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:58:48,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:58:48,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 15:58:48,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 15:58:48,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:58:48,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:58:49,116 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 15:58:49,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:58:49,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907792982] [2025-03-08 15:58:49,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907792982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:58:49,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:58:49,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:58:49,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674348691] [2025-03-08 15:58:49,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:58:49,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:58:49,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:58:49,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:58:49,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:58:49,121 INFO L87 Difference]: Start difference. First operand 57 states and 84 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 15:58:49,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:58:49,178 INFO L93 Difference]: Finished difference Result 165 states and 246 transitions. [2025-03-08 15:58:49,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:58:49,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2025-03-08 15:58:49,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:58:49,181 INFO L225 Difference]: With dead ends: 165 [2025-03-08 15:58:49,183 INFO L226 Difference]: Without dead ends: 111 [2025-03-08 15:58:49,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:58:49,184 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 80 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:58:49,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 231 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:58:49,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-08 15:58:49,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 59. [2025-03-08 15:58:49,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 15:58:49,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2025-03-08 15:58:49,198 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 125 [2025-03-08 15:58:49,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:58:49,199 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2025-03-08 15:58:49,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 15:58:49,199 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2025-03-08 15:58:49,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 15:58:49,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:58:49,200 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:58:49,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:58:49,200 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:58:49,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:58:49,201 INFO L85 PathProgramCache]: Analyzing trace with hash 499560017, now seen corresponding path program 1 times [2025-03-08 15:58:49,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:58:49,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124093588] [2025-03-08 15:58:49,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:58:49,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:58:49,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 15:58:49,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 15:58:49,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:58:49,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:58:49,449 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 15:58:49,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:58:49,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124093588] [2025-03-08 15:58:49,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124093588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:58:49,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:58:49,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:58:49,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572349225] [2025-03-08 15:58:49,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:58:49,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:58:49,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:58:49,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:58:49,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:58:49,451 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 15:58:49,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:58:49,499 INFO L93 Difference]: Finished difference Result 171 states and 252 transitions. [2025-03-08 15:58:49,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:58:49,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2025-03-08 15:58:49,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:58:49,502 INFO L225 Difference]: With dead ends: 171 [2025-03-08 15:58:49,502 INFO L226 Difference]: Without dead ends: 115 [2025-03-08 15:58:49,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:58:49,505 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 39 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:58:49,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 163 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:58:49,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-08 15:58:49,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2025-03-08 15:58:49,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 72 states have internal predecessors, (88), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 15:58:49,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 164 transitions. [2025-03-08 15:58:49,529 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 164 transitions. Word has length 125 [2025-03-08 15:58:49,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:58:49,530 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 164 transitions. [2025-03-08 15:58:49,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 15:58:49,530 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 164 transitions. [2025-03-08 15:58:49,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 15:58:49,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:58:49,532 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:58:49,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:58:49,534 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:58:49,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:58:49,535 INFO L85 PathProgramCache]: Analyzing trace with hash 825156241, now seen corresponding path program 1 times [2025-03-08 15:58:49,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:58:49,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48259673] [2025-03-08 15:58:49,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:58:49,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:58:49,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 15:58:49,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 15:58:49,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:58:49,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:58:49,623 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 15:58:49,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:58:49,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48259673] [2025-03-08 15:58:49,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48259673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:58:49,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:58:49,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:58:49,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230950897] [2025-03-08 15:58:49,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:58:49,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:58:49,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:58:49,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:58:49,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:58:49,625 INFO L87 Difference]: Start difference. First operand 113 states and 164 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 15:58:49,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:58:49,648 INFO L93 Difference]: Finished difference Result 167 states and 240 transitions. [2025-03-08 15:58:49,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:58:49,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2025-03-08 15:58:49,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:58:49,650 INFO L225 Difference]: With dead ends: 167 [2025-03-08 15:58:49,651 INFO L226 Difference]: Without dead ends: 57 [2025-03-08 15:58:49,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:58:49,652 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:58:49,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:58:49,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-08 15:58:49,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-08 15:58:49,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 15:58:49,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2025-03-08 15:58:49,662 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 78 transitions. Word has length 125 [2025-03-08 15:58:49,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:58:49,662 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 78 transitions. [2025-03-08 15:58:49,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 15:58:49,662 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2025-03-08 15:58:49,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 15:58:49,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:58:49,664 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:58:49,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:58:49,665 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:58:49,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:58:49,666 INFO L85 PathProgramCache]: Analyzing trace with hash 832721616, now seen corresponding path program 1 times [2025-03-08 15:58:49,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:58:49,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61502413] [2025-03-08 15:58:49,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:58:49,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:58:49,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 15:58:49,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 15:58:49,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:58:49,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:58:49,778 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 15:58:49,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 15:58:49,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 15:58:49,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:58:49,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:58:49,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 15:58:49,882 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 15:58:49,882 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 15:58:49,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:58:49,886 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-08 15:58:49,955 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 15:58:49,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 03:58:49 BoogieIcfgContainer [2025-03-08 15:58:49,958 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 15:58:49,958 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 15:58:49,958 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 15:58:49,962 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 15:58:49,963 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:58:47" (3/4) ... [2025-03-08 15:58:49,965 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 15:58:49,966 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 15:58:49,967 INFO L158 Benchmark]: Toolchain (without parser) took 2571.52ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 60.1MB in the end (delta: 45.6MB). Peak memory consumption was 44.7MB. Max. memory is 16.1GB. [2025-03-08 15:58:49,969 INFO L158 Benchmark]: CDTParser took 0.84ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:58:49,969 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.71ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 91.0MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 15:58:49,969 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.27ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 87.6MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:58:49,969 INFO L158 Benchmark]: Boogie Preprocessor took 33.32ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 81.4MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:58:49,970 INFO L158 Benchmark]: IcfgBuilder took 314.78ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 61.4MB in the end (delta: 20.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 15:58:49,970 INFO L158 Benchmark]: TraceAbstraction took 1968.82ms. Allocated memory is still 142.6MB. Free memory was 60.2MB in the beginning and 60.1MB in the end (delta: 144.5kB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. [2025-03-08 15:58:49,970 INFO L158 Benchmark]: Witness Printer took 7.49ms. Allocated memory is still 142.6MB. Free memory was 60.1MB in the beginning and 60.1MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:58:49,971 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.84ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 196.71ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 91.0MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.27ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 87.6MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.32ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 81.4MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 314.78ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 61.4MB in the end (delta: 20.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1968.82ms. Allocated memory is still 142.6MB. Free memory was 60.2MB in the beginning and 60.1MB in the end (delta: 144.5kB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. * Witness Printer took 7.49ms. Allocated memory is still 142.6MB. Free memory was 60.1MB in the beginning and 60.1MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryDOUBLEComparisonOperation at line 122, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 63, overapproximation of someBinaryDOUBLEComparisonOperation at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 128; [L23] double var_1_2 = 24.25; [L24] double var_1_3 = 128.5; [L25] double var_1_4 = 4.5; [L26] double var_1_5 = 49.5; [L27] signed short int var_1_9 = -25; [L28] unsigned char var_1_10 = 200; [L29] unsigned char var_1_11 = 1; [L30] unsigned char var_1_12 = 1; [L31] double var_1_13 = 128.375; [L32] unsigned short int var_1_14 = 0; [L33] float var_1_15 = 0.0; [L34] float var_1_16 = 4.87; [L35] float var_1_17 = 8.875; [L36] signed short int var_1_18 = -128; [L37] unsigned char var_1_19 = 0; [L38] unsigned char var_1_20 = 1; [L39] unsigned char var_1_21 = 0; [L40] unsigned long int var_1_22 = 16; [L41] unsigned long int var_1_23 = 4200661734; [L42] unsigned char last_1_var_1_10 = 200; VAL [isInitial=0, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_2=97/4, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L126] isInitial = 1 [L127] FCALL initially() [L128] COND TRUE 1 [L129] CALL updateLastVariables() [L119] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_2=97/4, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L129] RET updateLastVariables() [L130] CALL updateVariables() [L85] var_1_2 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L86] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L87] var_1_3 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L88] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L89] var_1_4 = __VERIFIER_nondet_double() [L90] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_5=99/2, var_1_9=-25] [L90] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_5=99/2, var_1_9=-25] [L91] var_1_5 = __VERIFIER_nondet_double() [L92] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L92] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L93] var_1_11 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L94] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L95] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L95] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L96] var_1_12 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L97] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L98] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L98] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L99] var_1_13 = __VERIFIER_nondet_double() [L100] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L100] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L101] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L101] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L102] var_1_15 = __VERIFIER_nondet_float() [L103] CALL assume_abort_if_not((var_1_15 >= 4611686.018427387900e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L103] RET assume_abort_if_not((var_1_15 >= 4611686.018427387900e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L104] var_1_16 = __VERIFIER_nondet_float() [L105] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L105] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L106] var_1_17 = __VERIFIER_nondet_float() [L107] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L107] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L108] var_1_20 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L109] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L110] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L110] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L111] var_1_21 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L112] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L113] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L113] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L114] var_1_23 = __VERIFIER_nondet_ulong() [L115] CALL assume_abort_if_not(var_1_23 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_9=-25] [L115] RET assume_abort_if_not(var_1_23 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_9=-25] [L116] CALL assume_abort_if_not(var_1_23 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_9=-25] [L116] RET assume_abort_if_not(var_1_23 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_9=-25] [L130] RET updateVariables() [L131] CALL step() [L46] signed long int stepLocal_0 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=200, stepLocal_0=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_9=-25] [L47] COND TRUE stepLocal_0 >= last_1_var_1_10 [L48] var_1_9 = (-256 + last_1_var_1_10) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_9=-56] [L52] signed short int stepLocal_1 = var_1_9; VAL [isInitial=1, last_1_var_1_10=200, stepLocal_1=-56, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_9=-56] [L53] COND FALSE !(stepLocal_1 > 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_9=-56] [L56] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_9=-56] [L59] COND TRUE ! (var_1_5 > (255.9 / var_1_13)) [L60] var_1_10 = var_1_12 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_9=-56] [L63] COND TRUE ((var_1_2 - var_1_3) * var_1_4) < var_1_5 [L64] var_1_1 = ((((-8) < ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10)))))) ? (-8) : ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))))))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_9=-56] [L68] COND FALSE !((var_1_17 <= (- var_1_16)) && var_1_19) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_9=-56] [L71] COND FALSE !(\read(var_1_19)) [L74] var_1_22 = (((((var_1_23 - var_1_9)) < (var_1_10)) ? ((var_1_23 - var_1_9)) : (var_1_10))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_9=-56] [L76] COND TRUE ! var_1_19 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_9=-56] [L77] COND TRUE ((var_1_15 - var_1_16) - var_1_17) <= var_1_13 [L78] var_1_14 = var_1_18 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_9=-56] [L131] RET step() [L132] CALL, EXPR property() [L122-L123] return (((((((((var_1_2 - var_1_3) * var_1_4) < var_1_5) ? (var_1_1 == ((signed short int) ((((-8) < ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10)))))) ? (-8) : ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))))))))) : (var_1_1 == ((signed short int) var_1_10))) && ((last_1_var_1_10 >= last_1_var_1_10) ? (var_1_9 == ((signed short int) (-256 + last_1_var_1_10))) : (var_1_9 == ((signed short int) (last_1_var_1_10 + last_1_var_1_10))))) && (var_1_19 ? (var_1_10 == ((unsigned char) ((((0) < (var_1_12)) ? (0) : (var_1_12))))) : ((! (var_1_5 > (255.9 / var_1_13))) ? (var_1_10 == ((unsigned char) var_1_12)) : 1))) && ((! var_1_19) ? ((((var_1_15 - var_1_16) - var_1_17) <= var_1_13) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (((var_1_17 <= (- var_1_16)) && var_1_19) ? (var_1_18 == ((signed short int) var_1_10)) : 1)) && ((var_1_9 > 0) ? (var_1_19 == ((unsigned char) ((var_1_5 >= (- var_1_15)) && (var_1_11 && (var_1_20 && var_1_21))))) : 1)) && (var_1_19 ? (var_1_22 == ((unsigned long int) (var_1_9 + var_1_10))) : (var_1_22 == ((unsigned long int) (((((var_1_23 - var_1_9)) < (var_1_10)) ? ((var_1_23 - var_1_9)) : (var_1_10)))))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_9=-56] [L132] RET, EXPR property() [L132] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_9=-56] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_9=-56] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 108 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 5, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 119 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 119 mSDsluCounter, 628 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 296 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37 IncrementalHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 332 mSDtfsCounter, 37 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=3, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 54 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 752 NumberOfCodeBlocks, 752 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 620 ConstructedInterpolants, 0 QuantifiedInterpolants, 1032 SizeOfPredicates, 0 NumberOfNonLiveVariables, 291 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 3384/3420 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 15:58:49,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-80.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 fe1fe0b5e0a3ec8c50f7deed8e5c41ff7c08f0d5f402373171036b554bec1d5c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:58:51,834 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:58:51,916 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 15:58:51,920 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:58:51,922 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:58:51,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:58:51,945 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:58:51,945 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:58:51,945 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:58:51,945 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:58:51,945 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:58:51,945 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:58:51,945 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:58:51,946 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:58:51,946 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:58:51,946 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:58:51,946 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:58:51,946 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:58:51,946 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:58:51,946 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:58:51,946 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:58:51,946 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:58:51,946 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:58:51,946 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 15:58:51,946 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 15:58:51,946 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 15:58:51,946 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:58:51,946 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:58:51,946 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:58:51,946 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:58:51,946 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:58:51,946 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:58:51,946 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:58:51,947 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:58:51,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:58:51,947 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:58:51,947 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:58:51,947 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:58:51,947 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:58:51,947 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 15:58:51,947 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 15:58:51,947 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:58:51,947 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:58:51,947 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:58:51,947 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:58:51,947 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 -> fe1fe0b5e0a3ec8c50f7deed8e5c41ff7c08f0d5f402373171036b554bec1d5c [2025-03-08 15:58:52,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:58:52,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:58:52,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:58:52,188 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:58:52,190 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:58:52,192 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-80.i [2025-03-08 15:58:53,422 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9d51400a/14484a240eca417e8f930a2563b0c8ce/FLAGd8575fa87 [2025-03-08 15:58:53,626 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:58:53,627 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-80.i [2025-03-08 15:58:53,637 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9d51400a/14484a240eca417e8f930a2563b0c8ce/FLAGd8575fa87 [2025-03-08 15:58:53,976 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9d51400a/14484a240eca417e8f930a2563b0c8ce [2025-03-08 15:58:53,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:58:53,979 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:58:53,981 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:58:53,981 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:58:53,984 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:58:53,985 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:58:53" (1/1) ... [2025-03-08 15:58:53,986 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ab1799c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:53, skipping insertion in model container [2025-03-08 15:58:53,987 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:58:53" (1/1) ... [2025-03-08 15:58:54,002 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:58:54,113 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-80.i[915,928] [2025-03-08 15:58:54,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:58:54,194 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:58:54,202 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-80.i[915,928] [2025-03-08 15:58:54,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:58:54,253 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:58:54,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:54 WrapperNode [2025-03-08 15:58:54,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:58:54,254 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:58:54,254 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:58:54,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:58:54,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:54" (1/1) ... [2025-03-08 15:58:54,265 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:54" (1/1) ... [2025-03-08 15:58:54,291 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2025-03-08 15:58:54,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:58:54,293 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:58:54,293 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:58:54,293 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:58:54,299 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:54" (1/1) ... [2025-03-08 15:58:54,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:54" (1/1) ... [2025-03-08 15:58:54,311 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:54" (1/1) ... [2025-03-08 15:58:54,325 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 15:58:54,325 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:54" (1/1) ... [2025-03-08 15:58:54,325 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:54" (1/1) ... [2025-03-08 15:58:54,331 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:54" (1/1) ... [2025-03-08 15:58:54,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:54" (1/1) ... [2025-03-08 15:58:54,338 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:54" (1/1) ... [2025-03-08 15:58:54,339 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:54" (1/1) ... [2025-03-08 15:58:54,341 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:58:54,343 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:58:54,344 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:58:54,344 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:58:54,344 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:54" (1/1) ... [2025-03-08 15:58:54,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:58:54,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:58:54,372 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 15:58:54,376 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 15:58:54,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:58:54,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 15:58:54,396 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:58:54,396 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:58:54,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:58:54,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:58:54,466 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:58:54,468 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:59:14,382 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 15:59:14,383 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:59:14,389 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:59:14,390 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:59:14,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:59:14 BoogieIcfgContainer [2025-03-08 15:59:14,390 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:59:14,392 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:59:14,392 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:59:14,396 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:59:14,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:58:53" (1/3) ... [2025-03-08 15:59:14,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f6e8a35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:59:14, skipping insertion in model container [2025-03-08 15:59:14,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:54" (2/3) ... [2025-03-08 15:59:14,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f6e8a35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:59:14, skipping insertion in model container [2025-03-08 15:59:14,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:59:14" (3/3) ... [2025-03-08 15:59:14,399 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-80.i [2025-03-08 15:59:14,409 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:59:14,410 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount50_file-80.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:59:14,446 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:59:14,456 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;@188ccd31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:59:14,456 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:59:14,459 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 15:59:14,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 15:59:14,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:59:14,469 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:59:14,469 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:59:14,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:59:14,472 INFO L85 PathProgramCache]: Analyzing trace with hash -75793549, now seen corresponding path program 1 times [2025-03-08 15:59:14,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:59:14,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311724738] [2025-03-08 15:59:14,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:59:14,480 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 15:59:14,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:59:14,483 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 15:59:14,484 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 15:59:14,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 15:59:15,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 15:59:15,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:59:15,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:59:15,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:59:15,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:59:15,449 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-03-08 15:59:15,449 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:59:15,449 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:59:15,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311724738] [2025-03-08 15:59:15,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311724738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:59:15,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:59:15,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 15:59:15,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005429811] [2025-03-08 15:59:15,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:59:15,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:59:15,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:59:15,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:59:15,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:59:15,467 INFO L87 Difference]: Start difference. First operand has 60 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 15:59:15,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:59:15,481 INFO L93 Difference]: Finished difference Result 114 states and 192 transitions. [2025-03-08 15:59:15,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:59:15,487 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 125 [2025-03-08 15:59:15,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:59:15,491 INFO L225 Difference]: With dead ends: 114 [2025-03-08 15:59:15,491 INFO L226 Difference]: Without dead ends: 57 [2025-03-08 15:59:15,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 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 15:59:15,495 INFO L435 NwaCegarLoop]: 84 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, 84 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 15:59:15,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:59:15,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-08 15:59:15,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-08 15:59:15,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 15:59:15,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 84 transitions. [2025-03-08 15:59:15,529 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 84 transitions. Word has length 125 [2025-03-08 15:59:15,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:59:15,530 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 84 transitions. [2025-03-08 15:59:15,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 15:59:15,530 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 84 transitions. [2025-03-08 15:59:15,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 15:59:15,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:59:15,532 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:59:15,558 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 15:59:15,732 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 15:59:15,732 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:59:15,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:59:15,733 INFO L85 PathProgramCache]: Analyzing trace with hash 696073522, now seen corresponding path program 1 times [2025-03-08 15:59:15,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:59:15,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177739910] [2025-03-08 15:59:15,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:59:15,734 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 15:59:15,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:59:15,736 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 15:59:15,737 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 15:59:15,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 15:59:16,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 15:59:16,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:59:16,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:59:16,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 15:59:16,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:59:16,867 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 15:59:16,867 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:59:16,867 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:59:16,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177739910] [2025-03-08 15:59:16,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [177739910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:59:16,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:59:16,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:59:16,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712929279] [2025-03-08 15:59:16,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:59:16,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:59:16,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:59:16,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:59:16,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:59:16,868 INFO L87 Difference]: Start difference. First operand 57 states and 84 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 15:59:21,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 15:59:25,527 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 [0] [2025-03-08 15:59:29,531 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 [0] [2025-03-08 15:59:33,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 15:59:33,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:59:33,558 INFO L93 Difference]: Finished difference Result 165 states and 246 transitions. [2025-03-08 15:59:33,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:59:33,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2025-03-08 15:59:33,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:59:33,663 INFO L225 Difference]: With dead ends: 165 [2025-03-08 15:59:33,663 INFO L226 Difference]: Without dead ends: 111 [2025-03-08 15:59:33,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:59:33,664 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 80 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:59:33,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 232 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 4 Unknown, 0 Unchecked, 16.6s Time] [2025-03-08 15:59:33,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-08 15:59:33,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 59. [2025-03-08 15:59:33,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 15:59:33,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2025-03-08 15:59:33,673 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 125 [2025-03-08 15:59:33,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:59:33,674 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2025-03-08 15:59:33,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 15:59:33,674 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2025-03-08 15:59:33,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 15:59:33,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:59:33,675 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:59:33,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-08 15:59:33,875 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 15:59:33,876 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:59:33,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:59:33,876 INFO L85 PathProgramCache]: Analyzing trace with hash 499560017, now seen corresponding path program 1 times [2025-03-08 15:59:33,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:59:33,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445505371] [2025-03-08 15:59:33,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:59:33,877 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 15:59:33,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:59:33,880 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 15:59:33,881 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 15:59:33,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 15:59:34,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 15:59:34,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:59:34,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:59:34,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 15:59:34,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:59:37,864 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 15:59:37,864 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:59:37,864 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:59:37,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445505371] [2025-03-08 15:59:37,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445505371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:59:37,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:59:37,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 15:59:37,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269699335] [2025-03-08 15:59:37,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:59:37,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:59:37,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:59:37,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:59:37,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:59:37,867 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 15:59:42,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:59:46,360 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 15:59:46,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:59:46,365 INFO L93 Difference]: Finished difference Result 169 states and 248 transitions. [2025-03-08 15:59:46,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:59:46,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2025-03-08 15:59:46,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:59:46,474 INFO L225 Difference]: With dead ends: 169 [2025-03-08 15:59:46,474 INFO L226 Difference]: Without dead ends: 113 [2025-03-08 15:59:46,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:59:46,475 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 14 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:59:46,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 157 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 10 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2025-03-08 15:59:46,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-08 15:59:46,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2025-03-08 15:59:46,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 15:59:46,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 160 transitions. [2025-03-08 15:59:46,487 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 160 transitions. Word has length 125 [2025-03-08 15:59:46,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:59:46,490 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 160 transitions. [2025-03-08 15:59:46,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 15:59:46,490 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 160 transitions. [2025-03-08 15:59:46,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 15:59:46,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:59:46,491 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:59:46,517 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 (4)] Ended with exit code 0 [2025-03-08 15:59:46,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 15:59:46,692 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:59:46,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:59:46,692 INFO L85 PathProgramCache]: Analyzing trace with hash 825156241, now seen corresponding path program 1 times [2025-03-08 15:59:46,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:59:46,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374108566] [2025-03-08 15:59:46,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:59:46,693 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 15:59:46,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:59:46,697 INFO L229 MonitoredProcess]: Starting monitored process 5 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 15:59:46,697 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 (5)] Waiting until timeout for monitored process [2025-03-08 15:59:46,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 15:59:47,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 15:59:47,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:59:47,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:59:47,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 15:59:47,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:59:50,644 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 15:59:50,645 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:59:50,645 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:59:50,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374108566] [2025-03-08 15:59:50,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374108566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:59:50,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:59:50,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:59:50,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867653019] [2025-03-08 15:59:50,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:59:50,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:59:50,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:59:50,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:59:50,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:59:50,646 INFO L87 Difference]: Start difference. First operand 111 states and 160 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 15:59:55,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 16:00:00,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 16:00:04,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 16:00:08,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 16:00:12,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 16:00:16,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 16:00:20,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 16:00:24,985 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 16:00:28,993 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 []