./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-53.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 59a501260da967ec7da4156f518c44b77b2b3a1718cb97e1e20f43e883a3b147 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:25:59,407 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:25:59,463 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:25:59,469 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:25:59,471 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:25:59,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:25:59,494 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:25:59,494 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:25:59,495 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:25:59,495 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:25:59,496 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:25:59,496 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:25:59,496 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:25:59,496 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:25:59,496 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:25:59,497 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:25:59,497 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:25:59,497 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:25:59,497 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:25:59,497 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:25:59,497 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:25:59,497 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:25:59,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:25:59,497 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:25:59,498 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:25:59,498 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:25:59,498 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:25:59,498 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:25:59,498 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:25:59,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:25:59,498 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:25:59,498 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:25:59,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:25:59,499 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:25:59,499 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:25:59,499 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:25:59,499 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:25:59,499 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:25:59,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:25:59,499 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:25:59,499 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:25:59,499 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:25:59,499 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:25:59,499 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 -> 59a501260da967ec7da4156f518c44b77b2b3a1718cb97e1e20f43e883a3b147 [2025-03-03 22:25:59,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:25:59,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:25:59,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:25:59,714 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:25:59,714 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:25:59,715 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-53.i [2025-03-03 22:26:00,906 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e1e39d0a/cc929b0619024c9c885f3bb5c6e64535/FLAG9be0c275b [2025-03-03 22:26:01,172 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:26:01,173 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-53.i [2025-03-03 22:26:01,184 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e1e39d0a/cc929b0619024c9c885f3bb5c6e64535/FLAG9be0c275b [2025-03-03 22:26:01,200 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e1e39d0a/cc929b0619024c9c885f3bb5c6e64535 [2025-03-03 22:26:01,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:26:01,205 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:26:01,206 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:26:01,207 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:26:01,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:26:01,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:26:01" (1/1) ... [2025-03-03 22:26:01,211 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b69775d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:26:01, skipping insertion in model container [2025-03-03 22:26:01,211 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:26:01" (1/1) ... [2025-03-03 22:26:01,224 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:26:01,319 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-53.i[917,930] [2025-03-03 22:26:01,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:26:01,370 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:26:01,378 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-53.i[917,930] [2025-03-03 22:26:01,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:26:01,418 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:26:01,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:26:01 WrapperNode [2025-03-03 22:26:01,419 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:26:01,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:26:01,421 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:26:01,421 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:26:01,425 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:26:01" (1/1) ... [2025-03-03 22:26:01,435 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:26:01" (1/1) ... [2025-03-03 22:26:01,458 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2025-03-03 22:26:01,464 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:26:01,464 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:26:01,464 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:26:01,464 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:26:01,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:26:01" (1/1) ... [2025-03-03 22:26:01,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:26:01" (1/1) ... [2025-03-03 22:26:01,476 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:26:01" (1/1) ... [2025-03-03 22:26:01,493 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:26:01,494 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:26:01" (1/1) ... [2025-03-03 22:26:01,495 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:26:01" (1/1) ... [2025-03-03 22:26:01,502 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:26:01" (1/1) ... [2025-03-03 22:26:01,503 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:26:01" (1/1) ... [2025-03-03 22:26:01,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:26:01" (1/1) ... [2025-03-03 22:26:01,507 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:26:01" (1/1) ... [2025-03-03 22:26:01,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:26:01,511 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:26:01,511 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:26:01,511 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:26:01,512 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:26:01" (1/1) ... [2025-03-03 22:26:01,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:26:01,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:26:01,534 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:26:01,537 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:26:01,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:26:01,551 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:26:01,552 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:26:01,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:26:01,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:26:01,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:26:01,609 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:26:01,611 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:26:01,839 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 22:26:01,839 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:26:01,846 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:26:01,848 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:26:01,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:26:01 BoogieIcfgContainer [2025-03-03 22:26:01,849 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:26:01,850 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:26:01,851 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:26:01,854 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:26:01,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:26:01" (1/3) ... [2025-03-03 22:26:01,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12bea5d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:26:01, skipping insertion in model container [2025-03-03 22:26:01,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:26:01" (2/3) ... [2025-03-03 22:26:01,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12bea5d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:26:01, skipping insertion in model container [2025-03-03 22:26:01,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:26:01" (3/3) ... [2025-03-03 22:26:01,856 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-53.i [2025-03-03 22:26:01,868 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:26:01,870 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-53.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:26:01,905 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:26:01,913 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;@9c09568, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:26:01,913 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:26:01,916 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 22:26:01,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 22:26:01,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:26:01,924 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:01,925 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:26:01,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:26:01,928 INFO L85 PathProgramCache]: Analyzing trace with hash 2036206317, now seen corresponding path program 1 times [2025-03-03 22:26:01,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:26:01,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952652769] [2025-03-03 22:26:01,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:26:01,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:26:01,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 22:26:02,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 22:26:02,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:26:02,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:26:02,122 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-03 22:26:02,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:26:02,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952652769] [2025-03-03 22:26:02,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952652769] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:26:02,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710235704] [2025-03-03 22:26:02,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:26:02,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:26:02,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:26:02,125 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:26:02,126 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:26:02,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 22:26:02,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 22:26:02,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:26:02,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:26:02,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:26:02,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:26:02,270 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-03 22:26:02,270 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:26:02,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710235704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:26:02,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:26:02,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:26:02,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425169016] [2025-03-03 22:26:02,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:26:02,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:26:02,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:26:02,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:26:02,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:26:02,291 INFO L87 Difference]: Start difference. First operand has 53 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 22:26:02,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:26:02,332 INFO L93 Difference]: Finished difference Result 100 states and 169 transitions. [2025-03-03 22:26:02,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:26:02,338 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2025-03-03 22:26:02,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:26:02,342 INFO L225 Difference]: With dead ends: 100 [2025-03-03 22:26:02,343 INFO L226 Difference]: Without dead ends: 50 [2025-03-03 22:26:02,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 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:26:02,346 INFO L435 NwaCegarLoop]: 73 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, 73 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:26:02,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:26:02,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-03 22:26:02,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-03 22:26:02,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 22:26:02,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2025-03-03 22:26:02,373 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 113 [2025-03-03 22:26:02,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:26:02,373 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2025-03-03 22:26:02,373 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 22:26:02,374 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2025-03-03 22:26:02,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 22:26:02,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:26:02,376 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:02,383 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:26:02,577 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:26:02,578 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:26:02,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:26:02,578 INFO L85 PathProgramCache]: Analyzing trace with hash 233659755, now seen corresponding path program 1 times [2025-03-03 22:26:02,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:26:02,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681752905] [2025-03-03 22:26:02,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:26:02,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:26:02,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 22:26:02,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 22:26:02,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:26:02,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:26:03,869 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 42 proven. 93 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2025-03-03 22:26:03,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:26:03,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681752905] [2025-03-03 22:26:03,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681752905] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:26:03,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643319442] [2025-03-03 22:26:03,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:26:03,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:26:03,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:26:03,872 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:26:03,874 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:26:03,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 22:26:03,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 22:26:03,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:26:03,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:26:03,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-03 22:26:03,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:26:05,056 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 218 proven. 147 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2025-03-03 22:26:05,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:26:05,785 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 30 proven. 156 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2025-03-03 22:26:05,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643319442] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:26:05,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:26:05,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 15] total 33 [2025-03-03 22:26:05,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631968814] [2025-03-03 22:26:05,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:26:05,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-03 22:26:05,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:26:05,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-03 22:26:05,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=739, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 22:26:05,790 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand has 33 states, 31 states have (on average 2.774193548387097) internal successors, (86), 30 states have internal predecessors, (86), 10 states have call successors, (52), 5 states have call predecessors, (52), 12 states have return successors, (53), 9 states have call predecessors, (53), 10 states have call successors, (53) [2025-03-03 22:26:06,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:26:06,289 INFO L93 Difference]: Finished difference Result 135 states and 181 transitions. [2025-03-03 22:26:06,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 22:26:06,289 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 2.774193548387097) internal successors, (86), 30 states have internal predecessors, (86), 10 states have call successors, (52), 5 states have call predecessors, (52), 12 states have return successors, (53), 9 states have call predecessors, (53), 10 states have call successors, (53) Word has length 113 [2025-03-03 22:26:06,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:26:06,291 INFO L225 Difference]: With dead ends: 135 [2025-03-03 22:26:06,291 INFO L226 Difference]: Without dead ends: 88 [2025-03-03 22:26:06,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=570, Invalid=1236, Unknown=0, NotChecked=0, Total=1806 [2025-03-03 22:26:06,292 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 141 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 22:26:06,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 218 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 22:26:06,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-03 22:26:06,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 70. [2025-03-03 22:26:06,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 22:26:06,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2025-03-03 22:26:06,309 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 113 [2025-03-03 22:26:06,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:26:06,309 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2025-03-03 22:26:06,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 2.774193548387097) internal successors, (86), 30 states have internal predecessors, (86), 10 states have call successors, (52), 5 states have call predecessors, (52), 12 states have return successors, (53), 9 states have call predecessors, (53), 10 states have call successors, (53) [2025-03-03 22:26:06,310 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2025-03-03 22:26:06,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 22:26:06,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:26:06,312 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:06,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 22:26:06,517 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:26:06,517 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:26:06,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:26:06,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1312250369, now seen corresponding path program 1 times [2025-03-03 22:26:06,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:26:06,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798777952] [2025-03-03 22:26:06,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:26:06,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:26:06,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 22:26:06,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 22:26:06,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:26:06,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:26:06,599 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:26:06,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 22:26:06,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 22:26:06,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:26:06,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:26:06,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:26:06,708 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:26:06,709 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:26:06,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:26:06,713 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-03 22:26:06,784 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:26:06,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:26:06 BoogieIcfgContainer [2025-03-03 22:26:06,789 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:26:06,790 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:26:06,791 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:26:06,791 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:26:06,791 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:26:01" (3/4) ... [2025-03-03 22:26:06,793 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:26:06,794 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:26:06,795 INFO L158 Benchmark]: Toolchain (without parser) took 5589.37ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 105.0MB in the beginning and 167.0MB in the end (delta: -62.0MB). Peak memory consumption was 128.3MB. Max. memory is 16.1GB. [2025-03-03 22:26:06,795 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:26:06,797 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.60ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 91.8MB in the end (delta: 12.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:26:06,797 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.80ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 89.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:26:06,797 INFO L158 Benchmark]: Boogie Preprocessor took 44.05ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 86.1MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:26:06,798 INFO L158 Benchmark]: IcfgBuilder took 337.87ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 69.4MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:26:06,798 INFO L158 Benchmark]: TraceAbstraction took 4939.38ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 68.3MB in the beginning and 167.1MB in the end (delta: -98.9MB). Peak memory consumption was 94.8MB. Max. memory is 16.1GB. [2025-03-03 22:26:06,798 INFO L158 Benchmark]: Witness Printer took 3.53ms. Allocated memory is still 335.5MB. Free memory was 167.1MB in the beginning and 167.0MB in the end (delta: 106.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:26:06,800 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.49ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.60ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 91.8MB in the end (delta: 12.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.80ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 89.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.05ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 86.1MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 337.87ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 69.4MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4939.38ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 68.3MB in the beginning and 167.1MB in the end (delta: -98.9MB). Peak memory consumption was 94.8MB. Max. memory is 16.1GB. * Witness Printer took 3.53ms. Allocated memory is still 335.5MB. Free memory was 167.1MB in the beginning and 167.0MB in the end (delta: 106.2kB). 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 someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 44, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 99. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 5; [L23] unsigned long int var_1_3 = 1456677701; [L24] unsigned long int var_1_4 = 1000000000; [L25] unsigned long int var_1_5 = 1; [L26] unsigned char var_1_6 = 0; [L27] unsigned char var_1_7 = 0; [L28] unsigned char var_1_8 = 0; [L29] double var_1_9 = 256.5; [L30] double var_1_10 = 8.8; [L31] unsigned char var_1_11 = 1; [L32] unsigned short int var_1_12 = 16; [L33] unsigned long int var_1_13 = 3110219175; [L34] unsigned short int var_1_14 = 128; [L35] unsigned char var_1_15 = 1; [L36] unsigned char var_1_16 = 0; VAL [isInitial=0, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L103] isInitial = 1 [L104] FCALL initially() [L105] COND TRUE 1 [L106] FCALL updateLastVariables() [L107] CALL updateVariables() [L67] var_1_3 = __VERIFIER_nondet_ulong() [L68] CALL assume_abort_if_not(var_1_3 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L68] RET assume_abort_if_not(var_1_3 >= 1073741823) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L69] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L69] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L70] var_1_4 = __VERIFIER_nondet_ulong() [L71] CALL assume_abort_if_not(var_1_4 >= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L71] RET assume_abort_if_not(var_1_4 >= 536870911) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L72] CALL assume_abort_if_not(var_1_4 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L72] RET assume_abort_if_not(var_1_4 <= 1073741823) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L73] var_1_5 = __VERIFIER_nondet_ulong() [L74] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L74] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L75] CALL assume_abort_if_not(var_1_5 <= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L75] RET assume_abort_if_not(var_1_5 <= 536870911) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L76] var_1_7 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_8=0, var_1_9=513/2] [L77] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_8=0, var_1_9=513/2] [L78] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=513/2] [L78] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=513/2] [L79] var_1_9 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L80] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L81] var_1_10 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L82] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L83] var_1_11 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L84] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L85] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L85] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L86] var_1_13 = __VERIFIER_nondet_ulong() [L87] CALL assume_abort_if_not(var_1_13 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L87] RET assume_abort_if_not(var_1_13 >= 2147483647) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L88] CALL assume_abort_if_not(var_1_13 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L88] RET assume_abort_if_not(var_1_13 <= 4294967295) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L89] var_1_14 = __VERIFIER_nondet_ushort() [L90] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L90] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L91] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L91] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L92] var_1_16 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L93] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L94] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L94] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L107] RET updateVariables() [L108] CALL step() [L40] var_1_6 = var_1_7 VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L41] COND TRUE var_1_5 <= (var_1_13 - var_1_4) [L42] var_1_12 = ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))) VAL [isInitial=1, var_1_11=1, var_1_12=65534, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L44] COND TRUE (var_1_9 * 16.5f) > var_1_10 [L45] var_1_15 = (! var_1_11) VAL [isInitial=1, var_1_11=1, var_1_12=65534, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=0, var_1_16=1, var_1_1=5, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L49] var_1_1 = (var_1_12 + (var_1_3 - (var_1_4 - var_1_12))) [L50] signed long int stepLocal_1 = (((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)); [L51] unsigned long int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=6442450943, stepLocal_1=65534, var_1_11=1, var_1_12=65534, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=0, var_1_16=1, var_1_1=5905711100, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L52] COND TRUE stepLocal_1 != ((((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3))) VAL [isInitial=1, stepLocal_0=6442450943, var_1_11=1, var_1_12=65534, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=0, var_1_16=1, var_1_1=5905711100, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L53] COND FALSE !(var_1_9 == var_1_10) VAL [isInitial=1, stepLocal_0=6442450943, var_1_11=1, var_1_12=65534, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=0, var_1_16=1, var_1_1=5905711100, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L108] RET step() [L109] CALL, EXPR property() [L99-L100] return ((((var_1_1 == ((unsigned long int) (var_1_12 + (var_1_3 - (var_1_4 - var_1_12))))) && (var_1_6 == ((unsigned char) var_1_7))) && ((((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12))) != ((((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3)))) ? ((var_1_9 == var_1_10) ? (var_1_6 ? ((var_1_3 >= var_1_12) ? (var_1_8 == ((unsigned char) (var_1_7 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_7))) : 1) : 1) : (var_1_8 == ((unsigned char) var_1_11)))) && ((var_1_5 <= (var_1_13 - var_1_4)) ? (var_1_12 == ((unsigned short int) ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))))) : 1)) && (((var_1_9 * 16.5f) > var_1_10) ? (var_1_15 == ((unsigned char) (! var_1_11))) : (var_1_15 == ((unsigned char) (var_1_11 && var_1_16)))) ; VAL [\result=0, isInitial=1, var_1_11=1, var_1_12=65534, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=0, var_1_16=1, var_1_1=5905711100, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=1, var_1_12=65534, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=0, var_1_16=1, var_1_1=5905711100, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_11=1, var_1_12=65534, var_1_13=-2305843000623759361, var_1_14=65534, var_1_15=0, var_1_16=1, var_1_1=5905711100, var_1_3=6442450943, var_1_4=536870911, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 3, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 146 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 141 mSDsluCounter, 291 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 165 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 389 IncrementalHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 126 mSDtfsCounter, 389 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 364 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=2, InterpolantAutomatonStates: 28, 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, 18 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 566 NumberOfCodeBlocks, 566 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 560 ConstructedInterpolants, 0 QuantifiedInterpolants, 2949 SizeOfPredicates, 10 NumberOfNonLiveVariables, 520 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 2630/3060 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:26:06,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-53.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 59a501260da967ec7da4156f518c44b77b2b3a1718cb97e1e20f43e883a3b147 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:26:08,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:26:08,801 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:26:08,806 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:26:08,806 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:26:08,820 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:26:08,821 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:26:08,821 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:26:08,821 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:26:08,821 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:26:08,821 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:26:08,822 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:26:08,822 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:26:08,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:26:08,822 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:26:08,822 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:26:08,822 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:26:08,823 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:26:08,824 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:26:08,824 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:26:08,824 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:26:08,824 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:26:08,824 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:26:08,824 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:26:08,824 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:26:08,824 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:26:08,824 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:26:08,824 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:26:08,824 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:26:08,824 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:26:08,826 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:26:08,826 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:26:08,826 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:26:08,826 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:26:08,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:26:08,826 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:26:08,826 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:26:08,826 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:26:08,826 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:26:08,826 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:26:08,826 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:26:08,826 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:26:08,826 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:26:08,826 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:26:08,826 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:26:08,826 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 -> 59a501260da967ec7da4156f518c44b77b2b3a1718cb97e1e20f43e883a3b147 [2025-03-03 22:26:09,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:26:09,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:26:09,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:26:09,079 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:26:09,081 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:26:09,082 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-53.i [2025-03-03 22:26:10,261 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b7c42923/f8e10c37ed6140c689fad18f09b7bb77/FLAG663b72eae [2025-03-03 22:26:10,465 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:26:10,466 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-53.i [2025-03-03 22:26:10,473 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b7c42923/f8e10c37ed6140c689fad18f09b7bb77/FLAG663b72eae [2025-03-03 22:26:10,488 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b7c42923/f8e10c37ed6140c689fad18f09b7bb77 [2025-03-03 22:26:10,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:26:10,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:26:10,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:26:10,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:26:10,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:26:10,497 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:26:10" (1/1) ... [2025-03-03 22:26:10,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f038f41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:26:10, skipping insertion in model container [2025-03-03 22:26:10,498 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:26:10" (1/1) ... [2025-03-03 22:26:10,513 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:26:10,609 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-53.i[917,930] [2025-03-03 22:26:10,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:26:10,647 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:26:10,658 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-53.i[917,930] [2025-03-03 22:26:10,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:26:10,682 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:26:10,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:26:10 WrapperNode [2025-03-03 22:26:10,682 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:26:10,683 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:26:10,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:26:10,683 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:26:10,688 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:26:10" (1/1) ... [2025-03-03 22:26:10,699 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:26:10" (1/1) ... [2025-03-03 22:26:10,721 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2025-03-03 22:26:10,722 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:26:10,723 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:26:10,723 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:26:10,723 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:26:10,729 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:26:10" (1/1) ... [2025-03-03 22:26:10,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:26:10" (1/1) ... [2025-03-03 22:26:10,731 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:26:10" (1/1) ... [2025-03-03 22:26:10,744 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:26:10,745 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:26:10" (1/1) ... [2025-03-03 22:26:10,745 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:26:10" (1/1) ... [2025-03-03 22:26:10,754 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:26:10" (1/1) ... [2025-03-03 22:26:10,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:26:10" (1/1) ... [2025-03-03 22:26:10,756 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:26:10" (1/1) ... [2025-03-03 22:26:10,757 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:26:10" (1/1) ... [2025-03-03 22:26:10,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:26:10,763 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:26:10,763 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:26:10,763 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:26:10,764 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:26:10" (1/1) ... [2025-03-03 22:26:10,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:26:10,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:26:10,791 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:26:10,794 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:26:10,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:26:10,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:26:10,817 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:26:10,817 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:26:10,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:26:10,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:26:10,881 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:26:10,884 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:26:11,198 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 22:26:11,198 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:26:11,208 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:26:11,208 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:26:11,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:26:11 BoogieIcfgContainer [2025-03-03 22:26:11,209 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:26:11,211 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:26:11,212 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:26:11,215 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:26:11,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:26:10" (1/3) ... [2025-03-03 22:26:11,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264efd95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:26:11, skipping insertion in model container [2025-03-03 22:26:11,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:26:10" (2/3) ... [2025-03-03 22:26:11,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264efd95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:26:11, skipping insertion in model container [2025-03-03 22:26:11,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:26:11" (3/3) ... [2025-03-03 22:26:11,218 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-53.i [2025-03-03 22:26:11,227 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:26:11,229 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-53.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:26:11,263 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:26:11,270 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;@13a943c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:26:11,271 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:26:11,273 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 22:26:11,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 22:26:11,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:26:11,280 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:11,281 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:26:11,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:26:11,286 INFO L85 PathProgramCache]: Analyzing trace with hash 2036206317, now seen corresponding path program 1 times [2025-03-03 22:26:11,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:26:11,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926283937] [2025-03-03 22:26:11,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:26:11,294 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:26:11,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:26:11,310 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:26:11,311 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:26:11,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 22:26:11,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 22:26:11,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:26:11,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:26:11,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:26:11,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:26:11,576 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-03-03 22:26:11,577 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:26:11,577 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:26:11,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926283937] [2025-03-03 22:26:11,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926283937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:26:11,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:26:11,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:26:11,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482659787] [2025-03-03 22:26:11,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:26:11,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:26:11,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:26:11,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:26:11,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:26:11,604 INFO L87 Difference]: Start difference. First operand has 53 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 22:26:11,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:26:11,638 INFO L93 Difference]: Finished difference Result 100 states and 169 transitions. [2025-03-03 22:26:11,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:26:11,640 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2025-03-03 22:26:11,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:26:11,646 INFO L225 Difference]: With dead ends: 100 [2025-03-03 22:26:11,646 INFO L226 Difference]: Without dead ends: 50 [2025-03-03 22:26:11,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 112 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:26:11,650 INFO L435 NwaCegarLoop]: 73 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, 73 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:26:11,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:26:11,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-03 22:26:11,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-03 22:26:11,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 22:26:11,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2025-03-03 22:26:11,683 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 113 [2025-03-03 22:26:11,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:26:11,683 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2025-03-03 22:26:11,683 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 22:26:11,683 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2025-03-03 22:26:11,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 22:26:11,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:26:11,687 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:11,694 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:26:11,888 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:26:11,889 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:26:11,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:26:11,889 INFO L85 PathProgramCache]: Analyzing trace with hash 233659755, now seen corresponding path program 1 times [2025-03-03 22:26:11,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:26:11,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118143830] [2025-03-03 22:26:11,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:26:11,890 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:26:11,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:26:11,892 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:26:11,893 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:26:11,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 22:26:12,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 22:26:12,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:26:12,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:26:12,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 22:26:12,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:26:13,087 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 80 proven. 168 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-03 22:26:13,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:26:13,313 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:26:13,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118143830] [2025-03-03 22:26:13,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1118143830] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:26:13,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [869966109] [2025-03-03 22:26:13,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:26:13,314 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 22:26:13,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 22:26:13,318 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 22:26:13,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-03-03 22:26:13,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 22:26:13,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 22:26:13,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:26:13,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:26:13,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 22:26:13,651 INFO L279 TraceCheckSpWp]: Computing forward predicates...