./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-72.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-72.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 03b6c8c21580a8ecb4c1565f878b3061aaf6575afb72b6542060848d80b6e4a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:28:20,078 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:28:20,125 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:28:20,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:28:20,129 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:28:20,144 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:28:20,145 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:28:20,145 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:28:20,145 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:28:20,145 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:28:20,145 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:28:20,145 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:28:20,146 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:28:20,146 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:28:20,146 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:28:20,146 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:28:20,146 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:28:20,146 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:28:20,146 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:28:20,146 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:28:20,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:28:20,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:28:20,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:28:20,148 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:28:20,148 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:28:20,148 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:28:20,148 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:28:20,148 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:28:20,148 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:28:20,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:28:20,148 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:28:20,149 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:28:20,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:28:20,149 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:28:20,149 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:28:20,149 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:28:20,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:28:20,149 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:28:20,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:28:20,149 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:28:20,149 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:28:20,149 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:28:20,149 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:28:20,150 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 -> 03b6c8c21580a8ecb4c1565f878b3061aaf6575afb72b6542060848d80b6e4a3 [2025-03-03 22:28:20,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:28:20,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:28:20,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:28:20,356 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:28:20,356 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:28:20,356 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-72.i [2025-03-03 22:28:21,420 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c89f94459/c9740cef50c54900a86c662e4588a297/FLAG54d57d680 [2025-03-03 22:28:21,662 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:28:21,662 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-72.i [2025-03-03 22:28:21,672 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c89f94459/c9740cef50c54900a86c662e4588a297/FLAG54d57d680 [2025-03-03 22:28:21,690 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c89f94459/c9740cef50c54900a86c662e4588a297 [2025-03-03 22:28:21,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:28:21,693 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:28:21,693 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:28:21,693 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:28:21,697 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:28:21,698 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:28:21" (1/1) ... [2025-03-03 22:28:21,699 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6059ffbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:28:21, skipping insertion in model container [2025-03-03 22:28:21,700 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:28:21" (1/1) ... [2025-03-03 22:28:21,712 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:28:21,812 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_floatingpointinfluence_has-floats_file-72.i[917,930] [2025-03-03 22:28:21,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:28:21,863 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:28:21,872 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_floatingpointinfluence_has-floats_file-72.i[917,930] [2025-03-03 22:28:21,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:28:21,905 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:28:21,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:28:21 WrapperNode [2025-03-03 22:28:21,906 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:28:21,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:28:21,906 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:28:21,907 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:28:21,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:28:21" (1/1) ... [2025-03-03 22:28:21,916 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:28:21" (1/1) ... [2025-03-03 22:28:21,936 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2025-03-03 22:28:21,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:28:21,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:28:21,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:28:21,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:28:21,946 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:28:21" (1/1) ... [2025-03-03 22:28:21,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:28:21" (1/1) ... [2025-03-03 22:28:21,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:28:21" (1/1) ... [2025-03-03 22:28:21,965 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:28:21,965 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:28:21" (1/1) ... [2025-03-03 22:28:21,965 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:28:21" (1/1) ... [2025-03-03 22:28:21,972 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:28:21" (1/1) ... [2025-03-03 22:28:21,976 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:28:21" (1/1) ... [2025-03-03 22:28:21,977 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:28:21" (1/1) ... [2025-03-03 22:28:21,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:28:21" (1/1) ... [2025-03-03 22:28:21,983 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:28:21,983 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:28:21,983 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:28:21,983 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:28:21,984 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:28:21" (1/1) ... [2025-03-03 22:28:21,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:28:21,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:28:22,011 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:28:22,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:28:22,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:28:22,030 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:28:22,030 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:28:22,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:28:22,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:28:22,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:28:22,089 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:28:22,091 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:28:22,277 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 22:28:22,277 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:28:22,284 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:28:22,284 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:28:22,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:28:22 BoogieIcfgContainer [2025-03-03 22:28:22,284 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:28:22,286 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:28:22,286 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:28:22,289 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:28:22,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:28:21" (1/3) ... [2025-03-03 22:28:22,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3837ab26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:28:22, skipping insertion in model container [2025-03-03 22:28:22,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:28:21" (2/3) ... [2025-03-03 22:28:22,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3837ab26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:28:22, skipping insertion in model container [2025-03-03 22:28:22,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:28:22" (3/3) ... [2025-03-03 22:28:22,291 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-72.i [2025-03-03 22:28:22,300 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:28:22,302 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-72.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:28:22,337 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:28:22,344 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;@52384a6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:28:22,344 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:28:22,347 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 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-03 22:28:22,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 22:28:22,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:28:22,354 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-03 22:28:22,354 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:28:22,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:28:22,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1148143783, now seen corresponding path program 1 times [2025-03-03 22:28:22,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:28:22,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731992195] [2025-03-03 22:28:22,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:28:22,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:28:22,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 22:28:22,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 22:28:22,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:28:22,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:28:22,589 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-03 22:28:22,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:28:22,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731992195] [2025-03-03 22:28:22,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731992195] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:28:22,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239185848] [2025-03-03 22:28:22,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:28:22,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:28:22,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:28:22,594 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:28:22,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 22:28:22,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 22:28:22,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 22:28:22,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:28:22,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:28:22,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:28:22,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:28:22,764 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-03 22:28:22,764 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:28:22,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239185848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:28:22,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:28:22,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:28:22,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903954577] [2025-03-03 22:28:22,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:28:22,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:28:22,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:28:22,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:28:22,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:28:22,786 INFO L87 Difference]: Start difference. First operand has 50 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 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-03 22:28:22,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:28:22,801 INFO L93 Difference]: Finished difference Result 94 states and 156 transitions. [2025-03-03 22:28:22,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:28:22,803 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-03 22:28:22,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:28:22,807 INFO L225 Difference]: With dead ends: 94 [2025-03-03 22:28:22,808 INFO L226 Difference]: Without dead ends: 47 [2025-03-03 22:28:22,809 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-03 22:28:22,812 INFO L435 NwaCegarLoop]: 67 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, 67 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:28:22,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:28:22,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-03 22:28:22,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-03 22:28:22,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 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-03 22:28:22,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2025-03-03 22:28:22,862 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 108 [2025-03-03 22:28:22,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:28:22,862 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2025-03-03 22:28:22,862 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-03 22:28:22,863 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2025-03-03 22:28:22,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 22:28:22,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:28:22,864 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-03 22:28:22,875 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-03 22:28:23,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 22:28:23,071 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:28:23,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:28:23,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1608600854, now seen corresponding path program 1 times [2025-03-03 22:28:23,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:28:23,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977724579] [2025-03-03 22:28:23,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:28:23,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:28:23,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 22:28:23,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 22:28:23,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:28:23,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:28:23,432 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-03 22:28:23,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:28:23,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977724579] [2025-03-03 22:28:23,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977724579] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:28:23,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510316275] [2025-03-03 22:28:23,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:28:23,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:28:23,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:28:23,435 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:28:23,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 22:28:23,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 22:28:23,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 22:28:23,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:28:23,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:28:23,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 22:28:23,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:28:23,729 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 246 proven. 33 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-03 22:28:23,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:28:23,904 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-03 22:28:23,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510316275] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:28:23,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:28:23,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 22:28:23,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050206395] [2025-03-03 22:28:23,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:28:23,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 22:28:23,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:28:23,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 22:28:23,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:28:23,907 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 22:28:24,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:28:24,040 INFO L93 Difference]: Finished difference Result 99 states and 138 transitions. [2025-03-03 22:28:24,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 22:28:24,041 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 108 [2025-03-03 22:28:24,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:28:24,043 INFO L225 Difference]: With dead ends: 99 [2025-03-03 22:28:24,043 INFO L226 Difference]: Without dead ends: 55 [2025-03-03 22:28:24,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:28:24,045 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 25 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:28:24,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 99 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:28:24,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-03 22:28:24,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2025-03-03 22:28:24,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-03 22:28:24,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2025-03-03 22:28:24,052 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 108 [2025-03-03 22:28:24,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:28:24,053 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2025-03-03 22:28:24,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 22:28:24,053 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2025-03-03 22:28:24,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 22:28:24,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:28:24,054 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-03 22:28:24,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 22:28:24,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 22:28:24,257 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:28:24,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:28:24,258 INFO L85 PathProgramCache]: Analyzing trace with hash -943556107, now seen corresponding path program 1 times [2025-03-03 22:28:24,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:28:24,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161988178] [2025-03-03 22:28:24,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:28:24,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:28:24,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 22:28:24,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 22:28:24,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:28:24,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:28:24,302 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:28:24,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 22:28:24,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 22:28:24,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:28:24,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:28:24,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:28:24,383 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:28:24,384 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:28:24,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:28:24,388 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-03 22:28:24,458 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:28:24,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:28:24 BoogieIcfgContainer [2025-03-03 22:28:24,462 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:28:24,463 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:28:24,463 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:28:24,463 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:28:24,464 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:28:22" (3/4) ... [2025-03-03 22:28:24,465 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:28:24,465 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:28:24,466 INFO L158 Benchmark]: Toolchain (without parser) took 2773.44ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 48.6MB in the end (delta: 56.6MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. [2025-03-03 22:28:24,466 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:28:24,466 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.43ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 92.5MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:28:24,467 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.16ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 90.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:28:24,467 INFO L158 Benchmark]: Boogie Preprocessor took 42.83ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 88.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:28:24,467 INFO L158 Benchmark]: IcfgBuilder took 301.04ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 72.6MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:28:24,467 INFO L158 Benchmark]: TraceAbstraction took 2176.29ms. Allocated memory is still 142.6MB. Free memory was 72.6MB in the beginning and 48.6MB in the end (delta: 24.0MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2025-03-03 22:28:24,467 INFO L158 Benchmark]: Witness Printer took 2.76ms. Allocated memory is still 142.6MB. Free memory was 48.6MB in the beginning and 48.6MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:28:24,471 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.12ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.43ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 92.5MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.16ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 90.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.83ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 88.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 301.04ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 72.6MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2176.29ms. Allocated memory is still 142.6MB. Free memory was 72.6MB in the beginning and 48.6MB in the end (delta: 24.0MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. * Witness Printer took 2.76ms. Allocated memory is still 142.6MB. Free memory was 48.6MB in the beginning and 48.6MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 51, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 58. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_6 = 0; [L24] unsigned char var_1_8 = 1; [L25] unsigned char var_1_9 = 0; [L26] unsigned long int var_1_10 = 2; [L27] signed char var_1_11 = -16; [L28] signed char var_1_12 = -2; [L29] signed char var_1_13 = -10; [L30] signed char var_1_14 = 4; [L31] double var_1_15 = 256.4; [L32] float var_1_16 = 0.25; [L33] double var_1_17 = 1000000000.2; [L34] double var_1_18 = 50.5; [L35] double var_1_19 = 9.5; [L36] double var_1_20 = 1000000000.4; [L37] signed char var_1_21 = 4; [L38] unsigned short int var_1_22 = 10000; [L39] unsigned char last_1_var_1_1 = 1; [L40] double last_1_var_1_15 = 256.4; VAL [isInitial=0, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=0, var_1_8=1, var_1_9=0] [L100] isInitial = 1 [L101] FCALL initially() [L102] COND TRUE 1 [L103] CALL updateLastVariables() [L92] last_1_var_1_1 = var_1_1 [L93] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=0, var_1_8=1, var_1_9=0] [L103] RET updateLastVariables() [L104] CALL updateVariables() [L63] var_1_6 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_8=1, var_1_9=0] [L64] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_8=1, var_1_9=0] [L65] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=1, var_1_9=0] [L65] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=1, var_1_9=0] [L66] var_1_8 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_9=0] [L67] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_9=0] [L68] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L68] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L69] var_1_9 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0] [L70] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0] [L71] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L71] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L72] var_1_12 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L73] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L74] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L74] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L75] var_1_13 = __VERIFIER_nondet_char() [L76] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L76] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L77] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L77] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L78] var_1_14 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L79] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L80] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L80] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L81] var_1_16 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L82] RET assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L83] CALL assume_abort_if_not(var_1_16 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L83] RET assume_abort_if_not(var_1_16 != 0.0F) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L84] var_1_17 = __VERIFIER_nondet_double() [L85] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L85] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L86] var_1_18 = __VERIFIER_nondet_double() [L87] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L87] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L88] var_1_19 = __VERIFIER_nondet_double() [L89] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L89] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L104] RET updateVariables() [L105] CALL step() [L44] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L47] var_1_11 = (((((var_1_12 + var_1_13)) < ((10 - var_1_14))) ? ((var_1_12 + var_1_13)) : ((10 - var_1_14)))) [L48] var_1_20 = var_1_19 [L49] var_1_21 = 1 [L50] var_1_22 = 10 VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-116, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_19=1000000005, var_1_1=1, var_1_20=1000000005, var_1_21=1, var_1_22=10, var_1_6=1, var_1_8=0, var_1_9=0] [L51] COND FALSE !((var_1_20 + (var_1_20 / var_1_16)) == var_1_20) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-116, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_19=1000000005, var_1_1=1, var_1_20=1000000005, var_1_21=1, var_1_22=10, var_1_6=1, var_1_8=0, var_1_9=0] [L58] COND TRUE var_1_20 < (((((var_1_15) < (var_1_15)) ? (var_1_15) : (var_1_15))) * var_1_15) [L59] var_1_1 = (var_1_6 && ((last_1_var_1_1 || var_1_8) && var_1_9)) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-116, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_19=1000000005, var_1_1=0, var_1_20=1000000005, var_1_21=1, var_1_22=10, var_1_6=1, var_1_8=0, var_1_9=0] [L105] RET step() [L106] CALL, EXPR property() [L96-L97] return (((((((var_1_20 < (((((var_1_15) < (var_1_15)) ? (var_1_15) : (var_1_15))) * var_1_15)) ? (var_1_1 == ((unsigned char) (var_1_6 && ((last_1_var_1_1 || var_1_8) && var_1_9)))) : 1) && (var_1_9 ? (var_1_10 == ((unsigned long int) 2u)) : 1)) && (var_1_11 == ((signed char) (((((var_1_12 + var_1_13)) < ((10 - var_1_14))) ? ((var_1_12 + var_1_13)) : ((10 - var_1_14))))))) && (((var_1_20 + (var_1_20 / var_1_16)) == var_1_20) ? ((var_1_20 >= last_1_var_1_15) ? (var_1_15 == ((double) (var_1_17 - (((((var_1_18 + var_1_19)) < (9.9999999999995E12)) ? ((var_1_18 + var_1_19)) : (9.9999999999995E12)))))) : (var_1_15 == ((double) ((((var_1_17) < ((5.75 + var_1_19))) ? (var_1_17) : ((5.75 + var_1_19))))))) : 1)) && (var_1_20 == ((double) var_1_19))) && (var_1_21 == ((signed char) 1))) && (var_1_22 == ((unsigned short int) 10)) ; VAL [\result=0, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-116, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_19=1000000005, var_1_1=0, var_1_20=1000000005, var_1_21=1, var_1_22=10, var_1_6=1, var_1_8=0, var_1_9=0] [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-116, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_19=1000000005, var_1_1=0, var_1_20=1000000005, var_1_21=1, var_1_22=10, var_1_6=1, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-116, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_19=1000000005, var_1_1=0, var_1_20=1000000005, var_1_21=1, var_1_22=10, var_1_6=1, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 3, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 166 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 107 IncrementalHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 111 mSDtfsCounter, 107 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 332 GetRequests, 322 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=2, InterpolantAutomatonStates: 11, 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, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 540 NumberOfCodeBlocks, 540 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 535 ConstructedInterpolants, 0 QuantifiedInterpolants, 997 SizeOfPredicates, 1 NumberOfNonLiveVariables, 526 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 2589/2720 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 22:28:24,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-72.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 03b6c8c21580a8ecb4c1565f878b3061aaf6575afb72b6542060848d80b6e4a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:28:26,164 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:28:26,245 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:28:26,249 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:28:26,249 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:28:26,268 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:28:26,272 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:28:26,272 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:28:26,272 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:28:26,272 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:28:26,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:28:26,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:28:26,272 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:28:26,272 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:28:26,272 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:28:26,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:28:26,273 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:28:26,273 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:28:26,273 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:28:26,273 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:28:26,273 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:28:26,273 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:28:26,273 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:28:26,273 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:28:26,273 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:28:26,273 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:28:26,273 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:28:26,273 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:28:26,273 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:28:26,273 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:28:26,273 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:28:26,273 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:28:26,273 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:28:26,273 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:28:26,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:28:26,274 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:28:26,274 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:28:26,274 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:28:26,274 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:28:26,274 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:28:26,274 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:28:26,274 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:28:26,274 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:28:26,274 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:28:26,274 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:28:26,274 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 -> 03b6c8c21580a8ecb4c1565f878b3061aaf6575afb72b6542060848d80b6e4a3 [2025-03-03 22:28:26,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:28:26,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:28:26,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:28:26,494 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:28:26,494 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:28:26,495 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-72.i [2025-03-03 22:28:27,632 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94ba2d0b3/325b111589cb49d7919cea72b841370a/FLAGa718bbecb [2025-03-03 22:28:27,817 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:28:27,817 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-72.i [2025-03-03 22:28:27,822 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94ba2d0b3/325b111589cb49d7919cea72b841370a/FLAGa718bbecb [2025-03-03 22:28:27,838 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94ba2d0b3/325b111589cb49d7919cea72b841370a [2025-03-03 22:28:27,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:28:27,842 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:28:27,844 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:28:27,844 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:28:27,847 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:28:27,848 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:28:27" (1/1) ... [2025-03-03 22:28:27,848 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bdb5e87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:28:27, skipping insertion in model container [2025-03-03 22:28:27,850 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:28:27" (1/1) ... [2025-03-03 22:28:27,864 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:28:27,965 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_floatingpointinfluence_has-floats_file-72.i[917,930] [2025-03-03 22:28:28,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:28:28,022 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:28:28,030 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_floatingpointinfluence_has-floats_file-72.i[917,930] [2025-03-03 22:28:28,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:28:28,072 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:28:28,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:28:28 WrapperNode [2025-03-03 22:28:28,074 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:28:28,075 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:28:28,075 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:28:28,075 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:28:28,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:28:28" (1/1) ... [2025-03-03 22:28:28,088 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:28:28" (1/1) ... [2025-03-03 22:28:28,103 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2025-03-03 22:28:28,104 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:28:28,104 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:28:28,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:28:28,104 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:28:28,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:28:28" (1/1) ... [2025-03-03 22:28:28,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:28:28" (1/1) ... [2025-03-03 22:28:28,112 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:28:28" (1/1) ... [2025-03-03 22:28:28,120 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:28:28,120 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:28:28" (1/1) ... [2025-03-03 22:28:28,120 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:28:28" (1/1) ... [2025-03-03 22:28:28,125 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:28:28" (1/1) ... [2025-03-03 22:28:28,126 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:28:28" (1/1) ... [2025-03-03 22:28:28,130 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:28:28" (1/1) ... [2025-03-03 22:28:28,131 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:28:28" (1/1) ... [2025-03-03 22:28:28,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:28:28,133 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:28:28,133 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:28:28,133 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:28:28,134 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:28:28" (1/1) ... [2025-03-03 22:28:28,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:28:28,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:28:28,159 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:28:28,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:28:28,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:28:28,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:28:28,179 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:28:28,179 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:28:28,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:28:28,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:28:28,239 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:28:28,241 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:28:43,827 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 22:28:43,828 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:28:43,835 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:28:43,835 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:28:43,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:28:43 BoogieIcfgContainer [2025-03-03 22:28:43,835 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:28:43,837 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:28:43,837 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:28:43,842 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:28:43,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:28:27" (1/3) ... [2025-03-03 22:28:43,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55ec7ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:28:43, skipping insertion in model container [2025-03-03 22:28:43,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:28:28" (2/3) ... [2025-03-03 22:28:43,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55ec7ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:28:43, skipping insertion in model container [2025-03-03 22:28:43,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:28:43" (3/3) ... [2025-03-03 22:28:43,843 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-72.i [2025-03-03 22:28:43,852 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:28:43,854 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-72.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:28:43,898 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:28:43,909 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;@443c99fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:28:43,910 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:28:43,913 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 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-03 22:28:43,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 22:28:43,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:28:43,920 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-03 22:28:43,921 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:28:43,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:28:43,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1148143783, now seen corresponding path program 1 times [2025-03-03 22:28:43,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:28:43,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1031759676] [2025-03-03 22:28:43,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:28:43,932 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:28:43,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:28:43,934 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:28:43,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 22:28:43,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 22:28:44,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 22:28:44,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:28:44,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:28:44,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:28:44,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:28:44,930 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-03 22:28:44,930 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:28:44,931 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:28:44,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1031759676] [2025-03-03 22:28:44,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1031759676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:28:44,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:28:44,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:28:44,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791904103] [2025-03-03 22:28:44,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:28:44,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:28:44,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:28:44,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:28:44,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:28:44,953 INFO L87 Difference]: Start difference. First operand has 50 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 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-03 22:28:44,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:28:44,977 INFO L93 Difference]: Finished difference Result 94 states and 156 transitions. [2025-03-03 22:28:44,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:28:44,978 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-03 22:28:44,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:28:44,982 INFO L225 Difference]: With dead ends: 94 [2025-03-03 22:28:44,982 INFO L226 Difference]: Without dead ends: 47 [2025-03-03 22:28:44,984 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-03 22:28:44,987 INFO L435 NwaCegarLoop]: 67 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, 67 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:28:44,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:28:44,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-03 22:28:45,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-03 22:28:45,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 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-03 22:28:45,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2025-03-03 22:28:45,017 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 108 [2025-03-03 22:28:45,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:28:45,017 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2025-03-03 22:28:45,017 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-03 22:28:45,017 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2025-03-03 22:28:45,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 22:28:45,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:28:45,019 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-03 22:28:45,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 22:28:45,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:28:45,220 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:28:45,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:28:45,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1608600854, now seen corresponding path program 1 times [2025-03-03 22:28:45,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:28:45,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652978423] [2025-03-03 22:28:45,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:28:45,221 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:28:45,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:28:45,223 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:28:45,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 22:28:45,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 22:28:46,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 22:28:46,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:28:46,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:28:46,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 22:28:46,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:28:48,397 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 246 proven. 33 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-03 22:28:48,398 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:28:50,615 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-03 22:28:50,616 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:28:50,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652978423] [2025-03-03 22:28:50,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1652978423] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:28:50,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 22:28:50,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-03 22:28:50,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848232405] [2025-03-03 22:28:50,616 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 22:28:50,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 22:28:50,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:28:50,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 22:28:50,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:28:50,619 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 22:28:57,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:29:01,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:29:05,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:29:05,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:29:05,388 INFO L93 Difference]: Finished difference Result 99 states and 138 transitions. [2025-03-03 22:29:05,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 22:29:05,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 108 [2025-03-03 22:29:05,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:29:05,518 INFO L225 Difference]: With dead ends: 99 [2025-03-03 22:29:05,518 INFO L226 Difference]: Without dead ends: 55 [2025-03-03 22:29:05,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 208 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:29:05,519 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 25 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2025-03-03 22:29:05,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 97 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 3 Unknown, 0 Unchecked, 14.3s Time] [2025-03-03 22:29:05,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-03 22:29:05,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2025-03-03 22:29:05,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-03 22:29:05,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2025-03-03 22:29:05,529 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 108 [2025-03-03 22:29:05,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:29:05,529 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2025-03-03 22:29:05,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 22:29:05,529 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2025-03-03 22:29:05,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 22:29:05,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:29:05,531 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-03 22:29:05,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 22:29:05,731 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-03 22:29:05,731 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:29:05,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:29:05,733 INFO L85 PathProgramCache]: Analyzing trace with hash -943556107, now seen corresponding path program 1 times [2025-03-03 22:29:05,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:29:05,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1107108543] [2025-03-03 22:29:05,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:29:05,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:29:05,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:29:05,747 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-03 22:29:05,749 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-03 22:29:05,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 22:29:06,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 22:29:06,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:29:06,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:29:06,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 22:29:06,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:29:23,402 WARN L286 SmtUtils]: Spent 8.33s 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-03 22:29:31,603 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 22:29:39,963 WARN L286 SmtUtils]: Spent 8.36s 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-03 22:29:48,277 WARN L286 SmtUtils]: Spent 8.31s 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-03 22:29:56,594 WARN L286 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 22:30:04,892 WARN L286 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)