./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-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_no-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 ef69fa322edc34489e265db107286930d1dc540dffa71844564e9de95771e40f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:39:32,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:39:32,819 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:39:32,823 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:39:32,823 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:39:32,837 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:39:32,837 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:39:32,837 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:39:32,838 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:39:32,838 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:39:32,838 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:39:32,838 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:39:32,838 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:39:32,838 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:39:32,838 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:39:32,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:39:32,838 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:39:32,838 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:39:32,838 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:39:32,838 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:39:32,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:39:32,839 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:39:32,839 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:39:32,839 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:39:32,839 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:39:32,839 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:39:32,839 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:39:32,839 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:39:32,839 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:39:32,839 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:39:32,839 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:39:32,839 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:39:32,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:39:32,839 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:39:32,839 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:39:32,839 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:39:32,839 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:39:32,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:39:32,839 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:39:32,840 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:39:32,840 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:39:32,840 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:39:32,840 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:39:32,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:39:32,840 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:39:32,840 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:39:32,840 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:39:32,840 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:39:32,840 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 -> ef69fa322edc34489e265db107286930d1dc540dffa71844564e9de95771e40f [2025-01-09 12:39:33,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:39:33,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:39:33,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:39:33,040 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:39:33,040 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:39:33,041 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-22.i [2025-01-09 12:39:34,245 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/206565fd3/27a6896c122b45f0aa181937ae2c8bbc/FLAG8e4fc8b46 [2025-01-09 12:39:34,493 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:39:34,494 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-22.i [2025-01-09 12:39:34,501 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/206565fd3/27a6896c122b45f0aa181937ae2c8bbc/FLAG8e4fc8b46 [2025-01-09 12:39:34,515 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/206565fd3/27a6896c122b45f0aa181937ae2c8bbc [2025-01-09 12:39:34,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:39:34,520 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:39:34,521 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:39:34,525 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:39:34,528 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:39:34,529 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:39:34" (1/1) ... [2025-01-09 12:39:34,530 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f2df603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:34, skipping insertion in model container [2025-01-09 12:39:34,533 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:39:34" (1/1) ... [2025-01-09 12:39:34,551 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:39:34,649 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_no-floats_file-22.i[916,929] [2025-01-09 12:39:34,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:39:34,696 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:39:34,705 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_no-floats_file-22.i[916,929] [2025-01-09 12:39:34,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:39:34,745 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:39:34,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:34 WrapperNode [2025-01-09 12:39:34,746 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:39:34,747 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:39:34,747 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:39:34,747 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:39:34,751 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:39:34" (1/1) ... [2025-01-09 12:39:34,761 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:39:34" (1/1) ... [2025-01-09 12:39:34,784 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2025-01-09 12:39:34,784 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:39:34,785 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:39:34,785 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:39:34,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:39:34,792 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:34" (1/1) ... [2025-01-09 12:39:34,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:34" (1/1) ... [2025-01-09 12:39:34,800 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:34" (1/1) ... [2025-01-09 12:39:34,813 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:39:34,813 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:34" (1/1) ... [2025-01-09 12:39:34,813 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:34" (1/1) ... [2025-01-09 12:39:34,818 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:34" (1/1) ... [2025-01-09 12:39:34,822 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:34" (1/1) ... [2025-01-09 12:39:34,823 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:34" (1/1) ... [2025-01-09 12:39:34,824 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:34" (1/1) ... [2025-01-09 12:39:34,825 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:34" (1/1) ... [2025-01-09 12:39:34,830 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:39:34,830 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:39:34,831 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:39:34,831 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:39:34,831 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:34" (1/1) ... [2025-01-09 12:39:34,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:39:34,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:39:34,856 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:39:34,859 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:39:34,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:39:34,872 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:39:34,873 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:39:34,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:39:34,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:39:34,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:39:34,913 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:39:34,914 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:39:35,065 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 12:39:35,066 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:39:35,071 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:39:35,071 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:39:35,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:39:35 BoogieIcfgContainer [2025-01-09 12:39:35,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:39:35,073 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:39:35,073 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:39:35,076 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:39:35,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:39:34" (1/3) ... [2025-01-09 12:39:35,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@526fec5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:39:35, skipping insertion in model container [2025-01-09 12:39:35,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:34" (2/3) ... [2025-01-09 12:39:35,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@526fec5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:39:35, skipping insertion in model container [2025-01-09 12:39:35,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:39:35" (3/3) ... [2025-01-09 12:39:35,078 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-22.i [2025-01-09 12:39:35,087 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:39:35,088 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-22.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:39:35,118 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:39:35,125 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;@39962c80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:39:35,125 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:39:35,128 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 12:39:35,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 12:39:35,133 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:39:35,133 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:35,133 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:39:35,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:39:35,137 INFO L85 PathProgramCache]: Analyzing trace with hash -2010478529, now seen corresponding path program 1 times [2025-01-09 12:39:35,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:39:35,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182325712] [2025-01-09 12:39:35,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:35,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:39:35,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 12:39:35,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 12:39:35,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:35,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:39:35,276 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 12:39:35,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:39:35,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182325712] [2025-01-09 12:39:35,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182325712] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:39:35,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967910667] [2025-01-09 12:39:35,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:35,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:39:35,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:39:35,279 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:39:35,281 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:39:35,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 12:39:35,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 12:39:35,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:35,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:39:35,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:39:35,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:39:35,376 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 12:39:35,377 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:39:35,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967910667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:39:35,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:39:35,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:39:35,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212758869] [2025-01-09 12:39:35,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:39:35,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:39:35,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:39:35,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:39:35,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:39:35,399 INFO L87 Difference]: Start difference. First operand has 52 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 12:39:35,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:39:35,418 INFO L93 Difference]: Finished difference Result 97 states and 159 transitions. [2025-01-09 12:39:35,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:39:35,420 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2025-01-09 12:39:35,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:39:35,425 INFO L225 Difference]: With dead ends: 97 [2025-01-09 12:39:35,425 INFO L226 Difference]: Without dead ends: 48 [2025-01-09 12:39:35,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 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:39:35,431 INFO L435 NwaCegarLoop]: 69 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, 69 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:39:35,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:39:35,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-09 12:39:35,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-01-09 12:39:35,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 12:39:35,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2025-01-09 12:39:35,457 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 82 [2025-01-09 12:39:35,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:39:35,457 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2025-01-09 12:39:35,457 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 12:39:35,457 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2025-01-09 12:39:35,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 12:39:35,459 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:39:35,459 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:35,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 12:39:35,660 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:39:35,661 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:39:35,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:39:35,662 INFO L85 PathProgramCache]: Analyzing trace with hash -199708609, now seen corresponding path program 1 times [2025-01-09 12:39:35,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:39:35,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596339101] [2025-01-09 12:39:35,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:35,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:39:35,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 12:39:35,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 12:39:35,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:35,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:39:36,142 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 12:39:36,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:39:36,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596339101] [2025-01-09 12:39:36,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596339101] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:39:36,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:39:36,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:39:36,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698210159] [2025-01-09 12:39:36,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:39:36,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:39:36,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:39:36,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:39:36,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:39:36,145 INFO L87 Difference]: Start difference. First operand 48 states and 69 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 12:39:36,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:39:36,407 INFO L93 Difference]: Finished difference Result 159 states and 230 transitions. [2025-01-09 12:39:36,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 12:39:36,408 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2025-01-09 12:39:36,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:39:36,409 INFO L225 Difference]: With dead ends: 159 [2025-01-09 12:39:36,410 INFO L226 Difference]: Without dead ends: 114 [2025-01-09 12:39:36,410 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:39:36,411 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 99 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:39:36,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 157 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:39:36,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-09 12:39:36,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 83. [2025-01-09 12:39:36,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 12:39:36,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 121 transitions. [2025-01-09 12:39:36,437 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 121 transitions. Word has length 82 [2025-01-09 12:39:36,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:39:36,438 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 121 transitions. [2025-01-09 12:39:36,439 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 12:39:36,439 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 121 transitions. [2025-01-09 12:39:36,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 12:39:36,440 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:39:36,440 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:36,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:39:36,440 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:39:36,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:39:36,441 INFO L85 PathProgramCache]: Analyzing trace with hash 9893948, now seen corresponding path program 1 times [2025-01-09 12:39:36,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:39:36,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991736582] [2025-01-09 12:39:36,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:36,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:39:36,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 12:39:36,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 12:39:36,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:36,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:39:36,679 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 12:39:36,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:39:36,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991736582] [2025-01-09 12:39:36,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991736582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:39:36,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:39:36,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:39:36,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779297638] [2025-01-09 12:39:36,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:39:36,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:39:36,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:39:36,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:39:36,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:39:36,681 INFO L87 Difference]: Start difference. First operand 83 states and 121 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 12:39:36,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:39:36,873 INFO L93 Difference]: Finished difference Result 165 states and 238 transitions. [2025-01-09 12:39:36,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 12:39:36,874 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2025-01-09 12:39:36,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:39:36,875 INFO L225 Difference]: With dead ends: 165 [2025-01-09 12:39:36,875 INFO L226 Difference]: Without dead ends: 114 [2025-01-09 12:39:36,875 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:39:36,876 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 76 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:39:36,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 175 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:39:36,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-09 12:39:36,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 84. [2025-01-09 12:39:36,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.280701754385965) internal successors, (73), 57 states have internal predecessors, (73), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 12:39:36,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 121 transitions. [2025-01-09 12:39:36,887 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 121 transitions. Word has length 83 [2025-01-09 12:39:36,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:39:36,888 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 121 transitions. [2025-01-09 12:39:36,888 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 12:39:36,888 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 121 transitions. [2025-01-09 12:39:36,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 12:39:36,888 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:39:36,889 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:36,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:39:36,889 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:39:36,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:39:36,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1166878940, now seen corresponding path program 1 times [2025-01-09 12:39:36,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:39:36,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755365426] [2025-01-09 12:39:36,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:36,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:39:36,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 12:39:36,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 12:39:36,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:36,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:39:37,415 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 12:39:37,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:39:37,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755365426] [2025-01-09 12:39:37,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755365426] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:39:37,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:39:37,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 12:39:37,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837797724] [2025-01-09 12:39:37,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:39:37,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 12:39:37,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:39:37,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 12:39:37,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:39:37,417 INFO L87 Difference]: Start difference. First operand 84 states and 121 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 12:39:37,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:39:37,757 INFO L93 Difference]: Finished difference Result 235 states and 333 transitions. [2025-01-09 12:39:37,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 12:39:37,757 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), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2025-01-09 12:39:37,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:39:37,759 INFO L225 Difference]: With dead ends: 235 [2025-01-09 12:39:37,759 INFO L226 Difference]: Without dead ends: 190 [2025-01-09 12:39:37,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:39:37,760 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 146 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:39:37,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 224 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:39:37,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-01-09 12:39:37,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 161. [2025-01-09 12:39:37,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 118 states have (on average 1.3220338983050848) internal successors, (156), 119 states have internal predecessors, (156), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 12:39:37,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 232 transitions. [2025-01-09 12:39:37,782 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 232 transitions. Word has length 83 [2025-01-09 12:39:37,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:39:37,782 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 232 transitions. [2025-01-09 12:39:37,782 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), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 12:39:37,782 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 232 transitions. [2025-01-09 12:39:37,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 12:39:37,783 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:39:37,783 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:37,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:39:37,784 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:39:37,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:39:37,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1867943518, now seen corresponding path program 1 times [2025-01-09 12:39:37,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:39:37,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342283210] [2025-01-09 12:39:37,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:37,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:39:37,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 12:39:37,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 12:39:37,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:37,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:39:37,829 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 12:39:37,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:39:37,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342283210] [2025-01-09 12:39:37,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342283210] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:39:37,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:39:37,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:39:37,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89343541] [2025-01-09 12:39:37,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:39:37,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:39:37,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:39:37,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:39:37,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:39:37,831 INFO L87 Difference]: Start difference. First operand 161 states and 232 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 12:39:37,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:39:37,858 INFO L93 Difference]: Finished difference Result 286 states and 415 transitions. [2025-01-09 12:39:37,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:39:37,859 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2025-01-09 12:39:37,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:39:37,861 INFO L225 Difference]: With dead ends: 286 [2025-01-09 12:39:37,861 INFO L226 Difference]: Without dead ends: 169 [2025-01-09 12:39:37,862 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:39:37,862 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 13 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 127 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:39:37,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 127 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:39:37,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-01-09 12:39:37,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 161. [2025-01-09 12:39:37,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 118 states have (on average 1.305084745762712) internal successors, (154), 119 states have internal predecessors, (154), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 12:39:37,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 230 transitions. [2025-01-09 12:39:37,902 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 230 transitions. Word has length 83 [2025-01-09 12:39:37,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:39:37,902 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 230 transitions. [2025-01-09 12:39:37,903 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 12:39:37,903 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 230 transitions. [2025-01-09 12:39:37,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 12:39:37,907 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:39:37,907 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:37,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 12:39:37,907 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:39:37,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:39:37,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1085209826, now seen corresponding path program 1 times [2025-01-09 12:39:37,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:39:37,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961600313] [2025-01-09 12:39:37,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:37,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:39:37,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 12:39:37,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 12:39:37,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:37,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:39:37,966 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 12:39:37,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 12:39:37,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 12:39:37,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:37,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:39:38,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 12:39:38,012 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 12:39:38,012 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:39:38,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 12:39:38,016 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 12:39:38,068 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 12:39:38,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:39:38 BoogieIcfgContainer [2025-01-09 12:39:38,073 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 12:39:38,074 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 12:39:38,074 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 12:39:38,074 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 12:39:38,074 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:39:35" (3/4) ... [2025-01-09 12:39:38,076 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 12:39:38,077 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 12:39:38,080 INFO L158 Benchmark]: Toolchain (without parser) took 3559.81ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 60.2MB in the end (delta: 61.8MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. [2025-01-09 12:39:38,080 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 218.1MB. Free memory is still 136.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:39:38,080 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.32ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 108.7MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:39:38,081 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.29ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 106.4MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:39:38,081 INFO L158 Benchmark]: Boogie Preprocessor took 45.05ms. Allocated memory is still 167.8MB. Free memory was 106.4MB in the beginning and 103.6MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:39:38,081 INFO L158 Benchmark]: RCFGBuilder took 241.51ms. Allocated memory is still 167.8MB. Free memory was 103.6MB in the beginning and 86.4MB in the end (delta: 17.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:39:38,081 INFO L158 Benchmark]: TraceAbstraction took 3000.24ms. Allocated memory is still 167.8MB. Free memory was 86.0MB in the beginning and 60.2MB in the end (delta: 25.7MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. [2025-01-09 12:39:38,081 INFO L158 Benchmark]: Witness Printer took 5.68ms. Allocated memory is still 167.8MB. Free memory was 60.2MB in the beginning and 60.2MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:39:38,082 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.18ms. Allocated memory is still 218.1MB. Free memory is still 136.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 225.32ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 108.7MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.29ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 106.4MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.05ms. Allocated memory is still 167.8MB. Free memory was 106.4MB in the beginning and 103.6MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 241.51ms. Allocated memory is still 167.8MB. Free memory was 103.6MB in the beginning and 86.4MB in the end (delta: 17.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3000.24ms. Allocated memory is still 167.8MB. Free memory was 86.0MB in the beginning and 60.2MB in the end (delta: 25.7MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. * Witness Printer took 5.68ms. Allocated memory is still 167.8MB. Free memory was 60.2MB in the beginning and 60.2MB in the end (delta: 33.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 to_int at line 62, overapproximation of to_int at line 90, overapproximation of bitwiseAnd at line 52. 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] signed long int var_1_7 = 5; [L27] signed long int var_1_8 = 7; [L28] signed long int var_1_9 = 64; [L29] signed long int var_1_10 = 128; [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=128, 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=5, var_1_8=7, var_1_9=64] [L94] isInitial = 1 [L95] FCALL initially() [L97] CALL updateLastVariables() [L86] last_1_var_1_1 = var_1_1 [L87] 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=128, 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=5, var_1_8=7, var_1_9=64] [L97] RET updateLastVariables() [L98] 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=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_5=256, var_1_6=44772, var_1_7=5, var_1_8=7, var_1_9=64] [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=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_5=256, var_1_6=44772, var_1_7=5, var_1_8=7, var_1_9=64] [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=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_5=256, var_1_6=44772, var_1_7=5, var_1_8=7, var_1_9=64] [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=128, 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=5, var_1_8=7, var_1_9=64] [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=128, 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=5, var_1_8=7, var_1_9=64] [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=128, 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=5, var_1_8=7, var_1_9=64] [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=128, 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=5, var_1_8=7, var_1_9=64] [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=128, 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=5, var_1_8=7, var_1_9=64] [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=128, 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=5, var_1_8=7, var_1_9=64] [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=128, 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=5, var_1_8=7, var_1_9=64] [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=128, 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=5, var_1_8=7, var_1_9=64] [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=128, 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=5, var_1_8=7, var_1_9=64] [L72] var_1_8 = __VERIFIER_nondet_long() [L73] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, 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=5, var_1_8=0, var_1_9=64] [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=128, 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=5, var_1_8=0, var_1_9=64] [L73] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, 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=5, var_1_8=0, var_1_9=64] [L74] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, 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=5, var_1_8=0, var_1_9=64] [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=128, 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=5, var_1_8=0, var_1_9=64] [L74] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, 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=5, var_1_8=0, var_1_9=64] [L75] var_1_9 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, 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=5, var_1_8=0, var_1_9=0] [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=128, 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=5, var_1_8=0, var_1_9=0] [L76] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, 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=5, var_1_8=0, var_1_9=0] [L77] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, 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=5, var_1_8=0, var_1_9=0] [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=128, 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=5, var_1_8=0, var_1_9=0] [L77] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, 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=5, var_1_8=0, var_1_9=0] [L78] var_1_10 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_10 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, 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=5, var_1_8=0, var_1_9=0] [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=0, 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=5, var_1_8=0, var_1_9=0] [L79] RET assume_abort_if_not(var_1_10 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, 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=5, var_1_8=0, var_1_9=0] [L80] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, 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=5, var_1_8=0, var_1_9=0] [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=0, 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=5, var_1_8=0, var_1_9=0] [L80] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, 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=5, var_1_8=0, var_1_9=0] [L81] var_1_12 = __VERIFIER_nondet_ulong() [L82] 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_10=0, var_1_11=8, var_1_12=4294967294, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [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=0, var_1_11=8, var_1_12=4294967294, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L82] 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_10=0, var_1_11=8, var_1_12=4294967294, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L83] 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_10=0, var_1_11=8, var_1_12=4294967294, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [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=0, var_1_11=8, var_1_12=4294967294, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L83] 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_10=0, var_1_11=8, var_1_12=4294967294, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L98] RET updateVariables() [L99] 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_10=0, var_1_11=8, var_1_12=4294967294, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [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_10=0, var_1_11=8, var_1_12=4294967294, var_1_1=-5, var_1_4=1, var_1_5=-5, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [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_10=0, var_1_11=8, var_1_12=4294967294, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [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_10=0, var_1_11=8, var_1_12=4294967294, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [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_10=0, var_1_11=8, var_1_12=4294967294, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [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_10=0, var_1_11=8, var_1_12=4294967294, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767, var_1_8=0, var_1_9=0] [L99] RET step() [L100] CALL, EXPR property() [L90] 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 == ((signed long int) (((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_10=0, var_1_11=8, var_1_12=4294967294, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767, var_1_7=4294967296, var_1_8=0, var_1_9=0] [L90-L91] 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 == ((signed long int) (((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)))) ; [L100] RET, EXPR property() [L100] 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_10=0, var_1_11=8, var_1_12=4294967294, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767, var_1_7=4294967296, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, var_1_11=8, var_1_12=4294967294, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767, var_1_7=4294967296, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 334 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 334 mSDsluCounter, 752 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 428 mSDsCounter, 144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 413 IncrementalHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 144 mSolverCounterUnsat, 324 mSDtfsCounter, 413 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=4, InterpolantAutomatonStates: 23, 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, 1.2s InterpolantComputationTime, 579 NumberOfCodeBlocks, 579 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 489 ConstructedInterpolants, 0 QuantifiedInterpolants, 1837 SizeOfPredicates, 0 NumberOfNonLiveVariables, 200 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 1562/1584 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:39:38,109 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_no-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 ef69fa322edc34489e265db107286930d1dc540dffa71844564e9de95771e40f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:39:39,895 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:39:39,973 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:39:39,989 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:39:39,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:39:40,008 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:39:40,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:39:40,009 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:39:40,009 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:39:40,009 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:39:40,009 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:39:40,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:39:40,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:39:40,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:39:40,011 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:39:40,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:39:40,011 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:39:40,012 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:39:40,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:39:40,013 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:39:40,013 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:39:40,013 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:39:40,013 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:39:40,013 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 12:39:40,013 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 12:39:40,013 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 12:39:40,013 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:39:40,013 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:39:40,013 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:39:40,013 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:39:40,014 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:39:40,014 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:39:40,014 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:39:40,014 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:39:40,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:39:40,014 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:39:40,014 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:39:40,015 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:39:40,015 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:39:40,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:39:40,015 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:39:40,015 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:39:40,015 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:39:40,015 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:39:40,015 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 12:39:40,016 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 12:39:40,016 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:39:40,016 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:39:40,016 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:39:40,016 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:39:40,016 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 -> ef69fa322edc34489e265db107286930d1dc540dffa71844564e9de95771e40f [2025-01-09 12:39:40,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:39:40,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:39:40,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:39:40,264 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:39:40,264 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:39:40,265 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-22.i [2025-01-09 12:39:41,489 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d02f98deb/b6efbfb302784bb68c4b16497e9ba2b6/FLAG573956167 [2025-01-09 12:39:41,665 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:39:41,665 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-22.i [2025-01-09 12:39:41,672 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d02f98deb/b6efbfb302784bb68c4b16497e9ba2b6/FLAG573956167 [2025-01-09 12:39:41,682 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d02f98deb/b6efbfb302784bb68c4b16497e9ba2b6 [2025-01-09 12:39:41,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:39:41,686 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:39:41,691 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:39:41,691 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:39:41,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:39:41,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:39:41" (1/1) ... [2025-01-09 12:39:41,695 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7640dea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:41, skipping insertion in model container [2025-01-09 12:39:41,695 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:39:41" (1/1) ... [2025-01-09 12:39:41,713 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:39:41,798 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_no-floats_file-22.i[916,929] [2025-01-09 12:39:41,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:39:41,830 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:39:41,837 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_no-floats_file-22.i[916,929] [2025-01-09 12:39:41,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:39:41,874 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:39:41,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:41 WrapperNode [2025-01-09 12:39:41,876 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:39:41,877 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:39:41,878 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:39:41,878 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:39:41,883 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:39:41" (1/1) ... [2025-01-09 12:39:41,895 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:39:41" (1/1) ... [2025-01-09 12:39:41,914 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2025-01-09 12:39:41,916 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:39:41,917 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:39:41,917 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:39:41,917 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:39:41,927 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:41" (1/1) ... [2025-01-09 12:39:41,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:41" (1/1) ... [2025-01-09 12:39:41,931 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:41" (1/1) ... [2025-01-09 12:39:41,940 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:39:41,941 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:41" (1/1) ... [2025-01-09 12:39:41,941 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:41" (1/1) ... [2025-01-09 12:39:41,950 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:41" (1/1) ... [2025-01-09 12:39:41,951 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:41" (1/1) ... [2025-01-09 12:39:41,955 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:41" (1/1) ... [2025-01-09 12:39:41,956 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:41" (1/1) ... [2025-01-09 12:39:41,957 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:41" (1/1) ... [2025-01-09 12:39:41,958 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:39:41,959 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:39:41,959 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:39:41,959 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:39:41,960 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:41" (1/1) ... [2025-01-09 12:39:41,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:39:41,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:39:41,989 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:39:41,992 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:39:42,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:39:42,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 12:39:42,007 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:39:42,007 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:39:42,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:39:42,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:39:42,055 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:39:42,057 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:39:50,518 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 12:39:50,519 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:39:50,524 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:39:50,525 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:39:50,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:39:50 BoogieIcfgContainer [2025-01-09 12:39:50,525 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:39:50,527 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:39:50,527 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:39:50,530 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:39:50,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:39:41" (1/3) ... [2025-01-09 12:39:50,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a8b5d46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:39:50, skipping insertion in model container [2025-01-09 12:39:50,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:41" (2/3) ... [2025-01-09 12:39:50,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a8b5d46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:39:50, skipping insertion in model container [2025-01-09 12:39:50,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:39:50" (3/3) ... [2025-01-09 12:39:50,532 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-22.i [2025-01-09 12:39:50,541 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:39:50,543 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-22.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:39:50,575 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:39:50,583 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;@12dee7b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:39:50,583 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:39:50,586 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 12:39:50,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 12:39:50,591 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:39:50,592 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:50,592 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:39:50,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:39:50,596 INFO L85 PathProgramCache]: Analyzing trace with hash 2024043591, now seen corresponding path program 1 times [2025-01-09 12:39:50,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:39:50,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397000041] [2025-01-09 12:39:50,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:50,604 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:39:50,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:39:50,606 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:39:50,609 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:39:50,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 12:39:50,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 12:39:50,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:50,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:39:50,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:39:50,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:39:50,794 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-01-09 12:39:50,794 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:39:50,794 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:39:50,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397000041] [2025-01-09 12:39:50,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [397000041] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:39:50,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:39:50,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:39:50,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731293431] [2025-01-09 12:39:50,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:39:50,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:39:50,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:39:50,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:39:50,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:39:50,812 INFO L87 Difference]: Start difference. First operand has 43 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 12:39:50,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:39:50,825 INFO L93 Difference]: Finished difference Result 78 states and 129 transitions. [2025-01-09 12:39:50,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:39:50,827 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2025-01-09 12:39:50,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:39:50,830 INFO L225 Difference]: With dead ends: 78 [2025-01-09 12:39:50,830 INFO L226 Difference]: Without dead ends: 38 [2025-01-09 12:39:50,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 78 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:39:50,834 INFO L435 NwaCegarLoop]: 52 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, 52 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:39:50,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:39:50,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-09 12:39:50,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-01-09 12:39:50,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 12:39:50,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2025-01-09 12:39:50,858 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 79 [2025-01-09 12:39:50,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:39:50,858 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2025-01-09 12:39:50,859 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 12:39:50,859 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2025-01-09 12:39:50,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 12:39:50,861 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:39:50,861 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:50,867 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:39:51,061 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:39:51,062 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:39:51,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:39:51,063 INFO L85 PathProgramCache]: Analyzing trace with hash -140030905, now seen corresponding path program 1 times [2025-01-09 12:39:51,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:39:51,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108616941] [2025-01-09 12:39:51,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:51,064 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:39:51,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:39:51,066 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:39:51,068 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:39:51,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 12:39:51,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 12:39:51,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:51,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:39:51,293 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 12:39:51,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 12:39:51,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 12:39:51,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:51,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:39:51,472 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2025-01-09 12:39:51,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1438810709] [2025-01-09 12:39:51,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:51,473 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 12:39:51,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 12:39:51,492 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 12:39:51,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-01-09 12:39:51,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 12:39:51,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 12:39:51,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:51,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:39:51,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 12:39:51,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:40:01,281 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 12:40:09,441 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 12:40:14,732 WARN L286 SmtUtils]: Spent 5.29s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 12:40:22,831 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 12:40:30,924 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 12:40:39,011 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 12:40:46,694 WARN L286 SmtUtils]: Spent 7.68s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 12:40:52,088 WARN L286 SmtUtils]: Spent 5.39s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 12:41:00,193 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 12:41:07,346 WARN L286 SmtUtils]: Spent 7.15s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 12:41:14,803 WARN L286 SmtUtils]: Spent 7.46s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)