./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-10.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 4caff26fc73638e5f12efd7078239ddc60605dcfb854b96620a2374df91a448f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:28:06,237 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:28:06,293 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:28:06,296 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:28:06,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:28:06,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:28:06,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:28:06,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:28:06,319 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:28:06,319 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:28:06,320 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:28:06,320 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:28:06,320 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:28:06,320 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:28:06,321 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:28:06,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:28:06,321 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:28:06,321 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:28:06,321 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:28:06,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:28:06,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:28:06,321 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:28:06,321 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:28:06,321 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:28:06,321 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:28:06,321 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:28:06,321 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:28:06,321 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:28:06,321 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:28:06,321 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:28:06,321 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:28:06,322 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:28:06,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:28:06,322 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:28:06,322 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:28:06,322 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:28:06,322 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:28:06,322 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:28:06,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:28:06,322 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:28:06,322 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:28:06,322 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:28:06,322 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:28:06,322 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 -> 4caff26fc73638e5f12efd7078239ddc60605dcfb854b96620a2374df91a448f [2025-03-08 14:28:06,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:28:06,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:28:06,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:28:06,549 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:28:06,549 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:28:06,550 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-10.i [2025-03-08 14:28:07,690 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe1953834/1fb57b1d1b874a448630074d28104c78/FLAGaafd70f72 [2025-03-08 14:28:07,963 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:28:07,963 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-10.i [2025-03-08 14:28:07,977 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe1953834/1fb57b1d1b874a448630074d28104c78/FLAGaafd70f72 [2025-03-08 14:28:08,254 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe1953834/1fb57b1d1b874a448630074d28104c78 [2025-03-08 14:28:08,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:28:08,257 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:28:08,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:28:08,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:28:08,262 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:28:08,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:28:08" (1/1) ... [2025-03-08 14:28:08,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c9750b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:08, skipping insertion in model container [2025-03-08 14:28:08,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:28:08" (1/1) ... [2025-03-08 14:28:08,283 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:28:08,386 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-10.i[915,928] [2025-03-08 14:28:08,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:28:08,425 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:28:08,435 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-10.i[915,928] [2025-03-08 14:28:08,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:28:08,469 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:28:08,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:08 WrapperNode [2025-03-08 14:28:08,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:28:08,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:28:08,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:28:08,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:28:08,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:08" (1/1) ... [2025-03-08 14:28:08,481 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:08" (1/1) ... [2025-03-08 14:28:08,495 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2025-03-08 14:28:08,495 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:28:08,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:28:08,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:28:08,496 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:28:08,504 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:08" (1/1) ... [2025-03-08 14:28:08,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:08" (1/1) ... [2025-03-08 14:28:08,506 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:08" (1/1) ... [2025-03-08 14:28:08,523 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 14:28:08,523 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:08" (1/1) ... [2025-03-08 14:28:08,523 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:08" (1/1) ... [2025-03-08 14:28:08,527 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:08" (1/1) ... [2025-03-08 14:28:08,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:08" (1/1) ... [2025-03-08 14:28:08,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:08" (1/1) ... [2025-03-08 14:28:08,529 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:08" (1/1) ... [2025-03-08 14:28:08,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:28:08,537 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:28:08,537 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:28:08,537 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:28:08,538 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:08" (1/1) ... [2025-03-08 14:28:08,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:28:08,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:28:08,561 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:28:08,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:28:08,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:28:08,580 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:28:08,580 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:28:08,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:28:08,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:28:08,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:28:08,635 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:28:08,636 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:28:08,814 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 14:28:08,814 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:28:08,825 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:28:08,826 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:28:08,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:28:08 BoogieIcfgContainer [2025-03-08 14:28:08,826 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:28:08,828 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:28:08,828 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:28:08,831 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:28:08,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:28:08" (1/3) ... [2025-03-08 14:28:08,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276d7a23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:28:08, skipping insertion in model container [2025-03-08 14:28:08,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:08" (2/3) ... [2025-03-08 14:28:08,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276d7a23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:28:08, skipping insertion in model container [2025-03-08 14:28:08,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:28:08" (3/3) ... [2025-03-08 14:28:08,833 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-10.i [2025-03-08 14:28:08,844 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:28:08,845 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-10.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:28:08,889 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:28:08,898 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;@21189610, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:28:08,899 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:28:08,903 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 14:28:08,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 14:28:08,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:28:08,912 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:28:08,912 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:28:08,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:28:08,916 INFO L85 PathProgramCache]: Analyzing trace with hash 598442101, now seen corresponding path program 1 times [2025-03-08 14:28:08,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:28:08,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180484545] [2025-03-08 14:28:08,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:28:08,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:28:08,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 14:28:08,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 14:28:08,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:28:08,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:28:09,117 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 14:28:09,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:28:09,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180484545] [2025-03-08 14:28:09,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180484545] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:28:09,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949492045] [2025-03-08 14:28:09,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:28:09,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:28:09,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:28:09,121 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:28:09,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 14:28:09,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 14:28:09,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 14:28:09,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:28:09,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:28:09,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:28:09,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:28:09,264 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 14:28:09,266 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:28:09,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949492045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:28:09,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:28:09,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:28:09,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663243516] [2025-03-08 14:28:09,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:28:09,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:28:09,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:28:09,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:28:09,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:28:09,287 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 14:28:09,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:28:09,309 INFO L93 Difference]: Finished difference Result 96 states and 158 transitions. [2025-03-08 14:28:09,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:28:09,312 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 108 [2025-03-08 14:28:09,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:28:09,316 INFO L225 Difference]: With dead ends: 96 [2025-03-08 14:28:09,317 INFO L226 Difference]: Without dead ends: 48 [2025-03-08 14:28:09,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:28:09,323 INFO L435 NwaCegarLoop]: 68 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, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:28:09,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:28:09,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-08 14:28:09,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-08 14:28:09,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 14:28:09,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2025-03-08 14:28:09,350 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 108 [2025-03-08 14:28:09,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:28:09,350 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2025-03-08 14:28:09,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 14:28:09,351 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2025-03-08 14:28:09,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 14:28:09,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:28:09,355 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:28:09,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 14:28:09,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 14:28:09,569 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:28:09,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:28:09,570 INFO L85 PathProgramCache]: Analyzing trace with hash 123660078, now seen corresponding path program 1 times [2025-03-08 14:28:09,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:28:09,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385715877] [2025-03-08 14:28:09,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:28:09,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:28:09,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 14:28:09,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 14:28:09,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:28:09,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:28:09,979 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 14:28:09,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:28:09,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385715877] [2025-03-08 14:28:09,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385715877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:28:09,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:28:09,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:28:09,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92663921] [2025-03-08 14:28:09,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:28:09,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 14:28:09,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:28:09,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 14:28:09,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:28:09,983 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 14:28:10,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:28:10,008 INFO L93 Difference]: Finished difference Result 93 states and 133 transitions. [2025-03-08 14:28:10,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 14:28:10,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2025-03-08 14:28:10,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:28:10,011 INFO L225 Difference]: With dead ends: 93 [2025-03-08 14:28:10,011 INFO L226 Difference]: Without dead ends: 48 [2025-03-08 14:28:10,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:28:10,013 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:28:10,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:28:10,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-08 14:28:10,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-08 14:28:10,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 14:28:10,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 67 transitions. [2025-03-08 14:28:10,021 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 67 transitions. Word has length 108 [2025-03-08 14:28:10,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:28:10,022 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 67 transitions. [2025-03-08 14:28:10,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 14:28:10,022 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2025-03-08 14:28:10,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 14:28:10,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:28:10,024 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:28:10,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 14:28:10,024 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:28:10,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:28:10,024 INFO L85 PathProgramCache]: Analyzing trace with hash -373708842, now seen corresponding path program 1 times [2025-03-08 14:28:10,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:28:10,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729424091] [2025-03-08 14:28:10,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:28:10,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:28:10,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 14:28:10,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 14:28:10,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:28:10,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:28:10,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2008074375] [2025-03-08 14:28:10,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:28:10,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:28:10,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:28:10,101 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:28:10,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 14:28:10,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 14:28:10,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 14:28:10,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:28:10,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:28:10,213 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:28:10,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 14:28:10,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 14:28:10,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:28:10,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:28:10,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:28:10,300 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:28:10,300 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:28:10,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 14:28:10,503 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,SelfDestructingSolverStorable2 [2025-03-08 14:28:10,505 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 14:28:10,548 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:28:10,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:28:10 BoogieIcfgContainer [2025-03-08 14:28:10,551 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:28:10,552 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:28:10,552 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:28:10,552 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:28:10,552 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:28:08" (3/4) ... [2025-03-08 14:28:10,555 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:28:10,556 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:28:10,557 INFO L158 Benchmark]: Toolchain (without parser) took 2298.95ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 90.8MB in the end (delta: 22.3MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. [2025-03-08 14:28:10,557 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 226.5MB. Free memory is still 146.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:28:10,558 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.20ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 100.4MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:28:10,559 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.46ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 98.1MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:28:10,559 INFO L158 Benchmark]: Boogie Preprocessor took 36.20ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 95.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:28:10,559 INFO L158 Benchmark]: IcfgBuilder took 288.96ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 79.2MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:28:10,559 INFO L158 Benchmark]: TraceAbstraction took 1723.50ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 90.9MB in the end (delta: -12.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:28:10,559 INFO L158 Benchmark]: Witness Printer took 3.92ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 90.8MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:28:10,560 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 226.5MB. Free memory is still 146.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.20ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 100.4MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.46ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 98.1MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.20ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 95.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 288.96ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 79.2MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1723.50ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 90.9MB in the end (delta: -12.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.92ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 90.8MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 61, overapproximation of someBinaryArithmeticDOUBLEoperation at line 42, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryDOUBLEComparisonOperation at line 60, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 74. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 5; [L23] unsigned long int var_1_2 = 8; [L24] double var_1_3 = 9.15; [L25] double var_1_6 = 1000000.875; [L26] double var_1_7 = 49.25; [L27] double var_1_8 = 1000000000.8; [L28] double var_1_9 = 7.85; [L29] double var_1_10 = 15.5; [L30] double var_1_11 = 49.875; [L31] unsigned char var_1_12 = 4; [L32] unsigned char var_1_13 = 0; [L33] unsigned short int var_1_14 = 42290; [L34] unsigned short int var_1_15 = 2; [L35] unsigned char var_1_16 = 32; [L36] double var_1_17 = 64.4; [L37] signed long int var_1_18 = 0; [L38] signed char var_1_19 = -1; VAL [isInitial=0, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=8, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_8=5000000004/5, var_1_9=157/20] [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] FCALL updateLastVariables() [L108] CALL updateVariables() [L68] var_1_2 = __VERIFIER_nondet_ulong() [L69] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_8=5000000004/5, var_1_9=157/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_8=5000000004/5, var_1_9=157/20] [L69] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_8=5000000004/5, var_1_9=157/20] [L70] CALL assume_abort_if_not(var_1_2 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_8=5000000004/5, var_1_9=157/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_8=5000000004/5, var_1_9=157/20] [L70] RET assume_abort_if_not(var_1_2 <= 4294967294) VAL [isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_8=5000000004/5, var_1_9=157/20] [L71] var_1_6 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_7=197/4, var_1_8=5000000004/5, var_1_9=157/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_7=197/4, var_1_8=5000000004/5, var_1_9=157/20] [L72] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_7=197/4, var_1_8=5000000004/5, var_1_9=157/20] [L73] var_1_7 = __VERIFIER_nondet_double() [L74] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_8=5000000004/5, var_1_9=157/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_8=5000000004/5, var_1_9=157/20] [L74] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_8=5000000004/5, var_1_9=157/20] [L75] var_1_8 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_9=157/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_9=157/20] [L76] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_9=157/20] [L77] var_1_9 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L78] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L79] var_1_10 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L80] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L81] var_1_11 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L82] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L83] var_1_13 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L84] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_12=4, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L85] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L85] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L86] var_1_14 = __VERIFIER_nondet_ushort() [L87] CALL assume_abort_if_not(var_1_14 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L87] RET assume_abort_if_not(var_1_14 >= 32767) VAL [isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L88] CALL assume_abort_if_not(var_1_14 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L88] RET assume_abort_if_not(var_1_14 <= 65535) VAL [isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L89] var_1_15 = __VERIFIER_nondet_ushort() [L90] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L90] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L91] CALL assume_abort_if_not(var_1_15 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L91] RET assume_abort_if_not(var_1_15 <= 32766) VAL [isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L92] CALL assume_abort_if_not(var_1_15 != 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L92] RET assume_abort_if_not(var_1_15 != 32767) VAL [isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L93] var_1_16 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L94] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L95] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=254, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=254, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L95] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=254, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L108] RET updateVariables() [L109] CALL step() [L42] var_1_17 = (var_1_8 + var_1_9) [L43] var_1_18 = var_1_15 [L44] var_1_19 = 8 [L45] unsigned long int stepLocal_1 = var_1_2; VAL [isInitial=1, stepLocal_1=0, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=254, var_1_18=1, var_1_19=8, var_1_1=5, var_1_2=0, var_1_3=183/20] [L46] COND FALSE !(\read(var_1_13)) [L53] var_1_12 = var_1_16 VAL [isInitial=1, stepLocal_1=0, var_1_12=254, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=254, var_1_18=1, var_1_19=8, var_1_1=5, var_1_2=0, var_1_3=183/20] [L55] var_1_1 = var_1_12 [L56] unsigned char stepLocal_0 = var_1_12; VAL [isInitial=1, stepLocal_0=254, stepLocal_1=0, var_1_12=254, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=254, var_1_18=1, var_1_19=8, var_1_1=254, var_1_2=0, var_1_3=183/20] [L57] COND FALSE !(stepLocal_0 < var_1_1) VAL [isInitial=1, stepLocal_1=0, var_1_12=254, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=254, var_1_18=1, var_1_19=8, var_1_1=254, var_1_2=0, var_1_3=183/20] [L60] COND TRUE (- var_1_17) == (var_1_6 - var_1_7) [L61] var_1_3 = (var_1_8 + (var_1_9 - ((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))))) VAL [isInitial=1, stepLocal_1=0, var_1_12=254, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=254, var_1_18=1, var_1_19=8, var_1_1=254, var_1_2=0] [L109] RET step() [L110] CALL, EXPR property() [L100-L101] return (((((var_1_1 == ((unsigned long int) var_1_12)) && ((var_1_12 < var_1_1) ? (var_1_3 == ((double) -0.5)) : (((- var_1_17) == (var_1_6 - var_1_7)) ? (var_1_3 == ((double) (var_1_8 + (var_1_9 - ((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))))))) : (var_1_3 == ((double) 50.125))))) && (var_1_13 ? (((var_1_18 / (var_1_14 - var_1_15)) <= var_1_2) ? (var_1_12 == ((unsigned char) var_1_16)) : (var_1_12 == ((unsigned char) 16))) : (var_1_12 == ((unsigned char) var_1_16)))) && (var_1_17 == ((double) (var_1_8 + var_1_9)))) && (var_1_18 == ((signed long int) var_1_15))) && (var_1_19 == ((signed char) 8)) ; VAL [\result=0, isInitial=1, var_1_12=254, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=254, var_1_18=1, var_1_19=8, var_1_1=254, var_1_2=0] [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=254, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=254, var_1_18=1, var_1_19=8, var_1_1=254, var_1_2=0] [L19] reach_error() VAL [isInitial=1, var_1_12=254, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=254, var_1_18=1, var_1_19=8, var_1_1=254, var_1_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 90 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 193 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 134 mSDtfsCounter, 8 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 542 NumberOfCodeBlocks, 542 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 321 ConstructedInterpolants, 0 QuantifiedInterpolants, 343 SizeOfPredicates, 0 NumberOfNonLiveVariables, 253 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1600/1632 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 14:28:10,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-10.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 4caff26fc73638e5f12efd7078239ddc60605dcfb854b96620a2374df91a448f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:28:12,352 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:28:12,427 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:28:12,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:28:12,434 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:28:12,450 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:28:12,450 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:28:12,451 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:28:12,451 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:28:12,451 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:28:12,451 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:28:12,451 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:28:12,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:28:12,452 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:28:12,452 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:28:12,452 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:28:12,452 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:28:12,452 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:28:12,452 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:28:12,452 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:28:12,452 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:28:12,452 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:28:12,452 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:28:12,452 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:28:12,453 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:28:12,453 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:28:12,453 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:28:12,453 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:28:12,453 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:28:12,453 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:28:12,453 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:28:12,453 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:28:12,453 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:28:12,453 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:28:12,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:28:12,454 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:28:12,454 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:28:12,454 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:28:12,454 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:28:12,454 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:28:12,454 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:28:12,454 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:28:12,454 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:28:12,454 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:28:12,454 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:28:12,455 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 -> 4caff26fc73638e5f12efd7078239ddc60605dcfb854b96620a2374df91a448f [2025-03-08 14:28:12,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:28:12,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:28:12,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:28:12,700 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:28:12,700 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:28:12,701 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-10.i [2025-03-08 14:28:13,946 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f9118a79/72cf062cf3574e8b9e34e3a012917089/FLAGd42561bb0 [2025-03-08 14:28:14,109 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:28:14,110 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-10.i [2025-03-08 14:28:14,119 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f9118a79/72cf062cf3574e8b9e34e3a012917089/FLAGd42561bb0 [2025-03-08 14:28:14,129 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f9118a79/72cf062cf3574e8b9e34e3a012917089 [2025-03-08 14:28:14,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:28:14,132 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:28:14,133 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:28:14,133 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:28:14,136 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:28:14,137 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:28:14" (1/1) ... [2025-03-08 14:28:14,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@799fe5e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:14, skipping insertion in model container [2025-03-08 14:28:14,138 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:28:14" (1/1) ... [2025-03-08 14:28:14,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:28:14,252 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-10.i[915,928] [2025-03-08 14:28:14,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:28:14,311 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:28:14,318 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-10.i[915,928] [2025-03-08 14:28:14,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:28:14,360 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:28:14,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:14 WrapperNode [2025-03-08 14:28:14,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:28:14,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:28:14,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:28:14,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:28:14,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:14" (1/1) ... [2025-03-08 14:28:14,380 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:14" (1/1) ... [2025-03-08 14:28:14,399 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2025-03-08 14:28:14,400 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:28:14,401 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:28:14,401 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:28:14,401 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:28:14,406 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:14" (1/1) ... [2025-03-08 14:28:14,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:14" (1/1) ... [2025-03-08 14:28:14,410 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:14" (1/1) ... [2025-03-08 14:28:14,419 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 14:28:14,422 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:14" (1/1) ... [2025-03-08 14:28:14,422 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:14" (1/1) ... [2025-03-08 14:28:14,431 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:14" (1/1) ... [2025-03-08 14:28:14,435 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:14" (1/1) ... [2025-03-08 14:28:14,436 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:14" (1/1) ... [2025-03-08 14:28:14,437 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:14" (1/1) ... [2025-03-08 14:28:14,442 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:28:14,443 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:28:14,443 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:28:14,443 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:28:14,444 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:14" (1/1) ... [2025-03-08 14:28:14,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:28:14,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:28:14,476 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:28:14,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:28:14,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:28:14,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:28:14,497 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:28:14,497 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:28:14,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:28:14,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:28:14,552 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:28:14,554 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:28:18,855 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 14:28:18,855 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:28:18,861 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:28:18,863 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:28:18,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:28:18 BoogieIcfgContainer [2025-03-08 14:28:18,863 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:28:18,865 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:28:18,865 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:28:18,868 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:28:18,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:28:14" (1/3) ... [2025-03-08 14:28:18,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ac40b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:28:18, skipping insertion in model container [2025-03-08 14:28:18,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:14" (2/3) ... [2025-03-08 14:28:18,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ac40b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:28:18, skipping insertion in model container [2025-03-08 14:28:18,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:28:18" (3/3) ... [2025-03-08 14:28:18,870 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-10.i [2025-03-08 14:28:18,879 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:28:18,880 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-10.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:28:18,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:28:18,925 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;@523b8332, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:28:18,927 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:28:18,930 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 14:28:18,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 14:28:18,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:28:18,938 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:28:18,938 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:28:18,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:28:18,942 INFO L85 PathProgramCache]: Analyzing trace with hash 598442101, now seen corresponding path program 1 times [2025-03-08 14:28:18,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:28:18,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1536096261] [2025-03-08 14:28:18,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:28:18,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:28:18,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:28:18,951 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:28:18,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 14:28:19,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 14:28:19,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 14:28:19,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:28:19,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:28:19,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:28:19,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:28:19,320 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2025-03-08 14:28:19,320 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:28:19,321 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:28:19,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1536096261] [2025-03-08 14:28:19,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1536096261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:28:19,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:28:19,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:28:19,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556813407] [2025-03-08 14:28:19,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:28:19,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:28:19,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:28:19,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:28:19,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:28:19,341 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 14:28:19,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:28:19,357 INFO L93 Difference]: Finished difference Result 96 states and 158 transitions. [2025-03-08 14:28:19,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:28:19,359 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 108 [2025-03-08 14:28:19,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:28:19,373 INFO L225 Difference]: With dead ends: 96 [2025-03-08 14:28:19,375 INFO L226 Difference]: Without dead ends: 48 [2025-03-08 14:28:19,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:28:19,379 INFO L435 NwaCegarLoop]: 68 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, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:28:19,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:28:19,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-08 14:28:19,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-08 14:28:19,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 14:28:19,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2025-03-08 14:28:19,404 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 108 [2025-03-08 14:28:19,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:28:19,404 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2025-03-08 14:28:19,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 14:28:19,404 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2025-03-08 14:28:19,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 14:28:19,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:28:19,407 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:28:19,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 14:28:19,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:28:19,608 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:28:19,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:28:19,609 INFO L85 PathProgramCache]: Analyzing trace with hash 123660078, now seen corresponding path program 1 times [2025-03-08 14:28:19,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:28:19,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754321846] [2025-03-08 14:28:19,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:28:19,609 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:28:19,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:28:19,613 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:28:19,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 14:28:19,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 14:28:20,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 14:28:20,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:28:20,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:28:20,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 14:28:20,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:28:20,139 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 14:28:20,139 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:28:20,139 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:28:20,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1754321846] [2025-03-08 14:28:20,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1754321846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:28:20,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:28:20,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:28:20,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634356492] [2025-03-08 14:28:20,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:28:20,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 14:28:20,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:28:20,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 14:28:20,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:28:20,141 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 14:28:24,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:28:24,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:28:24,393 INFO L93 Difference]: Finished difference Result 93 states and 133 transitions. [2025-03-08 14:28:24,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 14:28:24,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2025-03-08 14:28:24,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:28:24,422 INFO L225 Difference]: With dead ends: 93 [2025-03-08 14:28:24,422 INFO L226 Difference]: Without dead ends: 48 [2025-03-08 14:28:24,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:28:24,423 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-08 14:28:24,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-08 14:28:24,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-08 14:28:24,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-08 14:28:24,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 14:28:24,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 67 transitions. [2025-03-08 14:28:24,429 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 67 transitions. Word has length 108 [2025-03-08 14:28:24,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:28:24,430 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 67 transitions. [2025-03-08 14:28:24,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 14:28:24,430 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2025-03-08 14:28:24,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 14:28:24,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:28:24,432 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:28:24,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-08 14:28:24,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:28:24,633 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:28:24,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:28:24,633 INFO L85 PathProgramCache]: Analyzing trace with hash -373708842, now seen corresponding path program 1 times [2025-03-08 14:28:24,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:28:24,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765766159] [2025-03-08 14:28:24,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:28:24,634 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:28:24,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:28:24,636 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:28:24,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 14:28:24,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 14:28:25,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 14:28:25,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:28:25,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:28:25,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 14:28:25,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:29:16,351 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 14:29:24,425 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 14:29:32,496 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 14:29:40,570 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 14:29:48,662 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)