./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-53.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 59c9e2a56212f756d7a327fbbde699477ef0467f6f8e097651003bbcb4a09b39 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:21:51,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:21:52,007 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:21:52,011 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:21:52,011 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:21:52,035 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:21:52,036 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:21:52,036 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:21:52,036 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:21:52,036 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:21:52,037 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:21:52,037 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:21:52,037 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:21:52,038 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:21:52,038 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:21:52,038 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:21:52,038 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:21:52,038 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:21:52,038 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:21:52,038 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:21:52,038 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:21:52,038 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:21:52,039 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:21:52,039 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:21:52,039 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:21:52,039 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:21:52,039 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:21:52,039 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:21:52,039 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:21:52,039 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:21:52,039 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:21:52,039 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:21:52,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:21:52,040 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:21:52,040 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:21:52,040 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:21:52,040 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:21:52,040 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:21:52,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:21:52,040 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:21:52,040 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:21:52,041 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:21:52,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:21:52,041 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 -> 59c9e2a56212f756d7a327fbbde699477ef0467f6f8e097651003bbcb4a09b39 [2025-03-03 23:21:52,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:21:52,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:21:52,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:21:52,281 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:21:52,282 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:21:52,283 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-53.i [2025-03-03 23:21:53,432 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24a49c4ef/b2de745778e9401596a8459ee763872d/FLAG958688b04 [2025-03-03 23:21:53,643 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:21:53,645 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-53.i [2025-03-03 23:21:53,652 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24a49c4ef/b2de745778e9401596a8459ee763872d/FLAG958688b04 [2025-03-03 23:21:53,997 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24a49c4ef/b2de745778e9401596a8459ee763872d [2025-03-03 23:21:53,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:21:54,000 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:21:54,000 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:21:54,000 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:21:54,003 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:21:54,004 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:21:53" (1/1) ... [2025-03-03 23:21:54,004 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2507337a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:21:54, skipping insertion in model container [2025-03-03 23:21:54,004 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:21:53" (1/1) ... [2025-03-03 23:21:54,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:21:54,100 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_loopvsstraightlinecode_25-while_file-53.i[915,928] [2025-03-03 23:21:54,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:21:54,134 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:21:54,140 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_loopvsstraightlinecode_25-while_file-53.i[915,928] [2025-03-03 23:21:54,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:21:54,174 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:21:54,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:21:54 WrapperNode [2025-03-03 23:21:54,175 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:21:54,176 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:21:54,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:21:54,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:21:54,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:21:54" (1/1) ... [2025-03-03 23:21:54,185 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:21:54" (1/1) ... [2025-03-03 23:21:54,200 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2025-03-03 23:21:54,200 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:21:54,200 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:21:54,201 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:21:54,201 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:21:54,206 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:21:54" (1/1) ... [2025-03-03 23:21:54,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:21:54" (1/1) ... [2025-03-03 23:21:54,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:21:54" (1/1) ... [2025-03-03 23:21:54,214 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-03 23:21:54,214 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:21:54" (1/1) ... [2025-03-03 23:21:54,214 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:21:54" (1/1) ... [2025-03-03 23:21:54,217 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:21:54" (1/1) ... [2025-03-03 23:21:54,217 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:21:54" (1/1) ... [2025-03-03 23:21:54,218 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:21:54" (1/1) ... [2025-03-03 23:21:54,218 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:21:54" (1/1) ... [2025-03-03 23:21:54,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:21:54,220 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:21:54,220 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:21:54,220 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:21:54,221 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:21:54" (1/1) ... [2025-03-03 23:21:54,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:21:54,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:21:54,243 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-03 23:21:54,245 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-03 23:21:54,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:21:54,261 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:21:54,262 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:21:54,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:21:54,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:21:54,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:21:54,321 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:21:54,322 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:21:54,484 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 23:21:54,484 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:21:54,498 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:21:54,498 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:21:54,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:21:54 BoogieIcfgContainer [2025-03-03 23:21:54,498 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:21:54,500 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:21:54,500 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:21:54,503 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:21:54,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:21:53" (1/3) ... [2025-03-03 23:21:54,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@709257af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:21:54, skipping insertion in model container [2025-03-03 23:21:54,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:21:54" (2/3) ... [2025-03-03 23:21:54,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@709257af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:21:54, skipping insertion in model container [2025-03-03 23:21:54,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:21:54" (3/3) ... [2025-03-03 23:21:54,505 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-53.i [2025-03-03 23:21:54,517 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:21:54,520 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-53.i that has 2 procedures, 49 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:21:54,572 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:21:54,581 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;@242ec4d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:21:54,583 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:21:54,588 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:21:54,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 23:21:54,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:21:54,599 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:21:54,599 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:21:54,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:21:54,604 INFO L85 PathProgramCache]: Analyzing trace with hash 877161795, now seen corresponding path program 1 times [2025-03-03 23:21:54,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:21:54,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877370139] [2025-03-03 23:21:54,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:21:54,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:21:54,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 23:21:54,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 23:21:54,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:21:54,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:21:54,812 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-03 23:21:54,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:21:54,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877370139] [2025-03-03 23:21:54,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877370139] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:21:54,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728324785] [2025-03-03 23:21:54,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:21:54,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:21:54,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:21:54,816 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-03 23:21:54,818 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-03 23:21:54,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 23:21:54,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 23:21:54,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:21:54,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:21:54,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:21:54,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:21:54,976 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-03 23:21:54,976 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:21:54,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728324785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:21:54,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:21:54,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:21:54,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208121668] [2025-03-03 23:21:54,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:21:54,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:21:54,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:21:54,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:21:54,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:21:54,995 INFO L87 Difference]: Start difference. First operand has 49 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 23:21:55,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:21:55,013 INFO L93 Difference]: Finished difference Result 92 states and 151 transitions. [2025-03-03 23:21:55,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:21:55,015 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 102 [2025-03-03 23:21:55,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:21:55,020 INFO L225 Difference]: With dead ends: 92 [2025-03-03 23:21:55,020 INFO L226 Difference]: Without dead ends: 46 [2025-03-03 23:21:55,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 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-03 23:21:55,026 INFO L435 NwaCegarLoop]: 65 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, 65 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-03 23:21:55,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:21:55,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-03 23:21:55,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-03 23:21:55,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:21:55,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2025-03-03 23:21:55,056 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 102 [2025-03-03 23:21:55,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:21:55,056 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2025-03-03 23:21:55,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 23:21:55,057 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2025-03-03 23:21:55,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 23:21:55,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:21:55,060 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:21:55,068 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-03 23:21:55,260 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-03 23:21:55,261 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:21:55,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:21:55,261 INFO L85 PathProgramCache]: Analyzing trace with hash 352161735, now seen corresponding path program 1 times [2025-03-03 23:21:55,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:21:55,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110694447] [2025-03-03 23:21:55,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:21:55,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:21:55,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 23:21:55,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 23:21:55,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:21:55,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:21:58,346 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 21 proven. 159 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-03-03 23:21:58,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:21:58,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110694447] [2025-03-03 23:21:58,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110694447] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:21:58,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123604116] [2025-03-03 23:21:58,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:21:58,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:21:58,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:21:58,349 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:21:58,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 23:21:58,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 23:21:58,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 23:21:58,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:21:58,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:21:58,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-03 23:21:58,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:22:00,588 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 207 proven. 159 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 23:22:00,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:22:07,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123604116] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:22:07,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 23:22:07,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 23] total 30 [2025-03-03 23:22:07,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388769631] [2025-03-03 23:22:07,810 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 23:22:07,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 23:22:07,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:22:07,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 23:22:07,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=1306, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 23:22:07,815 INFO L87 Difference]: Start difference. First operand 46 states and 65 transitions. Second operand has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 27 states have internal predecessors, (61), 11 states have call successors, (30), 7 states have call predecessors, (30), 9 states have return successors, (30), 11 states have call predecessors, (30), 11 states have call successors, (30) [2025-03-03 23:22:08,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:22:08,953 INFO L93 Difference]: Finished difference Result 142 states and 178 transitions. [2025-03-03 23:22:08,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-03 23:22:08,954 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 27 states have internal predecessors, (61), 11 states have call successors, (30), 7 states have call predecessors, (30), 9 states have return successors, (30), 11 states have call predecessors, (30), 11 states have call successors, (30) Word has length 102 [2025-03-03 23:22:08,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:22:08,955 INFO L225 Difference]: With dead ends: 142 [2025-03-03 23:22:08,955 INFO L226 Difference]: Without dead ends: 99 [2025-03-03 23:22:08,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=584, Invalid=2068, Unknown=0, NotChecked=0, Total=2652 [2025-03-03 23:22:08,957 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 112 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 23:22:08,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 456 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 23:22:08,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-03 23:22:08,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 72. [2025-03-03 23:22:08,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 48 states have internal predecessors, (53), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:22:08,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2025-03-03 23:22:08,975 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 102 [2025-03-03 23:22:08,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:22:08,976 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2025-03-03 23:22:08,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 27 states have internal predecessors, (61), 11 states have call successors, (30), 7 states have call predecessors, (30), 9 states have return successors, (30), 11 states have call predecessors, (30), 11 states have call successors, (30) [2025-03-03 23:22:08,976 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2025-03-03 23:22:08,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 23:22:08,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:22:08,978 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:22:08,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 23:22:09,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 23:22:09,183 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:22:09,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:22:09,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1239665416, now seen corresponding path program 1 times [2025-03-03 23:22:09,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:22:09,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238897976] [2025-03-03 23:22:09,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:22:09,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:22:09,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 23:22:09,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 23:22:09,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:22:09,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:22:09,243 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:22:09,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 23:22:09,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 23:22:09,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:22:09,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:22:09,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:22:09,308 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:22:09,309 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:22:09,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 23:22:09,313 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-03 23:22:09,356 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:22:09,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:22:09 BoogieIcfgContainer [2025-03-03 23:22:09,358 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:22:09,361 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:22:09,361 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:22:09,361 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:22:09,362 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:21:54" (3/4) ... [2025-03-03 23:22:09,364 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:22:09,364 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:22:09,365 INFO L158 Benchmark]: Toolchain (without parser) took 15365.13ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 112.8MB in the beginning and 125.9MB in the end (delta: -13.1MB). Peak memory consumption was 145.9MB. Max. memory is 16.1GB. [2025-03-03 23:22:09,365 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:22:09,366 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.22ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 100.6MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:22:09,366 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.99ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 98.5MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:22:09,366 INFO L158 Benchmark]: Boogie Preprocessor took 18.85ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 97.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:22:09,366 INFO L158 Benchmark]: IcfgBuilder took 278.53ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 81.7MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:22:09,367 INFO L158 Benchmark]: TraceAbstraction took 14858.34ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 81.2MB in the beginning and 126.0MB in the end (delta: -44.8MB). Peak memory consumption was 112.3MB. Max. memory is 16.1GB. [2025-03-03 23:22:09,367 INFO L158 Benchmark]: Witness Printer took 3.19ms. Allocated memory is still 302.0MB. Free memory was 126.0MB in the beginning and 125.9MB in the end (delta: 60.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:22:09,368 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.19ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 175.22ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 100.6MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.99ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 98.5MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.85ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 97.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 278.53ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 81.7MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14858.34ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 81.2MB in the beginning and 126.0MB in the end (delta: -44.8MB). Peak memory consumption was 112.3MB. Max. memory is 16.1GB. * Witness Printer took 3.19ms. Allocated memory is still 302.0MB. Free memory was 126.0MB in the beginning and 125.9MB in the end (delta: 60.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 44, overapproximation of someBinaryArithmeticFLOAToperation at line 43. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 5; [L23] unsigned long int var_1_2 = 500; [L24] unsigned long int var_1_3 = 1456677701; [L25] unsigned long int var_1_4 = 1000000000; [L26] unsigned long int var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 0; [L30] unsigned char var_1_11 = 0; [L31] float var_1_12 = 128.6; [L32] float var_1_13 = 500.4; [L33] float var_1_14 = 8.5; [L34] double var_1_15 = 255.8; [L35] double var_1_16 = 25.75; [L36] float var_1_17 = 1.2; [L37] float var_1_18 = 9.6; VAL [isInitial=0, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=500, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] FCALL updateLastVariables() [L98] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_ulong() [L61] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L61] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L62] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L62] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L63] var_1_3 = __VERIFIER_nondet_ulong() [L64] CALL assume_abort_if_not(var_1_3 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L64] RET assume_abort_if_not(var_1_3 >= 1073741823) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L65] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L65] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L66] var_1_4 = __VERIFIER_nondet_ulong() [L67] CALL assume_abort_if_not(var_1_4 >= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L67] RET assume_abort_if_not(var_1_4 >= 536870911) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L68] CALL assume_abort_if_not(var_1_4 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L68] RET assume_abort_if_not(var_1_4 <= 1073741823) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L69] var_1_5 = __VERIFIER_nondet_ulong() [L70] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L70] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L71] CALL assume_abort_if_not(var_1_5 <= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L71] RET assume_abort_if_not(var_1_5 <= 536870911) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L72] var_1_7 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_8=0] [L73] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_8=0] [L74] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L74] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L75] var_1_11 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L76] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L77] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L77] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L78] var_1_13 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L79] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L80] var_1_14 = __VERIFIER_nondet_float() [L81] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L81] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L82] var_1_16 = __VERIFIER_nondet_double() [L83] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_15=1279/5, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_15=1279/5, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L83] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_15=1279/5, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L84] var_1_18 = __VERIFIER_nondet_float() [L85] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_15=1279/5, var_1_17=6/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_15=1279/5, var_1_17=6/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L85] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_15=1279/5, var_1_17=6/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L98] RET updateVariables() [L99] CALL step() [L41] var_1_1 = (var_1_2 + (var_1_3 - (var_1_4 - var_1_5))) [L42] var_1_6 = var_1_7 [L43] var_1_12 = ((2.55f + var_1_13) - var_1_14) [L44] var_1_15 = ((((var_1_13) > (((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16))))) ? (var_1_13) : (((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16)))))) VAL [isInitial=1, var_1_11=-255, var_1_13=1456677706, var_1_14=1456677706, var_1_15=1456677706, var_1_16=1456677706, var_1_17=6/5, var_1_1=1073741823, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L45] COND FALSE !(var_1_2 >= var_1_1) VAL [isInitial=1, var_1_11=-255, var_1_13=1456677706, var_1_14=1456677706, var_1_15=1456677706, var_1_16=1456677706, var_1_17=6/5, var_1_1=1073741823, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L48] unsigned long int stepLocal_0 = (((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3)); VAL [isInitial=1, stepLocal_0=536870911, var_1_11=-255, var_1_13=1456677706, var_1_14=1456677706, var_1_15=1456677706, var_1_16=1456677706, var_1_17=6/5, var_1_1=1073741823, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L49] COND FALSE !(((((var_1_1) < (var_1_5)) ? (var_1_1) : (var_1_5))) != stepLocal_0) [L56] var_1_8 = var_1_11 VAL [isInitial=1, var_1_11=-255, var_1_13=1456677706, var_1_14=1456677706, var_1_15=1456677706, var_1_16=1456677706, var_1_17=6/5, var_1_1=1073741823, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=-255] [L99] RET step() [L100] CALL, EXPR property() [L90-L91] return (((((var_1_1 == ((unsigned long int) (var_1_2 + (var_1_3 - (var_1_4 - var_1_5))))) && (var_1_6 == ((unsigned char) var_1_7))) && ((((((var_1_1) < (var_1_5)) ? (var_1_1) : (var_1_5))) != ((((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3)))) ? ((var_1_17 == var_1_12) ? (var_1_6 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1) : (var_1_8 == ((unsigned char) var_1_11)))) && (var_1_12 == ((float) ((2.55f + var_1_13) - var_1_14)))) && (var_1_15 == ((double) ((((var_1_13) > (((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16))))) ? (var_1_13) : (((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16))))))))) && ((var_1_2 >= var_1_1) ? (var_1_17 == ((float) (var_1_14 - ((((var_1_13) > (var_1_18)) ? (var_1_13) : (var_1_18)))))) : 1) ; VAL [\result=0, isInitial=1, var_1_11=-255, var_1_13=1456677706, var_1_14=1456677706, var_1_15=1456677706, var_1_16=1456677706, var_1_17=6/5, var_1_1=1073741823, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=-255] [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=-255, var_1_13=1456677706, var_1_14=1456677706, var_1_15=1456677706, var_1_16=1456677706, var_1_17=6/5, var_1_1=1073741823, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=-255] [L19] reach_error() VAL [isInitial=1, var_1_11=-255, var_1_13=1456677706, var_1_14=1456677706, var_1_15=1456677706, var_1_16=1456677706, var_1_17=6/5, var_1_1=1073741823, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=-255] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.8s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 114 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 112 mSDsluCounter, 521 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 393 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 716 IncrementalHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 128 mSDtfsCounter, 716 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 311 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=2, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 27 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 510 NumberOfCodeBlocks, 510 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 404 ConstructedInterpolants, 0 QuantifiedInterpolants, 4478 SizeOfPredicates, 5 NumberOfNonLiveVariables, 478 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 1572/1920 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-03 23:22:09,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_loopvsstraightlinecode_25-while_file-53.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 59c9e2a56212f756d7a327fbbde699477ef0467f6f8e097651003bbcb4a09b39 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:22:11,194 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:22:11,274 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:22:11,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:22:11,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:22:11,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:22:11,300 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:22:11,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:22:11,301 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:22:11,301 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:22:11,301 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:22:11,302 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:22:11,302 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:22:11,302 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:22:11,302 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:22:11,302 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:22:11,302 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:22:11,303 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:22:11,303 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:22:11,303 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:22:11,303 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:22:11,303 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:22:11,303 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:22:11,303 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:22:11,303 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:22:11,303 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:22:11,304 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:22:11,304 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:22:11,304 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:22:11,304 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:22:11,304 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:22:11,304 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:22:11,304 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:22:11,305 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:22:11,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:22:11,305 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:22:11,305 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:22:11,305 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:22:11,305 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:22:11,305 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:22:11,305 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:22:11,305 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:22:11,306 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:22:11,306 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:22:11,306 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:22:11,306 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 -> 59c9e2a56212f756d7a327fbbde699477ef0467f6f8e097651003bbcb4a09b39 [2025-03-03 23:22:11,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:22:11,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:22:11,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:22:11,542 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:22:11,543 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:22:11,543 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-53.i [2025-03-03 23:22:12,688 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d099afdaa/75545eea6bdf4a998dcb4f97e4aeb28f/FLAG81bf7f352 [2025-03-03 23:22:12,881 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:22:12,882 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-53.i [2025-03-03 23:22:12,887 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d099afdaa/75545eea6bdf4a998dcb4f97e4aeb28f/FLAG81bf7f352 [2025-03-03 23:22:12,899 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d099afdaa/75545eea6bdf4a998dcb4f97e4aeb28f [2025-03-03 23:22:12,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:22:12,904 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:22:12,905 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:22:12,906 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:22:12,908 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:22:12,909 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:22:12" (1/1) ... [2025-03-03 23:22:12,910 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b4912ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:12, skipping insertion in model container [2025-03-03 23:22:12,910 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:22:12" (1/1) ... [2025-03-03 23:22:12,921 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:22:13,004 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_loopvsstraightlinecode_25-while_file-53.i[915,928] [2025-03-03 23:22:13,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:22:13,046 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:22:13,053 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_loopvsstraightlinecode_25-while_file-53.i[915,928] [2025-03-03 23:22:13,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:22:13,076 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:22:13,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:13 WrapperNode [2025-03-03 23:22:13,076 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:22:13,077 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:22:13,077 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:22:13,077 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:22:13,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:13" (1/1) ... [2025-03-03 23:22:13,087 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:13" (1/1) ... [2025-03-03 23:22:13,105 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2025-03-03 23:22:13,107 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:22:13,107 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:22:13,107 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:22:13,107 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:22:13,113 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:13" (1/1) ... [2025-03-03 23:22:13,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:13" (1/1) ... [2025-03-03 23:22:13,115 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:13" (1/1) ... [2025-03-03 23:22:13,133 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-03 23:22:13,134 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:13" (1/1) ... [2025-03-03 23:22:13,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:13" (1/1) ... [2025-03-03 23:22:13,145 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:13" (1/1) ... [2025-03-03 23:22:13,146 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:13" (1/1) ... [2025-03-03 23:22:13,147 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:13" (1/1) ... [2025-03-03 23:22:13,151 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:13" (1/1) ... [2025-03-03 23:22:13,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:22:13,154 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:22:13,157 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:22:13,157 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:22:13,158 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:13" (1/1) ... [2025-03-03 23:22:13,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:22:13,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:22:13,185 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-03 23:22:13,191 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-03 23:22:13,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:22:13,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:22:13,208 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:22:13,208 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:22:13,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:22:13,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:22:13,277 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:22:13,279 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:22:15,518 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 23:22:15,518 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:22:15,524 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:22:15,524 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:22:15,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:22:15 BoogieIcfgContainer [2025-03-03 23:22:15,525 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:22:15,526 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:22:15,526 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:22:15,529 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:22:15,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:22:12" (1/3) ... [2025-03-03 23:22:15,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f7ae92b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:22:15, skipping insertion in model container [2025-03-03 23:22:15,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:22:13" (2/3) ... [2025-03-03 23:22:15,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f7ae92b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:22:15, skipping insertion in model container [2025-03-03 23:22:15,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:22:15" (3/3) ... [2025-03-03 23:22:15,531 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-53.i [2025-03-03 23:22:15,540 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:22:15,541 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-53.i that has 2 procedures, 49 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:22:15,575 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:22:15,582 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;@657a458d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:22:15,583 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:22:15,585 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:22:15,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 23:22:15,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:22:15,591 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:22:15,591 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:22:15,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:22:15,595 INFO L85 PathProgramCache]: Analyzing trace with hash 877161795, now seen corresponding path program 1 times [2025-03-03 23:22:15,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:22:15,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1719797688] [2025-03-03 23:22:15,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:22:15,602 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-03 23:22:15,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:22:15,604 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-03 23:22:15,607 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-03 23:22:15,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 23:22:15,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 23:22:15,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:22:15,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:22:15,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:22:15,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:22:15,931 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-03-03 23:22:15,932 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:22:15,932 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:22:15,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1719797688] [2025-03-03 23:22:15,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1719797688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:22:15,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:22:15,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:22:15,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592526608] [2025-03-03 23:22:15,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:22:15,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:22:15,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:22:15,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:22:15,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:22:15,953 INFO L87 Difference]: Start difference. First operand has 49 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 23:22:15,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:22:15,970 INFO L93 Difference]: Finished difference Result 92 states and 151 transitions. [2025-03-03 23:22:15,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:22:15,971 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 102 [2025-03-03 23:22:15,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:22:15,975 INFO L225 Difference]: With dead ends: 92 [2025-03-03 23:22:15,975 INFO L226 Difference]: Without dead ends: 46 [2025-03-03 23:22:15,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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-03 23:22:15,978 INFO L435 NwaCegarLoop]: 65 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, 65 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-03 23:22:15,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:22:15,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-03 23:22:16,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-03 23:22:16,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:22:16,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2025-03-03 23:22:16,023 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 102 [2025-03-03 23:22:16,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:22:16,024 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2025-03-03 23:22:16,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 23:22:16,024 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2025-03-03 23:22:16,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 23:22:16,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:22:16,029 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:22:16,038 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-03 23:22:16,229 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-03 23:22:16,229 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:22:16,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:22:16,230 INFO L85 PathProgramCache]: Analyzing trace with hash 352161735, now seen corresponding path program 1 times [2025-03-03 23:22:16,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:22:16,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5560152] [2025-03-03 23:22:16,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:22:16,231 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-03 23:22:16,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:22:16,258 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-03 23:22:16,259 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-03 23:22:16,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 23:22:16,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 23:22:16,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:22:16,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:22:16,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-03 23:22:16,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:22:54,759 WARN L286 SmtUtils]: Spent 12.00s on a formula simplification that was a NOOP. DAG size: 76 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)