./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-37.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_loopvsstraightlinecode_25-1loop_file-37.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 602710bfdeba1413bfd2cc1b6bd5a194591bac373d29bd83e435c67ebf5ec2d9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:17:35,953 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:17:36,029 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 13:17:36,036 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:17:36,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:17:36,065 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:17:36,066 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:17:36,066 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:17:36,067 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:17:36,067 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:17:36,068 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:17:36,068 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:17:36,068 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:17:36,068 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:17:36,069 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:17:36,069 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:17:36,069 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:17:36,069 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:17:36,069 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:17:36,069 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:17:36,069 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:17:36,069 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:17:36,069 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:17:36,070 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:17:36,070 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:17:36,070 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:17:36,070 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:17:36,070 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:17:36,070 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:17:36,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:17:36,070 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:17:36,070 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:17:36,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:17:36,070 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:17:36,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:17:36,070 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:17:36,070 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:17:36,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:17:36,071 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:17:36,071 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:17:36,071 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:17:36,071 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:17:36,071 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:17:36,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:17:36,071 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:17:36,071 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:17:36,071 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:17:36,071 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:17:36,071 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 -> 602710bfdeba1413bfd2cc1b6bd5a194591bac373d29bd83e435c67ebf5ec2d9 [2025-01-09 13:17:36,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:17:36,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:17:36,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:17:36,322 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:17:36,322 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:17:36,323 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-37.i [2025-01-09 13:17:37,573 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/19832d87b/3bd217d9d99449468b4cec1cae50cbf4/FLAG42acca77a [2025-01-09 13:17:37,821 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:17:37,822 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-37.i [2025-01-09 13:17:37,828 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/19832d87b/3bd217d9d99449468b4cec1cae50cbf4/FLAG42acca77a [2025-01-09 13:17:37,846 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/19832d87b/3bd217d9d99449468b4cec1cae50cbf4 [2025-01-09 13:17:37,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:17:37,850 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:17:37,851 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:17:37,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:17:37,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:17:37,856 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:17:37" (1/1) ... [2025-01-09 13:17:37,857 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7657039c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:17:37, skipping insertion in model container [2025-01-09 13:17:37,857 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:17:37" (1/1) ... [2025-01-09 13:17:37,873 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:17:38,010 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_loopvsstraightlinecode_25-1loop_file-37.i[915,928] [2025-01-09 13:17:38,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:17:38,081 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:17:38,091 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_loopvsstraightlinecode_25-1loop_file-37.i[915,928] [2025-01-09 13:17:38,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:17:38,135 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:17:38,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:17:38 WrapperNode [2025-01-09 13:17:38,137 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:17:38,138 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:17:38,138 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:17:38,138 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:17:38,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:17:38" (1/1) ... [2025-01-09 13:17:38,152 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:17:38" (1/1) ... [2025-01-09 13:17:38,197 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2025-01-09 13:17:38,198 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:17:38,198 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:17:38,198 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:17:38,198 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:17:38,208 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:17:38" (1/1) ... [2025-01-09 13:17:38,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:17:38" (1/1) ... [2025-01-09 13:17:38,215 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:17:38" (1/1) ... [2025-01-09 13:17:38,230 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 13:17:38,231 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:17:38" (1/1) ... [2025-01-09 13:17:38,231 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:17:38" (1/1) ... [2025-01-09 13:17:38,238 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:17:38" (1/1) ... [2025-01-09 13:17:38,246 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:17:38" (1/1) ... [2025-01-09 13:17:38,250 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:17:38" (1/1) ... [2025-01-09 13:17:38,251 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:17:38" (1/1) ... [2025-01-09 13:17:38,256 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:17:38" (1/1) ... [2025-01-09 13:17:38,258 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:17:38,260 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:17:38,260 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:17:38,261 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:17:38,261 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:17:38" (1/1) ... [2025-01-09 13:17:38,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:17:38,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:17:38,290 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 13:17:38,296 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 13:17:38,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:17:38,313 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:17:38,313 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:17:38,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:17:38,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:17:38,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:17:38,379 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:17:38,380 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:17:38,634 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-01-09 13:17:38,635 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:17:38,647 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:17:38,647 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:17:38,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:17:38 BoogieIcfgContainer [2025-01-09 13:17:38,648 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:17:38,649 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:17:38,650 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:17:38,653 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:17:38,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:17:37" (1/3) ... [2025-01-09 13:17:38,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3efe0a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:17:38, skipping insertion in model container [2025-01-09 13:17:38,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:17:38" (2/3) ... [2025-01-09 13:17:38,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3efe0a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:17:38, skipping insertion in model container [2025-01-09 13:17:38,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:17:38" (3/3) ... [2025-01-09 13:17:38,658 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-37.i [2025-01-09 13:17:38,670 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:17:38,673 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-37.i that has 2 procedures, 49 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:17:38,732 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:17:38,744 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;@61aa0c9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:17:38,745 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:17:38,749 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 13:17:38,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 13:17:38,757 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:17:38,757 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:17:38,758 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:17:38,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:17:38,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2128068564, now seen corresponding path program 1 times [2025-01-09 13:17:38,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:17:38,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089021934] [2025-01-09 13:17:38,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:17:38,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:17:38,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 13:17:38,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 13:17:38,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:17:38,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:17:38,972 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-01-09 13:17:38,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:17:38,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089021934] [2025-01-09 13:17:38,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089021934] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:17:38,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127675223] [2025-01-09 13:17:38,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:17:38,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:17:38,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:17:38,976 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 13:17:38,977 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 13:17:39,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 13:17:39,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 13:17:39,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:17:39,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:17:39,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:17:39,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:17:39,118 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-01-09 13:17:39,118 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:17:39,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127675223] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:17:39,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:17:39,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:17:39,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148674673] [2025-01-09 13:17:39,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:17:39,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:17:39,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:17:39,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:17:39,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:17:39,142 INFO L87 Difference]: Start difference. First operand has 49 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 13:17:39,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:17:39,165 INFO L93 Difference]: Finished difference Result 95 states and 146 transitions. [2025-01-09 13:17:39,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:17:39,167 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 68 [2025-01-09 13:17:39,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:17:39,172 INFO L225 Difference]: With dead ends: 95 [2025-01-09 13:17:39,172 INFO L226 Difference]: Without dead ends: 46 [2025-01-09 13:17:39,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 69 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 13:17:39,176 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:17:39,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:17:39,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-01-09 13:17:39,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-01-09 13:17:39,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 13:17:39,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2025-01-09 13:17:39,211 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 68 [2025-01-09 13:17:39,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:17:39,211 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2025-01-09 13:17:39,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 13:17:39,211 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2025-01-09 13:17:39,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 13:17:39,216 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:17:39,216 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:17:39,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 13:17:39,421 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 13:17:39,421 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:17:39,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:17:39,422 INFO L85 PathProgramCache]: Analyzing trace with hash 845081558, now seen corresponding path program 1 times [2025-01-09 13:17:39,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:17:39,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837691593] [2025-01-09 13:17:39,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:17:39,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:17:39,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 13:17:39,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 13:17:39,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:17:39,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:17:39,774 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 13:17:39,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:17:39,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837691593] [2025-01-09 13:17:39,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837691593] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:17:39,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:17:39,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:17:39,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260562415] [2025-01-09 13:17:39,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:17:39,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:17:39,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:17:39,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:17:39,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:17:39,778 INFO L87 Difference]: Start difference. First operand 46 states and 65 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 13:17:39,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:17:39,808 INFO L93 Difference]: Finished difference Result 89 states and 127 transitions. [2025-01-09 13:17:39,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:17:39,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 68 [2025-01-09 13:17:39,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:17:39,810 INFO L225 Difference]: With dead ends: 89 [2025-01-09 13:17:39,811 INFO L226 Difference]: Without dead ends: 46 [2025-01-09 13:17:39,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:17:39,813 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:17:39,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:17:39,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-01-09 13:17:39,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-01-09 13:17:39,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 13:17:39,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2025-01-09 13:17:39,820 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 68 [2025-01-09 13:17:39,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:17:39,822 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2025-01-09 13:17:39,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 13:17:39,822 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2025-01-09 13:17:39,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 13:17:39,823 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:17:39,824 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:17:39,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:17:39,824 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:17:39,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:17:39,824 INFO L85 PathProgramCache]: Analyzing trace with hash 35734932, now seen corresponding path program 1 times [2025-01-09 13:17:39,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:17:39,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110115362] [2025-01-09 13:17:39,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:17:39,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:17:39,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 13:17:39,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 13:17:39,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:17:39,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:17:40,131 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-01-09 13:17:40,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:17:40,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110115362] [2025-01-09 13:17:40,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110115362] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:17:40,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995702796] [2025-01-09 13:17:40,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:17:40,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:17:40,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:17:40,137 INFO L229 MonitoredProcess]: Starting monitored process 3 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 13:17:40,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 13:17:40,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 13:17:40,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 13:17:40,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:17:40,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:17:40,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 13:17:40,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:17:40,377 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 13:17:40,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:17:40,554 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-01-09 13:17:40,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995702796] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 13:17:40,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 13:17:40,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 13:17:40,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620173393] [2025-01-09 13:17:40,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 13:17:40,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 13:17:40,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:17:40,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 13:17:40,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 13:17:40,556 INFO L87 Difference]: Start difference. First operand 46 states and 64 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2025-01-09 13:17:40,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:17:40,715 INFO L93 Difference]: Finished difference Result 95 states and 130 transitions. [2025-01-09 13:17:40,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 13:17:40,718 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) Word has length 68 [2025-01-09 13:17:40,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:17:40,719 INFO L225 Difference]: With dead ends: 95 [2025-01-09 13:17:40,719 INFO L226 Difference]: Without dead ends: 52 [2025-01-09 13:17:40,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-01-09 13:17:40,720 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 69 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:17:40,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 100 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:17:40,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-09 13:17:40,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2025-01-09 13:17:40,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 13:17:40,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 65 transitions. [2025-01-09 13:17:40,732 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 65 transitions. Word has length 68 [2025-01-09 13:17:40,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:17:40,733 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 65 transitions. [2025-01-09 13:17:40,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2025-01-09 13:17:40,733 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2025-01-09 13:17:40,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 13:17:40,734 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:17:40,734 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:17:40,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 13:17:40,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:17:40,935 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:17:40,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:17:40,935 INFO L85 PathProgramCache]: Analyzing trace with hash -214591336, now seen corresponding path program 1 times [2025-01-09 13:17:40,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:17:40,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896460505] [2025-01-09 13:17:40,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:17:40,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:17:40,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 13:17:40,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 13:17:40,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:17:40,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:17:41,129 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-01-09 13:17:41,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:17:41,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896460505] [2025-01-09 13:17:41,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896460505] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:17:41,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935889673] [2025-01-09 13:17:41,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:17:41,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:17:41,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:17:41,134 INFO L229 MonitoredProcess]: Starting monitored process 4 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 13:17:41,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 13:17:41,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 13:17:41,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 13:17:41,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:17:41,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:17:41,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 13:17:41,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:17:41,386 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 13:17:41,386 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:17:41,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935889673] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:17:41,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:17:41,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2025-01-09 13:17:41,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551693727] [2025-01-09 13:17:41,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:17:41,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:17:41,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:17:41,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:17:41,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:17:41,389 INFO L87 Difference]: Start difference. First operand 50 states and 65 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 13:17:41,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:17:41,550 INFO L93 Difference]: Finished difference Result 147 states and 194 transitions. [2025-01-09 13:17:41,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 13:17:41,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 70 [2025-01-09 13:17:41,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:17:41,552 INFO L225 Difference]: With dead ends: 147 [2025-01-09 13:17:41,552 INFO L226 Difference]: Without dead ends: 100 [2025-01-09 13:17:41,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 13:17:41,553 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 54 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:17:41,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 193 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:17:41,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-09 13:17:41,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 77. [2025-01-09 13:17:41,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 states have internal predecessors, (64), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 13:17:41,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 100 transitions. [2025-01-09 13:17:41,578 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 100 transitions. Word has length 70 [2025-01-09 13:17:41,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:17:41,579 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 100 transitions. [2025-01-09 13:17:41,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 13:17:41,579 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 100 transitions. [2025-01-09 13:17:41,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 13:17:41,580 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:17:41,580 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:17:41,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 13:17:41,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:17:41,780 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:17:41,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:17:41,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1579662426, now seen corresponding path program 1 times [2025-01-09 13:17:41,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:17:41,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137145276] [2025-01-09 13:17:41,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:17:41,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:17:41,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 13:17:41,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 13:17:41,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:17:41,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 13:17:41,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1954910788] [2025-01-09 13:17:41,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:17:41,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:17:41,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:17:41,862 INFO L229 MonitoredProcess]: Starting monitored process 5 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 13:17:41,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 13:17:41,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 13:17:41,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 13:17:41,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:17:41,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:17:41,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 13:17:41,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:17:42,179 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 13:17:42,180 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:17:42,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:17:42,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137145276] [2025-01-09 13:17:42,181 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 13:17:42,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954910788] [2025-01-09 13:17:42,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954910788] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:17:42,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:17:42,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:17:42,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048234733] [2025-01-09 13:17:42,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:17:42,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:17:42,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:17:42,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:17:42,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:17:42,183 INFO L87 Difference]: Start difference. First operand 77 states and 100 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 13:17:42,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:17:42,278 INFO L93 Difference]: Finished difference Result 147 states and 192 transitions. [2025-01-09 13:17:42,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:17:42,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 71 [2025-01-09 13:17:42,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:17:42,280 INFO L225 Difference]: With dead ends: 147 [2025-01-09 13:17:42,280 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 13:17:42,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:17:42,281 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 46 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:17:42,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 147 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:17:42,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 13:17:42,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 91. [2025-01-09 13:17:42,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 68 states have internal predecessors, (81), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 13:17:42,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 117 transitions. [2025-01-09 13:17:42,296 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 117 transitions. Word has length 71 [2025-01-09 13:17:42,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:17:42,296 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 117 transitions. [2025-01-09 13:17:42,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 13:17:42,296 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2025-01-09 13:17:42,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 13:17:42,297 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:17:42,299 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:17:42,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 13:17:42,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:17:42,499 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:17:42,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:17:42,500 INFO L85 PathProgramCache]: Analyzing trace with hash 563975032, now seen corresponding path program 1 times [2025-01-09 13:17:42,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:17:42,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055536271] [2025-01-09 13:17:42,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:17:42,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:17:42,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 13:17:42,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 13:17:42,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:17:42,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 13:17:42,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1669362024] [2025-01-09 13:17:42,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:17:42,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:17:42,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:17:42,550 INFO L229 MonitoredProcess]: Starting monitored process 6 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 13:17:42,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 13:17:42,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 13:17:42,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 13:17:42,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:17:42,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:17:42,619 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:17:42,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 13:17:42,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 13:17:42,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:17:42,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:17:42,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:17:42,699 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:17:42,700 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:17:42,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 13:17:42,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:17:42,909 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 13:17:42,971 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:17:42,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:17:42 BoogieIcfgContainer [2025-01-09 13:17:42,977 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:17:42,978 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:17:42,978 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:17:42,978 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:17:42,979 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:17:38" (3/4) ... [2025-01-09 13:17:42,980 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:17:42,981 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:17:42,982 INFO L158 Benchmark]: Toolchain (without parser) took 5132.14ms. Allocated memory is still 142.6MB. Free memory was 114.2MB in the beginning and 47.9MB in the end (delta: 66.3MB). Peak memory consumption was 62.6MB. Max. memory is 16.1GB. [2025-01-09 13:17:42,982 INFO L158 Benchmark]: CDTParser took 0.74ms. Allocated memory is still 201.3MB. Free memory is still 122.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:17:42,982 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.85ms. Allocated memory is still 142.6MB. Free memory was 114.2MB in the beginning and 101.5MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:17:42,982 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.71ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 98.2MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:17:42,982 INFO L158 Benchmark]: Boogie Preprocessor took 61.06ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 94.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:17:42,983 INFO L158 Benchmark]: RCFGBuilder took 387.59ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 74.1MB in the end (delta: 20.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 13:17:42,983 INFO L158 Benchmark]: TraceAbstraction took 4327.94ms. Allocated memory is still 142.6MB. Free memory was 73.6MB in the beginning and 47.9MB in the end (delta: 25.7MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2025-01-09 13:17:42,984 INFO L158 Benchmark]: Witness Printer took 3.35ms. Allocated memory is still 142.6MB. Free memory was 47.9MB in the beginning and 47.9MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:17:42,986 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.74ms. Allocated memory is still 201.3MB. Free memory is still 122.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.85ms. Allocated memory is still 142.6MB. Free memory was 114.2MB in the beginning and 101.5MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.71ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 98.2MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.06ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 94.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 387.59ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 74.1MB in the end (delta: 20.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4327.94ms. Allocated memory is still 142.6MB. Free memory was 73.6MB in the beginning and 47.9MB in the end (delta: 25.7MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. * Witness Printer took 3.35ms. Allocated memory is still 142.6MB. Free memory was 47.9MB in the beginning and 47.9MB in the end (delta: 27.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 bitwiseOr at line 37, overapproximation of bitwiseOr at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 81. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 8; [L23] unsigned short int var_1_2 = 59049; [L24] unsigned char var_1_6 = 4; [L25] unsigned char var_1_7 = 1; [L26] unsigned char var_1_8 = 64; [L27] unsigned long int var_1_9 = 64; [L28] unsigned long int var_1_10 = 1776833134; [L29] signed long int var_1_11 = -16; [L30] double var_1_12 = 0.25; [L31] double var_1_13 = 5.5; [L32] unsigned char last_1_var_1_8 = 64; [L33] signed long int last_1_var_1_11 = -16; VAL [isInitial=0, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=59049, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L85] isInitial = 1 [L86] FCALL initially() [L87] int k_loop; [L88] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=59049, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L88] COND TRUE k_loop < 1 [L89] CALL updateLastVariables() [L77] last_1_var_1_8 = var_1_8 [L78] last_1_var_1_11 = var_1_11 VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=59049, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L89] RET updateLastVariables() [L90] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_ushort() [L62] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L62] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L63] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L63] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L64] var_1_6 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_7=1, var_1_8=64, var_1_9=64] [L65] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_7=1, var_1_8=64, var_1_9=64] [L66] CALL assume_abort_if_not(var_1_6 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L66] RET assume_abort_if_not(var_1_6 <= 254) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L67] var_1_7 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_8=64, var_1_9=64] [L68] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_8=64, var_1_9=64] [L69] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L69] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L70] var_1_10 = __VERIFIER_nondet_ulong() [L71] CALL assume_abort_if_not(var_1_10 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L71] RET assume_abort_if_not(var_1_10 >= 1073741824) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L72] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L72] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L73] var_1_13 = __VERIFIER_nondet_double() [L74] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=-16, var_1_12=1/4, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=-16, var_1_12=1/4, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L74] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=-16, var_1_12=1/4, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L90] RET updateVariables() [L91] CALL step() [L37] EXPR (var_1_2 - last_1_var_1_8) ^ (last_1_var_1_8 * last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=-16, var_1_12=1/4, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L37] COND TRUE ((var_1_2 - last_1_var_1_8) ^ (last_1_var_1_8 * last_1_var_1_11)) <= -64 [L38] var_1_1 = ((((1) < (((((16) > (var_1_6)) ? (16) : (var_1_6))))) ? (1) : (((((16) > (var_1_6)) ? (16) : (var_1_6)))))) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=-16, var_1_12=1/4, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L44] var_1_11 = var_1_1 VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=1, var_1_12=1/4, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L45] COND TRUE var_1_1 >= ((((var_1_11 / var_1_2) < 0 ) ? -(var_1_11 / var_1_2) : (var_1_11 / var_1_2))) [L46] var_1_8 = var_1_6 VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=1, var_1_12=1/4, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=64] [L52] unsigned char stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, stepLocal_0=1, var_1_10=-3221225472, var_1_11=1, var_1_12=1/4, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=64] [L53] COND FALSE !(var_1_1 > stepLocal_0) [L56] var_1_9 = ((1228227409u + var_1_10) - var_1_11) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=1, var_1_12=1/4, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1992998064] [L58] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=1, var_1_12=2, var_1_13=2, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1992998064] [L91] RET step() [L92] CALL, EXPR property() [L81] EXPR (var_1_2 - last_1_var_1_8) ^ (last_1_var_1_8 * last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=1, var_1_12=2, var_1_13=2, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1992998064] [L81-L82] return (((((((var_1_2 - last_1_var_1_8) ^ (last_1_var_1_8 * last_1_var_1_11)) <= -64) ? (var_1_1 == ((unsigned char) ((((1) < (((((16) > (var_1_6)) ? (16) : (var_1_6))))) ? (1) : (((((16) > (var_1_6)) ? (16) : (var_1_6)))))))) : (var_1_7 ? (var_1_1 == ((unsigned char) var_1_6)) : 1)) && ((var_1_1 >= ((((var_1_11 / var_1_2) < 0 ) ? -(var_1_11 / var_1_2) : (var_1_11 / var_1_2)))) ? (var_1_8 == ((unsigned char) var_1_6)) : (var_1_7 ? (var_1_8 == ((unsigned char) var_1_6)) : 1))) && ((var_1_1 > var_1_1) ? (var_1_9 == ((unsigned long int) var_1_2)) : (var_1_9 == ((unsigned long int) ((1228227409u + var_1_10) - var_1_11))))) && (var_1_11 == ((signed long int) var_1_1))) && (var_1_12 == ((double) var_1_13)) ; [L92] RET, EXPR property() [L92] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=1, var_1_12=2, var_1_13=2, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1992998064] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=1, var_1_12=2, var_1_13=2, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1992998064] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 6, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 169 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 169 mSDsluCounter, 624 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 350 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 186 IncrementalHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 274 mSDtfsCounter, 186 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 364 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=5, 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, 33 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 770 NumberOfCodeBlocks, 770 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 610 ConstructedInterpolants, 1 QuantifiedInterpolants, 1719 SizeOfPredicates, 9 NumberOfNonLiveVariables, 725 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 1184/1296 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 13:17:43,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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_loopvsstraightlinecode_25-1loop_file-37.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 602710bfdeba1413bfd2cc1b6bd5a194591bac373d29bd83e435c67ebf5ec2d9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:17:45,125 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:17:45,246 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 13:17:45,251 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:17:45,252 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:17:45,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:17:45,271 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:17:45,271 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:17:45,272 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:17:45,272 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:17:45,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:17:45,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:17:45,273 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:17:45,273 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:17:45,273 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:17:45,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:17:45,273 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:17:45,273 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:17:45,273 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:17:45,273 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:17:45,273 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:17:45,273 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:17:45,273 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:17:45,274 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:17:45,274 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:17:45,274 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:17:45,274 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:17:45,274 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:17:45,274 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:17:45,274 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:17:45,274 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:17:45,274 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:17:45,274 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:17:45,274 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:17:45,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:17:45,274 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:17:45,275 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:17:45,275 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:17:45,275 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:17:45,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:17:45,275 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:17:45,275 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:17:45,275 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:17:45,275 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:17:45,275 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:17:45,275 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:17:45,275 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:17:45,277 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:17:45,277 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:17:45,277 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:17:45,277 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 -> 602710bfdeba1413bfd2cc1b6bd5a194591bac373d29bd83e435c67ebf5ec2d9 [2025-01-09 13:17:45,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:17:45,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:17:45,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:17:45,567 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:17:45,567 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:17:45,568 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-37.i [2025-01-09 13:17:46,887 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd6111285/21c82c196d514d4dbddb105f257d45b3/FLAG77231ff70 [2025-01-09 13:17:47,070 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:17:47,071 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-37.i [2025-01-09 13:17:47,080 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd6111285/21c82c196d514d4dbddb105f257d45b3/FLAG77231ff70 [2025-01-09 13:17:47,098 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd6111285/21c82c196d514d4dbddb105f257d45b3 [2025-01-09 13:17:47,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:17:47,105 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:17:47,106 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:17:47,106 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:17:47,111 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:17:47,111 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:17:47" (1/1) ... [2025-01-09 13:17:47,112 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dff06c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:17:47, skipping insertion in model container [2025-01-09 13:17:47,112 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:17:47" (1/1) ... [2025-01-09 13:17:47,131 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:17:47,262 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_loopvsstraightlinecode_25-1loop_file-37.i[915,928] [2025-01-09 13:17:47,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:17:47,318 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:17:47,332 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_loopvsstraightlinecode_25-1loop_file-37.i[915,928] [2025-01-09 13:17:47,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:17:47,378 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:17:47,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:17:47 WrapperNode [2025-01-09 13:17:47,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:17:47,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:17:47,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:17:47,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:17:47,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:17:47" (1/1) ... [2025-01-09 13:17:47,398 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:17:47" (1/1) ... [2025-01-09 13:17:47,423 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2025-01-09 13:17:47,425 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:17:47,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:17:47,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:17:47,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:17:47,437 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:17:47" (1/1) ... [2025-01-09 13:17:47,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:17:47" (1/1) ... [2025-01-09 13:17:47,442 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:17:47" (1/1) ... [2025-01-09 13:17:47,457 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 13:17:47,457 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:17:47" (1/1) ... [2025-01-09 13:17:47,457 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:17:47" (1/1) ... [2025-01-09 13:17:47,468 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:17:47" (1/1) ... [2025-01-09 13:17:47,470 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:17:47" (1/1) ... [2025-01-09 13:17:47,472 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:17:47" (1/1) ... [2025-01-09 13:17:47,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:17:47" (1/1) ... [2025-01-09 13:17:47,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:17:47" (1/1) ... [2025-01-09 13:17:47,477 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:17:47,478 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:17:47,478 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:17:47,478 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:17:47,485 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:17:47" (1/1) ... [2025-01-09 13:17:47,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:17:47,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:17:47,527 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 13:17:47,538 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 13:17:47,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:17:47,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:17:47,560 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:17:47,560 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:17:47,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:17:47,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:17:47,641 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:17:47,643 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:17:47,925 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-01-09 13:17:47,926 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:17:47,936 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:17:47,938 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:17:47,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:17:47 BoogieIcfgContainer [2025-01-09 13:17:47,939 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:17:47,941 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:17:47,941 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:17:47,946 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:17:47,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:17:47" (1/3) ... [2025-01-09 13:17:47,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4acec9b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:17:47, skipping insertion in model container [2025-01-09 13:17:47,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:17:47" (2/3) ... [2025-01-09 13:17:47,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4acec9b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:17:47, skipping insertion in model container [2025-01-09 13:17:47,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:17:47" (3/3) ... [2025-01-09 13:17:47,949 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-37.i [2025-01-09 13:17:47,962 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:17:47,965 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-37.i that has 2 procedures, 40 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:17:48,014 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:17:48,027 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;@70bd18e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:17:48,028 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:17:48,031 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 13:17:48,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 13:17:48,038 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:17:48,038 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:17:48,039 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:17:48,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:17:48,048 INFO L85 PathProgramCache]: Analyzing trace with hash 801811682, now seen corresponding path program 1 times [2025-01-09 13:17:48,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:17:48,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1571002566] [2025-01-09 13:17:48,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:17:48,061 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 13:17:48,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:17:48,063 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 13:17:48,065 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 13:17:48,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 13:17:48,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 13:17:48,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:17:48,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:17:48,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:17:48,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:17:48,247 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-01-09 13:17:48,247 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:17:48,247 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:17:48,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1571002566] [2025-01-09 13:17:48,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1571002566] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:17:48,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:17:48,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 13:17:48,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861281072] [2025-01-09 13:17:48,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:17:48,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:17:48,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:17:48,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:17:48,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:17:48,274 INFO L87 Difference]: Start difference. First operand has 40 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 13:17:48,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:17:48,291 INFO L93 Difference]: Finished difference Result 77 states and 116 transitions. [2025-01-09 13:17:48,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:17:48,293 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 65 [2025-01-09 13:17:48,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:17:48,299 INFO L225 Difference]: With dead ends: 77 [2025-01-09 13:17:48,299 INFO L226 Difference]: Without dead ends: 37 [2025-01-09 13:17:48,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 64 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 13:17:48,304 INFO L435 NwaCegarLoop]: 53 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, 53 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 13:17:48,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:17:48,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-01-09 13:17:48,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-01-09 13:17:48,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 13:17:48,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2025-01-09 13:17:48,333 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 65 [2025-01-09 13:17:48,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:17:48,333 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2025-01-09 13:17:48,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 13:17:48,334 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2025-01-09 13:17:48,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 13:17:48,335 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:17:48,336 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:17:48,343 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 13:17:48,536 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 13:17:48,537 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:17:48,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:17:48,537 INFO L85 PathProgramCache]: Analyzing trace with hash 193515552, now seen corresponding path program 1 times [2025-01-09 13:17:48,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:17:48,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746656219] [2025-01-09 13:17:48,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:17:48,538 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 13:17:48,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:17:48,540 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 13:17:48,541 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 13:17:48,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 13:17:48,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 13:17:48,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:17:48,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:17:48,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 13:17:48,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:17:48,742 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 13:17:48,742 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:17:48,743 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:17:48,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746656219] [2025-01-09 13:17:48,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1746656219] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:17:48,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:17:48,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:17:48,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822171596] [2025-01-09 13:17:48,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:17:48,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:17:48,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:17:48,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:17:48,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:17:48,746 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 13:17:48,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:17:48,840 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2025-01-09 13:17:48,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:17:48,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 65 [2025-01-09 13:17:48,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:17:48,845 INFO L225 Difference]: With dead ends: 71 [2025-01-09 13:17:48,845 INFO L226 Difference]: Without dead ends: 37 [2025-01-09 13:17:48,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 63 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 13:17:48,846 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:17:48,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:17:48,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-01-09 13:17:48,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-01-09 13:17:48,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 13:17:48,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2025-01-09 13:17:48,854 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 65 [2025-01-09 13:17:48,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:17:48,855 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2025-01-09 13:17:48,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 13:17:48,855 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2025-01-09 13:17:48,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 13:17:48,856 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:17:48,857 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:17:48,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 13:17:49,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 13:17:49,061 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:17:49,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:17:49,062 INFO L85 PathProgramCache]: Analyzing trace with hash 250773854, now seen corresponding path program 1 times [2025-01-09 13:17:49,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:17:49,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [235385814] [2025-01-09 13:17:49,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:17:49,063 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 13:17:49,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:17:49,065 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 13:17:49,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 13:17:49,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 13:17:49,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 13:17:49,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:17:49,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:17:49,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 13:17:49,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:18:09,598 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-01-09 13:18:09,598 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:18:09,598 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:18:09,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [235385814] [2025-01-09 13:18:09,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [235385814] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:18:09,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:18:09,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 13:18:09,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947174976] [2025-01-09 13:18:09,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:18:09,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 13:18:09,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:18:09,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 13:18:09,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-09 13:18:09,600 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 13:18:11,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:18:11,025 INFO L93 Difference]: Finished difference Result 87 states and 112 transitions. [2025-01-09 13:18:11,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 13:18:11,027 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 65 [2025-01-09 13:18:11,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:18:11,028 INFO L225 Difference]: With dead ends: 87 [2025-01-09 13:18:11,028 INFO L226 Difference]: Without dead ends: 53 [2025-01-09 13:18:11,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2025-01-09 13:18:11,029 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 68 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 13:18:11,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 160 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 13:18:11,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-09 13:18:11,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2025-01-09 13:18:11,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 13:18:11,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2025-01-09 13:18:11,039 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 65 [2025-01-09 13:18:11,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:18:11,039 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2025-01-09 13:18:11,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 13:18:11,039 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2025-01-09 13:18:11,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 13:18:11,041 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:18:11,041 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:18:11,046 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 (4)] Ended with exit code 0 [2025-01-09 13:18:11,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 13:18:11,242 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:18:11,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:18:11,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1203540469, now seen corresponding path program 1 times [2025-01-09 13:18:11,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:18:11,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1297797754] [2025-01-09 13:18:11,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:18:11,243 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 13:18:11,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:18:11,245 INFO L229 MonitoredProcess]: Starting monitored process 5 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 13:18:11,246 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 (5)] Waiting until timeout for monitored process [2025-01-09 13:18:11,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 13:18:11,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 13:18:11,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:18:11,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:18:11,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 13:18:11,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:18:11,721 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 13:18:11,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:18:12,012 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:18:12,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1297797754] [2025-01-09 13:18:12,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1297797754] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:18:12,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1763355813] [2025-01-09 13:18:12,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:18:12,013 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 13:18:12,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 13:18:12,039 INFO L229 MonitoredProcess]: Starting monitored process 6 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 13:18:12,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-01-09 13:18:12,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 13:18:12,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 13:18:12,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:18:12,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:18:12,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 13:18:12,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:18:30,071 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-01-09 13:18:30,072 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:18:30,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1763355813] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:18:30,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:18:30,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 19 [2025-01-09 13:18:30,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690641263] [2025-01-09 13:18:30,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:18:30,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 13:18:30,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:18:30,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 13:18:30,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2025-01-09 13:18:30,073 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 13:18:37,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:18:37,685 INFO L93 Difference]: Finished difference Result 120 states and 145 transitions. [2025-01-09 13:18:37,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 13:18:37,692 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 66 [2025-01-09 13:18:37,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:18:37,694 INFO L225 Difference]: With dead ends: 120 [2025-01-09 13:18:37,694 INFO L226 Difference]: Without dead ends: 74 [2025-01-09 13:18:37,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2025-01-09 13:18:37,696 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 74 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:18:37,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 203 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-01-09 13:18:37,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-01-09 13:18:37,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2025-01-09 13:18:37,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 13:18:37,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2025-01-09 13:18:37,707 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 66 [2025-01-09 13:18:37,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:18:37,708 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2025-01-09 13:18:37,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 13:18:37,708 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2025-01-09 13:18:37,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 13:18:37,710 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:18:37,711 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:18:37,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-01-09 13:18:37,917 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 (5)] Ended with exit code 0 [2025-01-09 13:18:38,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,5 /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 13:18:38,112 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:18:38,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:18:38,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1596567479, now seen corresponding path program 1 times [2025-01-09 13:18:38,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:18:38,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402768854] [2025-01-09 13:18:38,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:18:38,113 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 13:18:38,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:18:38,117 INFO L229 MonitoredProcess]: Starting monitored process 7 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 13:18:38,118 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 (7)] Waiting until timeout for monitored process [2025-01-09 13:18:38,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 13:18:38,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 13:18:38,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:18:38,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:18:38,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 13:18:38,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:18:38,568 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 13:18:38,568 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:18:38,849 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:18:38,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402768854] [2025-01-09 13:18:38,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402768854] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:18:38,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [726283107] [2025-01-09 13:18:38,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:18:38,850 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 13:18:38,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 13:18:38,852 INFO L229 MonitoredProcess]: Starting monitored process 8 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 13:18:38,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-01-09 13:18:38,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 13:18:39,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 13:18:39,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:18:39,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:18:39,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 13:18:39,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:18:53,887 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-01-09 13:18:53,887 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:18:53,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [726283107] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:18:53,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:18:53,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 18 [2025-01-09 13:18:53,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809832485] [2025-01-09 13:18:53,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:18:53,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 13:18:53,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:18:53,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 13:18:53,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-01-09 13:18:53,889 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 13:18:58,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:18:58,874 INFO L93 Difference]: Finished difference Result 139 states and 174 transitions. [2025-01-09 13:18:58,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 13:18:58,875 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 66 [2025-01-09 13:18:58,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:18:58,876 INFO L225 Difference]: With dead ends: 139 [2025-01-09 13:18:58,876 INFO L226 Difference]: Without dead ends: 90 [2025-01-09 13:18:58,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2025-01-09 13:18:58,878 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 27 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:18:58,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 205 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-09 13:18:58,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-09 13:18:58,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2025-01-09 13:18:58,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.125) internal successors, (72), 64 states have internal predecessors, (72), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 13:18:58,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 108 transitions. [2025-01-09 13:18:58,891 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 108 transitions. Word has length 66 [2025-01-09 13:18:58,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:18:58,891 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 108 transitions. [2025-01-09 13:18:58,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 13:18:58,892 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2025-01-09 13:18:58,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 13:18:58,892 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:18:58,893 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:18:58,900 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 (7)] Ended with exit code 0 [2025-01-09 13:18:59,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2025-01-09 13:18:59,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 13:18:59,294 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:18:59,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:18:59,294 INFO L85 PathProgramCache]: Analyzing trace with hash -852983464, now seen corresponding path program 1 times [2025-01-09 13:18:59,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:18:59,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477613874] [2025-01-09 13:18:59,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:18:59,295 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 13:18:59,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:18:59,297 INFO L229 MonitoredProcess]: Starting monitored process 9 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 13:18:59,298 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 (9)] Waiting until timeout for monitored process [2025-01-09 13:18:59,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 13:18:59,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 13:18:59,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:18:59,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:18:59,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 13:18:59,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:18:59,674 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 13:18:59,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:18:59,901 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:18:59,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477613874] [2025-01-09 13:18:59,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477613874] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:18:59,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1498267008] [2025-01-09 13:18:59,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:18:59,901 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 13:18:59,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 13:18:59,903 INFO L229 MonitoredProcess]: Starting monitored process 10 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 13:18:59,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-01-09 13:18:59,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 13:19:00,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 13:19:00,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:00,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:19:00,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 13:19:00,240 INFO L279 TraceCheckSpWp]: Computing forward predicates...