./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-22.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-22.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 332bcce48a0139e2df6284710a9b0ccad22d833566bbd5ef3ad1522424ad9314 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:27:35,876 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:27:35,935 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:27:35,946 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:27:35,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:27:35,972 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:27:35,973 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:27:35,974 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:27:35,974 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:27:35,974 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:27:35,974 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:27:35,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:27:35,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:27:35,975 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:27:35,976 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:27:35,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:27:35,976 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:27:35,976 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:27:35,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:27:35,976 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:27:35,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:27:35,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:27:35,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:27:35,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:27:35,977 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:27:35,977 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:27:35,977 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:27:35,977 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:27:35,977 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:27:35,977 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:27:35,977 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:27:35,977 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:27:35,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:27:35,977 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:27:35,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:27:35,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:27:35,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:27:35,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:27:35,978 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:27:35,978 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:27:35,978 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:27:35,978 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:27:35,979 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:27:35,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:27:35,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:27:35,979 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:27:35,979 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:27:35,979 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:27:35,979 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-jdk21/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 -> 332bcce48a0139e2df6284710a9b0ccad22d833566bbd5ef3ad1522424ad9314 [2025-01-09 12:27:36,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:27:36,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:27:36,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:27:36,245 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:27:36,246 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:27:36,247 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-22.i [2025-01-09 12:27:37,462 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61b49f44f/00aefa4b22ec49bca49af5e629bea834/FLAG24da44353 [2025-01-09 12:27:37,705 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:27:37,706 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-22.i [2025-01-09 12:27:37,713 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61b49f44f/00aefa4b22ec49bca49af5e629bea834/FLAG24da44353 [2025-01-09 12:27:37,724 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61b49f44f/00aefa4b22ec49bca49af5e629bea834 [2025-01-09 12:27:37,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:27:37,727 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:27:37,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:27:37,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:27:37,731 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:27:37,732 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:27:37" (1/1) ... [2025-01-09 12:27:37,732 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55c928ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:37, skipping insertion in model container [2025-01-09 12:27:37,732 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:27:37" (1/1) ... [2025-01-09 12:27:37,748 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:27:37,847 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-22.i[917,930] [2025-01-09 12:27:37,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:27:37,903 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:27:37,912 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-22.i[917,930] [2025-01-09 12:27:37,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:27:37,953 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:27:37,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:37 WrapperNode [2025-01-09 12:27:37,956 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:27:37,957 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:27:37,957 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:27:37,957 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:27:37,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:37" (1/1) ... [2025-01-09 12:27:37,971 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:37" (1/1) ... [2025-01-09 12:27:37,991 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2025-01-09 12:27:37,992 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:27:37,992 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:27:37,992 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:27:37,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:27:38,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:37" (1/1) ... [2025-01-09 12:27:38,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:37" (1/1) ... [2025-01-09 12:27:38,005 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:37" (1/1) ... [2025-01-09 12:27:38,018 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-01-09 12:27:38,018 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:37" (1/1) ... [2025-01-09 12:27:38,019 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:37" (1/1) ... [2025-01-09 12:27:38,022 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:37" (1/1) ... [2025-01-09 12:27:38,023 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:37" (1/1) ... [2025-01-09 12:27:38,026 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:37" (1/1) ... [2025-01-09 12:27:38,027 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:37" (1/1) ... [2025-01-09 12:27:38,028 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:37" (1/1) ... [2025-01-09 12:27:38,030 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:27:38,030 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:27:38,030 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:27:38,030 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:27:38,031 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:37" (1/1) ... [2025-01-09 12:27:38,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:27:38,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:27:38,054 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:27:38,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:27:38,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:27:38,081 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:27:38,082 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:27:38,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:27:38,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:27:38,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:27:38,136 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:27:38,137 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:27:38,347 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 12:27:38,347 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:27:38,357 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:27:38,358 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:27:38,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:27:38 BoogieIcfgContainer [2025-01-09 12:27:38,358 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:27:38,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:27:38,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:27:38,363 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:27:38,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:27:37" (1/3) ... [2025-01-09 12:27:38,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c986c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:27:38, skipping insertion in model container [2025-01-09 12:27:38,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:37" (2/3) ... [2025-01-09 12:27:38,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c986c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:27:38, skipping insertion in model container [2025-01-09 12:27:38,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:27:38" (3/3) ... [2025-01-09 12:27:38,368 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-22.i [2025-01-09 12:27:38,377 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:27:38,378 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-22.i that has 2 procedures, 49 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:27:38,417 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:27:38,425 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;@5551a604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:27:38,425 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:27:38,428 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 12:27:38,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 12:27:38,433 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:27:38,433 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:27:38,434 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:27:38,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:27:38,437 INFO L85 PathProgramCache]: Analyzing trace with hash 387883027, now seen corresponding path program 1 times [2025-01-09 12:27:38,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:27:38,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997340863] [2025-01-09 12:27:38,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:27:38,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:27:38,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 12:27:38,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 12:27:38,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:27:38,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:27:38,570 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-01-09 12:27:38,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:27:38,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997340863] [2025-01-09 12:27:38,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997340863] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:27:38,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541019747] [2025-01-09 12:27:38,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:27:38,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:27:38,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:27:38,574 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:27:38,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 12:27:38,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 12:27:38,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 12:27:38,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:27:38,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:27:38,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:27:38,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:27:38,678 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-01-09 12:27:38,678 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:27:38,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541019747] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:27:38,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:27:38,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:27:38,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995970761] [2025-01-09 12:27:38,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:27:38,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:27:38,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:27:38,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:27:38,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:27:38,703 INFO L87 Difference]: Start difference. First operand has 49 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 12:27:38,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:27:38,718 INFO L93 Difference]: Finished difference Result 91 states and 144 transitions. [2025-01-09 12:27:38,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:27:38,721 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 67 [2025-01-09 12:27:38,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:27:38,725 INFO L225 Difference]: With dead ends: 91 [2025-01-09 12:27:38,726 INFO L226 Difference]: Without dead ends: 45 [2025-01-09 12:27:38,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-01-09 12:27:38,730 INFO L435 NwaCegarLoop]: 63 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, 63 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-01-09 12:27:38,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:27:38,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-09 12:27:38,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-01-09 12:27:38,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 12:27:38,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2025-01-09 12:27:38,755 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 67 [2025-01-09 12:27:38,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:27:38,755 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 63 transitions. [2025-01-09 12:27:38,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 12:27:38,756 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions. [2025-01-09 12:27:38,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 12:27:38,757 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:27:38,757 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:27:38,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 12:27:38,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 12:27:38,958 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:27:38,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:27:38,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1416480909, now seen corresponding path program 1 times [2025-01-09 12:27:38,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:27:38,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428556556] [2025-01-09 12:27:38,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:27:38,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:27:38,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 12:27:39,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 12:27:39,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:27:39,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:27:39,426 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 12:27:39,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:27:39,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428556556] [2025-01-09 12:27:39,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428556556] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:27:39,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:27:39,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:27:39,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558336097] [2025-01-09 12:27:39,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:27:39,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:27:39,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:27:39,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:27:39,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:27:39,429 INFO L87 Difference]: Start difference. First operand 45 states and 63 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 12:27:39,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:27:39,657 INFO L93 Difference]: Finished difference Result 150 states and 212 transitions. [2025-01-09 12:27:39,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 12:27:39,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 67 [2025-01-09 12:27:39,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:27:39,658 INFO L225 Difference]: With dead ends: 150 [2025-01-09 12:27:39,658 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 12:27:39,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 12:27:39,660 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 99 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:27:39,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 139 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:27:39,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 12:27:39,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 77. [2025-01-09 12:27:39,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 12:27:39,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 109 transitions. [2025-01-09 12:27:39,673 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 109 transitions. Word has length 67 [2025-01-09 12:27:39,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:27:39,673 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 109 transitions. [2025-01-09 12:27:39,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 12:27:39,674 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 109 transitions. [2025-01-09 12:27:39,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 12:27:39,674 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:27:39,674 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:27:39,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:27:39,675 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:27:39,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:27:39,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1427838549, now seen corresponding path program 1 times [2025-01-09 12:27:39,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:27:39,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093798595] [2025-01-09 12:27:39,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:27:39,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:27:39,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 12:27:39,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 12:27:39,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:27:39,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:27:40,014 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 12:27:40,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:27:40,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093798595] [2025-01-09 12:27:40,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093798595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:27:40,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:27:40,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:27:40,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725636263] [2025-01-09 12:27:40,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:27:40,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:27:40,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:27:40,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:27:40,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:27:40,017 INFO L87 Difference]: Start difference. First operand 77 states and 109 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 12:27:40,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:27:40,230 INFO L93 Difference]: Finished difference Result 156 states and 220 transitions. [2025-01-09 12:27:40,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 12:27:40,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 68 [2025-01-09 12:27:40,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:27:40,231 INFO L225 Difference]: With dead ends: 156 [2025-01-09 12:27:40,232 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 12:27:40,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 12:27:40,233 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 76 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:27:40,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 157 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:27:40,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 12:27:40,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 78. [2025-01-09 12:27:40,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 57 states have (on average 1.280701754385965) internal successors, (73), 57 states have internal predecessors, (73), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 12:27:40,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2025-01-09 12:27:40,244 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 109 transitions. Word has length 68 [2025-01-09 12:27:40,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:27:40,245 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 109 transitions. [2025-01-09 12:27:40,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 12:27:40,245 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 109 transitions. [2025-01-09 12:27:40,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 12:27:40,246 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:27:40,246 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:27:40,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:27:40,246 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:27:40,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:27:40,246 INFO L85 PathProgramCache]: Analyzing trace with hash -270853557, now seen corresponding path program 1 times [2025-01-09 12:27:40,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:27:40,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529911108] [2025-01-09 12:27:40,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:27:40,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:27:40,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 12:27:40,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 12:27:40,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:27:40,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:27:41,507 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 12:27:41,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:27:41,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529911108] [2025-01-09 12:27:41,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529911108] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:27:41,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:27:41,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 12:27:41,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768697639] [2025-01-09 12:27:41,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:27:41,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 12:27:41,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:27:41,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 12:27:41,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:27:41,512 INFO L87 Difference]: Start difference. First operand 78 states and 109 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 12:27:41,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:27:41,817 INFO L93 Difference]: Finished difference Result 223 states and 309 transitions. [2025-01-09 12:27:41,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 12:27:41,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 68 [2025-01-09 12:27:41,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:27:41,818 INFO L225 Difference]: With dead ends: 223 [2025-01-09 12:27:41,818 INFO L226 Difference]: Without dead ends: 181 [2025-01-09 12:27:41,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:27:41,819 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 128 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:27:41,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 208 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:27:41,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-01-09 12:27:41,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 152. [2025-01-09 12:27:41,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 118 states have (on average 1.305084745762712) internal successors, (154), 119 states have internal predecessors, (154), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 12:27:41,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 212 transitions. [2025-01-09 12:27:41,853 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 212 transitions. Word has length 68 [2025-01-09 12:27:41,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:27:41,853 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 212 transitions. [2025-01-09 12:27:41,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 12:27:41,854 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 212 transitions. [2025-01-09 12:27:41,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 12:27:41,854 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:27:41,856 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:27:41,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:27:41,856 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:27:41,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:27:41,856 INFO L85 PathProgramCache]: Analyzing trace with hash 430211021, now seen corresponding path program 1 times [2025-01-09 12:27:41,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:27:41,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827216396] [2025-01-09 12:27:41,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:27:41,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:27:41,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 12:27:41,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 12:27:41,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:27:41,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:27:41,907 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 12:27:41,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:27:41,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827216396] [2025-01-09 12:27:41,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827216396] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:27:41,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:27:41,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:27:41,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225140817] [2025-01-09 12:27:41,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:27:41,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:27:41,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:27:41,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:27:41,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:27:41,908 INFO L87 Difference]: Start difference. First operand 152 states and 212 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 12:27:41,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:27:41,942 INFO L93 Difference]: Finished difference Result 271 states and 381 transitions. [2025-01-09 12:27:41,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:27:41,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 68 [2025-01-09 12:27:41,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:27:41,945 INFO L225 Difference]: With dead ends: 271 [2025-01-09 12:27:41,945 INFO L226 Difference]: Without dead ends: 160 [2025-01-09 12:27:41,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:27:41,946 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 13 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:27:41,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 115 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:27:41,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-01-09 12:27:41,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 152. [2025-01-09 12:27:41,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 118 states have (on average 1.2881355932203389) internal successors, (152), 119 states have internal predecessors, (152), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 12:27:41,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 210 transitions. [2025-01-09 12:27:41,979 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 210 transitions. Word has length 68 [2025-01-09 12:27:41,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:27:41,979 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 210 transitions. [2025-01-09 12:27:41,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 12:27:41,979 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 210 transitions. [2025-01-09 12:27:41,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 12:27:41,980 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:27:41,980 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:27:41,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 12:27:41,980 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:27:41,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:27:41,980 INFO L85 PathProgramCache]: Analyzing trace with hash -534824624, now seen corresponding path program 1 times [2025-01-09 12:27:41,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:27:41,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3299625] [2025-01-09 12:27:41,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:27:41,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:27:41,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 12:27:42,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 12:27:42,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:27:42,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:27:42,002 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 12:27:42,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 12:27:42,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 12:27:42,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:27:42,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:27:42,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 12:27:42,056 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 12:27:42,056 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:27:42,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 12:27:42,060 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 12:27:42,096 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 12:27:42,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:27:42 BoogieIcfgContainer [2025-01-09 12:27:42,098 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 12:27:42,101 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 12:27:42,101 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 12:27:42,101 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 12:27:42,101 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:27:38" (3/4) ... [2025-01-09 12:27:42,103 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 12:27:42,103 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 12:27:42,105 INFO L158 Benchmark]: Toolchain (without parser) took 4376.66ms. Allocated memory was 201.3MB in the beginning and 260.0MB in the end (delta: 58.7MB). Free memory was 158.0MB in the beginning and 107.6MB in the end (delta: 50.4MB). Peak memory consumption was 108.3MB. Max. memory is 16.1GB. [2025-01-09 12:27:42,105 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 218.1MB. Free memory is still 134.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:27:42,106 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.58ms. Allocated memory is still 201.3MB. Free memory was 157.7MB in the beginning and 145.2MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:27:42,106 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.60ms. Allocated memory is still 201.3MB. Free memory was 144.9MB in the beginning and 142.7MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:27:42,106 INFO L158 Benchmark]: Boogie Preprocessor took 37.48ms. Allocated memory is still 201.3MB. Free memory was 142.7MB in the beginning and 139.8MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:27:42,107 INFO L158 Benchmark]: RCFGBuilder took 328.05ms. Allocated memory is still 201.3MB. Free memory was 139.8MB in the beginning and 122.6MB in the end (delta: 17.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:27:42,107 INFO L158 Benchmark]: TraceAbstraction took 3738.03ms. Allocated memory was 201.3MB in the beginning and 260.0MB in the end (delta: 58.7MB). Free memory was 122.0MB in the beginning and 107.7MB in the end (delta: 14.3MB). Peak memory consumption was 83.2MB. Max. memory is 16.1GB. [2025-01-09 12:27:42,108 INFO L158 Benchmark]: Witness Printer took 2.76ms. Allocated memory is still 260.0MB. Free memory was 107.7MB in the beginning and 107.6MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:27:42,109 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.25ms. Allocated memory is still 218.1MB. Free memory is still 134.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.58ms. Allocated memory is still 201.3MB. Free memory was 157.7MB in the beginning and 145.2MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.60ms. Allocated memory is still 201.3MB. Free memory was 144.9MB in the beginning and 142.7MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.48ms. Allocated memory is still 201.3MB. Free memory was 142.7MB in the beginning and 139.8MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 328.05ms. Allocated memory is still 201.3MB. Free memory was 139.8MB in the beginning and 122.6MB in the end (delta: 17.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3738.03ms. Allocated memory was 201.3MB in the beginning and 260.0MB in the end (delta: 58.7MB). Free memory was 122.0MB in the beginning and 107.7MB in the end (delta: 14.3MB). Peak memory consumption was 83.2MB. Max. memory is 16.1GB. * Witness Printer took 2.76ms. Allocated memory is still 260.0MB. Free memory was 107.7MB in the beginning and 107.6MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 87, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of bitwiseAnd at line 52, overapproximation of someBinaryArithmeticFLOAToperation at line 62. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -5; [L23] unsigned char var_1_4 = 0; [L24] unsigned short int var_1_5 = 256; [L25] unsigned short int var_1_6 = 44772; [L26] float var_1_7 = 5.9; [L27] float var_1_8 = 7.6; [L28] float var_1_9 = 64.2; [L29] float var_1_10 = 128.75; [L30] unsigned long int var_1_11 = 8; [L31] unsigned long int var_1_12 = 3135928546; [L32] signed short int last_1_var_1_1 = -5; [L33] unsigned long int last_1_var_1_11 = 8; VAL [isInitial=0, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=0, var_1_5=256, var_1_6=44772, var_1_7=59/10, var_1_8=38/5, var_1_9=321/5] [L91] isInitial = 1 [L92] FCALL initially() [L94] CALL updateLastVariables() [L83] last_1_var_1_1 = var_1_1 [L84] last_1_var_1_11 = var_1_11 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=0, var_1_5=256, var_1_6=44772, var_1_7=59/10, var_1_8=38/5, var_1_9=321/5] [L94] RET updateLastVariables() [L95] CALL updateVariables() [L66] var_1_4 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_5=256, var_1_6=44772, var_1_7=59/10, var_1_8=38/5, var_1_9=321/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_5=256, var_1_6=44772, var_1_7=59/10, var_1_8=38/5, var_1_9=321/5] [L67] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_5=256, var_1_6=44772, var_1_7=59/10, var_1_8=38/5, var_1_9=321/5] [L68] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=44772, var_1_7=59/10, var_1_8=38/5, var_1_9=321/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=44772, var_1_7=59/10, var_1_8=38/5, var_1_9=321/5] [L68] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=44772, var_1_7=59/10, var_1_8=38/5, var_1_9=321/5] [L69] var_1_6 = __VERIFIER_nondet_ushort() [L70] CALL assume_abort_if_not(var_1_6 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10, var_1_8=38/5, var_1_9=321/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10, var_1_8=38/5, var_1_9=321/5] [L70] RET assume_abort_if_not(var_1_6 >= 32767) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10, var_1_8=38/5, var_1_9=321/5] [L71] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10, var_1_8=38/5, var_1_9=321/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10, var_1_8=38/5, var_1_9=321/5] [L71] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10, var_1_8=38/5, var_1_9=321/5] [L72] var_1_8 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 1152921.504606845700e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10, var_1_9=321/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10, var_1_9=321/5] [L73] RET assume_abort_if_not((var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 1152921.504606845700e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10, var_1_9=321/5] [L74] var_1_9 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10] [L75] RET assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10] [L76] var_1_10 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10] [L77] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10] [L78] var_1_12 = __VERIFIER_nondet_ulong() [L79] CALL assume_abort_if_not(var_1_12 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_11=8, var_1_12=2147483647, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_11=8, var_1_12=2147483647, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10] [L79] RET assume_abort_if_not(var_1_12 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_11=8, var_1_12=2147483647, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10] [L80] CALL assume_abort_if_not(var_1_12 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_11=8, var_1_12=2147483647, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_11=8, var_1_12=2147483647, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10] [L80] RET assume_abort_if_not(var_1_12 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_11=8, var_1_12=2147483647, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10] [L95] RET updateVariables() [L96] CALL step() [L37] signed long int stepLocal_0 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_11=8, var_1_12=2147483647, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10] [L38] COND TRUE \read(var_1_4) [L39] var_1_5 = last_1_var_1_1 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_11=8, var_1_12=2147483647, var_1_1=-5, var_1_4=1, var_1_5=-5, var_1_6=32767, var_1_7=59/10] [L45] COND TRUE var_1_5 == var_1_5 [L46] var_1_1 = (var_1_5 + -16) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_11=8, var_1_12=2147483647, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767, var_1_7=59/10] [L52] EXPR var_1_5 & last_1_var_1_11 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_11=8, var_1_12=2147483647, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767, var_1_7=59/10] [L52] COND TRUE last_1_var_1_11 >= (var_1_5 & last_1_var_1_11) [L53] var_1_11 = ((((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < (var_1_6)) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : (var_1_6)))) < ((var_1_12 - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < (var_1_6)) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : (var_1_6)))) : ((var_1_12 - last_1_var_1_11)))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_11=8, var_1_12=2147483647, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767, var_1_7=59/10] [L61] COND TRUE var_1_1 < var_1_5 [L62] var_1_7 = (((10.25f + var_1_8) + var_1_9) + var_1_10) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_11=8, var_1_12=2147483647, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767] [L96] RET step() [L97] CALL, EXPR property() [L87] EXPR ((((var_1_5 == var_1_5) ? (var_1_1 == ((signed short int) (var_1_5 + -16))) : (var_1_4 ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && (var_1_4 ? (var_1_5 == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? (var_1_5 == ((unsigned short int) ((((last_1_var_1_11) > ((var_1_6 - 8))) ? (last_1_var_1_11) : ((var_1_6 - 8)))))) : 1))) && ((var_1_1 < var_1_5) ? (var_1_7 == ((float) (((10.25f + var_1_8) + var_1_9) + var_1_10))) : 1)) && ((last_1_var_1_11 >= (var_1_5 & last_1_var_1_11)) ? (var_1_11 == ((unsigned long int) ((((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < (var_1_6)) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : (var_1_6)))) < ((var_1_12 - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < (var_1_6)) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : (var_1_6)))) : ((var_1_12 - last_1_var_1_11)))))) : ((5.7 < var_1_9) ? (var_1_11 == ((unsigned long int) last_1_var_1_11)) : (var_1_11 == ((unsigned long int) last_1_var_1_11)))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_11=8, var_1_12=2147483647, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767] [L87-L88] return ((((var_1_5 == var_1_5) ? (var_1_1 == ((signed short int) (var_1_5 + -16))) : (var_1_4 ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && (var_1_4 ? (var_1_5 == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? (var_1_5 == ((unsigned short int) ((((last_1_var_1_11) > ((var_1_6 - 8))) ? (last_1_var_1_11) : ((var_1_6 - 8)))))) : 1))) && ((var_1_1 < var_1_5) ? (var_1_7 == ((float) (((10.25f + var_1_8) + var_1_9) + var_1_10))) : 1)) && ((last_1_var_1_11 >= (var_1_5 & last_1_var_1_11)) ? (var_1_11 == ((unsigned long int) ((((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < (var_1_6)) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : (var_1_6)))) < ((var_1_12 - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < (var_1_6)) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : (var_1_6)))) : ((var_1_12 - last_1_var_1_11)))))) : ((5.7 < var_1_9) ? (var_1_11 == ((unsigned long int) last_1_var_1_11)) : (var_1_11 == ((unsigned long int) last_1_var_1_11)))) ; [L97] RET, EXPR property() [L97] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_11=8, var_1_12=2147483647, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_11=8, var_1_12=2147483647, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 6, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 316 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 316 mSDsluCounter, 682 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 389 mSDsCounter, 100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 391 IncrementalHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100 mSolverCounterUnsat, 293 mSDtfsCounter, 391 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=4, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 98 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 474 NumberOfCodeBlocks, 474 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 399 ConstructedInterpolants, 0 QuantifiedInterpolants, 1088 SizeOfPredicates, 0 NumberOfNonLiveVariables, 170 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 848/864 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-01-09 12:27:42,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-22.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 332bcce48a0139e2df6284710a9b0ccad22d833566bbd5ef3ad1522424ad9314 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:27:44,413 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:27:44,509 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 12:27:44,513 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:27:44,513 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:27:44,537 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:27:44,538 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:27:44,538 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:27:44,538 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:27:44,539 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:27:44,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:27:44,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:27:44,539 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:27:44,539 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:27:44,539 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:27:44,539 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:27:44,539 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:27:44,539 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:27:44,540 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:27:44,540 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:27:44,540 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:27:44,540 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:27:44,540 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:27:44,540 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 12:27:44,540 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 12:27:44,540 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 12:27:44,540 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:27:44,540 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:27:44,541 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:27:44,541 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:27:44,541 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:27:44,541 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:27:44,541 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:27:44,541 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:27:44,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:27:44,541 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:27:44,541 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:27:44,542 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:27:44,542 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:27:44,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:27:44,542 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:27:44,542 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:27:44,542 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:27:44,542 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:27:44,542 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 12:27:44,542 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 12:27:44,542 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:27:44,542 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:27:44,542 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:27:44,543 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:27:44,543 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-jdk21/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 -> 332bcce48a0139e2df6284710a9b0ccad22d833566bbd5ef3ad1522424ad9314 [2025-01-09 12:27:44,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:27:44,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:27:44,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:27:44,791 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:27:44,793 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:27:44,795 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-22.i [2025-01-09 12:27:46,020 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9fc31a08a/9e630ddb40054b8d91b4ccd409377e3b/FLAG46f669468 [2025-01-09 12:27:46,227 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:27:46,228 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-22.i [2025-01-09 12:27:46,235 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9fc31a08a/9e630ddb40054b8d91b4ccd409377e3b/FLAG46f669468 [2025-01-09 12:27:46,251 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9fc31a08a/9e630ddb40054b8d91b4ccd409377e3b [2025-01-09 12:27:46,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:27:46,255 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:27:46,257 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:27:46,257 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:27:46,260 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:27:46,260 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:27:46" (1/1) ... [2025-01-09 12:27:46,261 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fac1a4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:46, skipping insertion in model container [2025-01-09 12:27:46,261 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:27:46" (1/1) ... [2025-01-09 12:27:46,274 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:27:46,381 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-22.i[917,930] [2025-01-09 12:27:46,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:27:46,432 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:27:46,444 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-22.i[917,930] [2025-01-09 12:27:46,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:27:46,481 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:27:46,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:46 WrapperNode [2025-01-09 12:27:46,483 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:27:46,484 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:27:46,484 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:27:46,484 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:27:46,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:46" (1/1) ... [2025-01-09 12:27:46,500 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:46" (1/1) ... [2025-01-09 12:27:46,515 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2025-01-09 12:27:46,515 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:27:46,516 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:27:46,516 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:27:46,516 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:27:46,524 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:46" (1/1) ... [2025-01-09 12:27:46,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:46" (1/1) ... [2025-01-09 12:27:46,526 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:46" (1/1) ... [2025-01-09 12:27:46,536 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-01-09 12:27:46,537 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:46" (1/1) ... [2025-01-09 12:27:46,537 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:46" (1/1) ... [2025-01-09 12:27:46,544 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:46" (1/1) ... [2025-01-09 12:27:46,546 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:46" (1/1) ... [2025-01-09 12:27:46,548 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:46" (1/1) ... [2025-01-09 12:27:46,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:46" (1/1) ... [2025-01-09 12:27:46,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:46" (1/1) ... [2025-01-09 12:27:46,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:27:46,556 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:27:46,558 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:27:46,558 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:27:46,559 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:46" (1/1) ... [2025-01-09 12:27:46,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:27:46,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:27:46,585 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:27:46,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:27:46,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:27:46,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 12:27:46,610 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:27:46,610 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:27:46,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:27:46,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:27:46,660 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:27:46,661 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:27:48,269 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 12:27:48,269 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:27:48,275 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:27:48,281 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:27:48,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:27:48 BoogieIcfgContainer [2025-01-09 12:27:48,282 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:27:48,287 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:27:48,287 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:27:48,296 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:27:48,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:27:46" (1/3) ... [2025-01-09 12:27:48,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c933c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:27:48, skipping insertion in model container [2025-01-09 12:27:48,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:46" (2/3) ... [2025-01-09 12:27:48,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c933c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:27:48, skipping insertion in model container [2025-01-09 12:27:48,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:27:48" (3/3) ... [2025-01-09 12:27:48,303 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-22.i [2025-01-09 12:27:48,320 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:27:48,326 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-22.i that has 2 procedures, 40 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:27:48,398 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:27:48,413 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;@40c6c001, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:27:48,413 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:27:48,420 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 12:27:48,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 12:27:48,433 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:27:48,434 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:27:48,435 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:27:48,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:27:48,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1359900370, now seen corresponding path program 1 times [2025-01-09 12:27:48,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:27:48,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669234872] [2025-01-09 12:27:48,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:27:48,462 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-01-09 12:27:48,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:27:48,466 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-01-09 12:27:48,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 12:27:48,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 12:27:48,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 12:27:48,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:27:48,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:27:48,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:27:48,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:27:48,759 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-01-09 12:27:48,760 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:27:48,760 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:27:48,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669234872] [2025-01-09 12:27:48,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669234872] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:27:48,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:27:48,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:27:48,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114121545] [2025-01-09 12:27:48,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:27:48,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:27:48,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:27:48,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:27:48,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:27:48,788 INFO L87 Difference]: Start difference. First operand has 40 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 12:27:48,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:27:48,801 INFO L93 Difference]: Finished difference Result 72 states and 114 transitions. [2025-01-09 12:27:48,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:27:48,803 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2025-01-09 12:27:48,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:27:48,807 INFO L225 Difference]: With dead ends: 72 [2025-01-09 12:27:48,807 INFO L226 Difference]: Without dead ends: 35 [2025-01-09 12:27:48,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 63 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-01-09 12:27:48,812 INFO L435 NwaCegarLoop]: 46 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, 46 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-01-09 12:27:48,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:27:48,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-01-09 12:27:48,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-01-09 12:27:48,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 12:27:48,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2025-01-09 12:27:48,839 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 64 [2025-01-09 12:27:48,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:27:48,840 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2025-01-09 12:27:48,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 12:27:48,840 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2025-01-09 12:27:48,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 12:27:48,842 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:27:48,842 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:27:48,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 12:27:49,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-01-09 12:27:49,045 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:27:49,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:27:49,046 INFO L85 PathProgramCache]: Analyzing trace with hash -377313128, now seen corresponding path program 1 times [2025-01-09 12:27:49,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:27:49,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [492921577] [2025-01-09 12:27:49,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:27:49,047 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-01-09 12:27:49,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:27:49,050 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-01-09 12:27:49,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 12:27:49,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 12:27:49,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 12:27:49,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:27:49,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:27:49,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 12:27:49,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:27:49,540 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 12:27:49,540 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:27:49,540 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:27:49,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [492921577] [2025-01-09 12:27:49,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [492921577] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:27:49,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:27:49,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:27:49,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906659618] [2025-01-09 12:27:49,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:27:49,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 12:27:49,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:27:49,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 12:27:49,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:27:49,543 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 12:27:54,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:27:54,271 INFO L93 Difference]: Finished difference Result 142 states and 187 transitions. [2025-01-09 12:27:54,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 12:27:54,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2025-01-09 12:27:54,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:27:54,284 INFO L225 Difference]: With dead ends: 142 [2025-01-09 12:27:54,284 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 12:27:54,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:27:54,285 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 86 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-01-09 12:27:54,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 182 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-01-09 12:27:54,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 12:27:54,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 87. [2025-01-09 12:27:54,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 states have internal predecessors, (64), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 12:27:54,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 118 transitions. [2025-01-09 12:27:54,330 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 118 transitions. Word has length 64 [2025-01-09 12:27:54,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:27:54,330 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 118 transitions. [2025-01-09 12:27:54,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 12:27:54,330 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 118 transitions. [2025-01-09 12:27:54,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 12:27:54,331 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:27:54,332 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:27:54,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 12:27:54,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-01-09 12:27:54,533 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:27:54,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:27:54,533 INFO L85 PathProgramCache]: Analyzing trace with hash -379160170, now seen corresponding path program 1 times [2025-01-09 12:27:54,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:27:54,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632268742] [2025-01-09 12:27:54,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:27:54,535 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-01-09 12:27:54,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:27:54,537 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-01-09 12:27:54,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 12:27:54,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 12:27:54,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 12:27:54,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:27:54,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:27:54,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 12:27:54,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:28:39,125 WARN L286 SmtUtils]: Spent 11.51s on a formula simplification that was a NOOP. DAG size: 102 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)