./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-13.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 70056f6ecf6cc1e792a4daa4b0ef5828c715d2ed64331075caaff01f6900b2e4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:38:32,457 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:38:32,494 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:38:32,497 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:38:32,497 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:38:32,521 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:38:32,523 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:38:32,523 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:38:32,523 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:38:32,523 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:38:32,524 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:38:32,524 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:38:32,524 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:38:32,525 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:38:32,525 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:38:32,525 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:38:32,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:38:32,525 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:38:32,525 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:38:32,525 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:38:32,525 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:38:32,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:38:32,525 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:38:32,525 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:38:32,525 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:38:32,525 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:38:32,525 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:38:32,525 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:38:32,525 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:38:32,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:38:32,525 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:38:32,525 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:38:32,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:38:32,525 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:38:32,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:38:32,525 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:38:32,526 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:38:32,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:38:32,526 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:38:32,526 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:38:32,526 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:38:32,526 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:38:32,526 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:38:32,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:38:32,526 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:38:32,526 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:38:32,526 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:38:32,527 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:38:32,527 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 -> 70056f6ecf6cc1e792a4daa4b0ef5828c715d2ed64331075caaff01f6900b2e4 [2025-01-09 12:38:32,739 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:38:32,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:38:32,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:38:32,746 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:38:32,746 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:38:32,747 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-13.i [2025-01-09 12:38:33,951 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5fc2bc571/204be6afae3c49808aecf135032649b0/FLAG65aede0e0 [2025-01-09 12:38:34,229 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:38:34,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-13.i [2025-01-09 12:38:34,238 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5fc2bc571/204be6afae3c49808aecf135032649b0/FLAG65aede0e0 [2025-01-09 12:38:34,249 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5fc2bc571/204be6afae3c49808aecf135032649b0 [2025-01-09 12:38:34,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:38:34,252 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:38:34,253 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:38:34,253 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:38:34,256 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:38:34,256 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:38:34" (1/1) ... [2025-01-09 12:38:34,257 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33211a5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:38:34, skipping insertion in model container [2025-01-09 12:38:34,257 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:38:34" (1/1) ... [2025-01-09 12:38:34,268 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:38:34,355 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-13.i[916,929] [2025-01-09 12:38:34,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:38:34,400 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:38:34,409 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-13.i[916,929] [2025-01-09 12:38:34,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:38:34,440 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:38:34,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:38:34 WrapperNode [2025-01-09 12:38:34,442 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:38:34,443 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:38:34,443 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:38:34,443 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:38:34,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:38:34" (1/1) ... [2025-01-09 12:38:34,454 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:38:34" (1/1) ... [2025-01-09 12:38:34,472 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2025-01-09 12:38:34,472 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:38:34,472 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:38:34,472 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:38:34,472 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:38:34,478 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:38:34" (1/1) ... [2025-01-09 12:38:34,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:38:34" (1/1) ... [2025-01-09 12:38:34,480 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:38:34" (1/1) ... [2025-01-09 12:38:34,487 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 12:38:34,487 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:38:34" (1/1) ... [2025-01-09 12:38:34,487 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:38:34" (1/1) ... [2025-01-09 12:38:34,490 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:38:34" (1/1) ... [2025-01-09 12:38:34,491 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:38:34" (1/1) ... [2025-01-09 12:38:34,492 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:38:34" (1/1) ... [2025-01-09 12:38:34,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:38:34" (1/1) ... [2025-01-09 12:38:34,494 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:38:34" (1/1) ... [2025-01-09 12:38:34,495 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:38:34,495 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:38:34,495 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:38:34,495 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:38:34,496 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:38:34" (1/1) ... [2025-01-09 12:38:34,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:38:34,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:38:34,525 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:38:34,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:38:34,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:38:34,541 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:38:34,541 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:38:34,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:38:34,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:38:34,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:38:34,586 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:38:34,587 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:38:34,749 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-01-09 12:38:34,749 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:38:34,756 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:38:34,757 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:38:34,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:38:34 BoogieIcfgContainer [2025-01-09 12:38:34,757 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:38:34,759 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:38:34,759 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:38:34,762 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:38:34,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:38:34" (1/3) ... [2025-01-09 12:38:34,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b303d08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:38:34, skipping insertion in model container [2025-01-09 12:38:34,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:38:34" (2/3) ... [2025-01-09 12:38:34,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b303d08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:38:34, skipping insertion in model container [2025-01-09 12:38:34,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:38:34" (3/3) ... [2025-01-09 12:38:34,764 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-13.i [2025-01-09 12:38:34,775 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:38:34,776 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-13.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:38:34,818 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:38:34,826 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;@7f03a0a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:38:34,827 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:38:34,829 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 12:38:34,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 12:38:34,836 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:38:34,836 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:38:34,837 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:38:34,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:38:34,841 INFO L85 PathProgramCache]: Analyzing trace with hash 385391529, now seen corresponding path program 1 times [2025-01-09 12:38:34,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:38:34,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607028511] [2025-01-09 12:38:34,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:38:34,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:38:34,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 12:38:34,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 12:38:34,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:38:34,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:38:35,058 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 12:38:35,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:38:35,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607028511] [2025-01-09 12:38:35,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607028511] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:38:35,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262625764] [2025-01-09 12:38:35,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:38:35,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:38:35,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:38:35,067 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:38:35,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 12:38:35,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 12:38:35,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 12:38:35,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:38:35,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:38:35,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:38:35,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:38:35,228 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 12:38:35,228 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:38:35,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262625764] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:38:35,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:38:35,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:38:35,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941064611] [2025-01-09 12:38:35,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:38:35,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:38:35,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:38:35,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:38:35,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:38:35,251 INFO L87 Difference]: Start difference. First operand has 52 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 12:38:35,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:38:35,270 INFO L93 Difference]: Finished difference Result 98 states and 168 transitions. [2025-01-09 12:38:35,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:38:35,273 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 118 [2025-01-09 12:38:35,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:38:35,278 INFO L225 Difference]: With dead ends: 98 [2025-01-09 12:38:35,279 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 12:38:35,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:38:35,285 INFO L435 NwaCegarLoop]: 71 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, 71 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:38:35,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:38:35,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 12:38:35,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-09 12:38:35,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 12:38:35,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2025-01-09 12:38:35,319 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 118 [2025-01-09 12:38:35,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:38:35,319 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2025-01-09 12:38:35,319 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 12:38:35,319 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2025-01-09 12:38:35,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 12:38:35,322 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:38:35,322 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:38:35,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 12:38:35,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 12:38:35,527 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:38:35,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:38:35,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1264211017, now seen corresponding path program 1 times [2025-01-09 12:38:35,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:38:35,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271799284] [2025-01-09 12:38:35,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:38:35,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:38:35,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 12:38:35,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 12:38:35,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:38:35,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:38:37,063 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 12:38:37,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:38:37,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271799284] [2025-01-09 12:38:37,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271799284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:38:37,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:38:37,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 12:38:37,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878245042] [2025-01-09 12:38:37,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:38:37,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 12:38:37,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:38:37,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 12:38:37,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 12:38:37,069 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 12:38:37,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:38:37,447 INFO L93 Difference]: Finished difference Result 126 states and 173 transitions. [2025-01-09 12:38:37,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 12:38:37,447 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 119 [2025-01-09 12:38:37,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:38:37,450 INFO L225 Difference]: With dead ends: 126 [2025-01-09 12:38:37,451 INFO L226 Difference]: Without dead ends: 124 [2025-01-09 12:38:37,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:38:37,452 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 128 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:38:37,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 513 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:38:37,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-01-09 12:38:37,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 100. [2025-01-09 12:38:37,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 12:38:37,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 147 transitions. [2025-01-09 12:38:37,479 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 147 transitions. Word has length 119 [2025-01-09 12:38:37,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:38:37,481 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 147 transitions. [2025-01-09 12:38:37,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 12:38:37,481 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 147 transitions. [2025-01-09 12:38:37,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 12:38:37,483 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:38:37,484 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:38:37,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:38:37,484 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:38:37,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:38:37,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1266058059, now seen corresponding path program 1 times [2025-01-09 12:38:37,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:38:37,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856028347] [2025-01-09 12:38:37,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:38:37,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:38:37,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 12:38:37,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 12:38:37,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:38:37,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:38:38,494 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 12:38:38,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:38:38,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856028347] [2025-01-09 12:38:38,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856028347] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:38:38,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:38:38,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 12:38:38,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138003451] [2025-01-09 12:38:38,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:38:38,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:38:38,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:38:38,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:38:38,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:38:38,496 INFO L87 Difference]: Start difference. First operand 100 states and 147 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 12:38:38,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:38:38,688 INFO L93 Difference]: Finished difference Result 124 states and 171 transitions. [2025-01-09 12:38:38,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:38:38,689 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 119 [2025-01-09 12:38:38,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:38:38,690 INFO L225 Difference]: With dead ends: 124 [2025-01-09 12:38:38,690 INFO L226 Difference]: Without dead ends: 122 [2025-01-09 12:38:38,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:38:38,691 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 97 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:38:38,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 521 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:38:38,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-09 12:38:38,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 100. [2025-01-09 12:38:38,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 12:38:38,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 147 transitions. [2025-01-09 12:38:38,702 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 147 transitions. Word has length 119 [2025-01-09 12:38:38,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:38:38,702 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 147 transitions. [2025-01-09 12:38:38,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 12:38:38,703 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 147 transitions. [2025-01-09 12:38:38,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 12:38:38,703 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:38:38,704 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:38:38,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:38:38,704 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:38:38,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:38:38,704 INFO L85 PathProgramCache]: Analyzing trace with hash 454864391, now seen corresponding path program 1 times [2025-01-09 12:38:38,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:38:38,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18517354] [2025-01-09 12:38:38,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:38:38,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:38:38,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 12:38:38,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 12:38:38,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:38:38,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:38:39,510 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 12:38:39,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:38:39,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18517354] [2025-01-09 12:38:39,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18517354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:38:39,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:38:39,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 12:38:39,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905267986] [2025-01-09 12:38:39,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:38:39,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 12:38:39,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:38:39,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 12:38:39,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 12:38:39,514 INFO L87 Difference]: Start difference. First operand 100 states and 147 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 12:38:39,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:38:39,729 INFO L93 Difference]: Finished difference Result 124 states and 171 transitions. [2025-01-09 12:38:39,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 12:38:39,729 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 119 [2025-01-09 12:38:39,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:38:39,730 INFO L225 Difference]: With dead ends: 124 [2025-01-09 12:38:39,731 INFO L226 Difference]: Without dead ends: 122 [2025-01-09 12:38:39,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:38:39,731 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 92 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:38:39,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 589 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:38:39,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-09 12:38:39,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 103. [2025-01-09 12:38:39,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 62 states have internal predecessors, (75), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 12:38:39,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 151 transitions. [2025-01-09 12:38:39,741 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 151 transitions. Word has length 119 [2025-01-09 12:38:39,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:38:39,741 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 151 transitions. [2025-01-09 12:38:39,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 12:38:39,742 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 151 transitions. [2025-01-09 12:38:39,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 12:38:39,742 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:38:39,743 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:38:39,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:38:39,743 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:38:39,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:38:39,743 INFO L85 PathProgramCache]: Analyzing trace with hash 456711433, now seen corresponding path program 1 times [2025-01-09 12:38:39,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:38:39,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744375311] [2025-01-09 12:38:39,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:38:39,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:38:39,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 12:38:39,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 12:38:39,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:38:39,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:38:40,371 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 12:38:40,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:38:40,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744375311] [2025-01-09 12:38:40,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744375311] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:38:40,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:38:40,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 12:38:40,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088051738] [2025-01-09 12:38:40,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:38:40,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:38:40,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:38:40,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:38:40,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:38:40,373 INFO L87 Difference]: Start difference. First operand 103 states and 151 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 12:38:40,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:38:40,880 INFO L93 Difference]: Finished difference Result 122 states and 169 transitions. [2025-01-09 12:38:40,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:38:40,881 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 119 [2025-01-09 12:38:40,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:38:40,882 INFO L225 Difference]: With dead ends: 122 [2025-01-09 12:38:40,883 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 12:38:40,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:38:40,883 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 98 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 12:38:40,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 676 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 12:38:40,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 12:38:40,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 100. [2025-01-09 12:38:40,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 12:38:40,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 147 transitions. [2025-01-09 12:38:40,905 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 147 transitions. Word has length 119 [2025-01-09 12:38:40,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:38:40,906 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 147 transitions. [2025-01-09 12:38:40,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 12:38:40,906 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 147 transitions. [2025-01-09 12:38:40,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 12:38:40,907 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:38:40,907 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:38:40,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 12:38:40,907 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:38:40,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:38:40,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1944269387, now seen corresponding path program 1 times [2025-01-09 12:38:40,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:38:40,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128060916] [2025-01-09 12:38:40,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:38:40,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:38:40,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 12:38:40,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 12:38:40,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:38:40,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:38:41,413 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 12:38:41,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:38:41,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128060916] [2025-01-09 12:38:41,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128060916] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:38:41,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:38:41,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 12:38:41,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715436626] [2025-01-09 12:38:41,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:38:41,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:38:41,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:38:41,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:38:41,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:38:41,415 INFO L87 Difference]: Start difference. First operand 100 states and 147 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 12:38:41,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:38:41,755 INFO L93 Difference]: Finished difference Result 211 states and 303 transitions. [2025-01-09 12:38:41,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:38:41,756 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 119 [2025-01-09 12:38:41,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:38:41,757 INFO L225 Difference]: With dead ends: 211 [2025-01-09 12:38:41,757 INFO L226 Difference]: Without dead ends: 209 [2025-01-09 12:38:41,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-01-09 12:38:41,758 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 137 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:38:41,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 601 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:38:41,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-01-09 12:38:41,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 194. [2025-01-09 12:38:41,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 113 states have (on average 1.2035398230088497) internal successors, (136), 113 states have internal predecessors, (136), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 12:38:41,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 288 transitions. [2025-01-09 12:38:41,776 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 288 transitions. Word has length 119 [2025-01-09 12:38:41,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:38:41,777 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 288 transitions. [2025-01-09 12:38:41,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 12:38:41,777 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 288 transitions. [2025-01-09 12:38:41,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 12:38:41,778 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:38:41,778 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:38:41,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 12:38:41,778 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:38:41,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:38:41,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1946116429, now seen corresponding path program 1 times [2025-01-09 12:38:41,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:38:41,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336014210] [2025-01-09 12:38:41,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:38:41,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:38:41,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 12:38:41,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 12:38:41,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:38:41,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:38:42,770 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 12:38:42,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:38:42,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336014210] [2025-01-09 12:38:42,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336014210] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:38:42,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:38:42,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:38:42,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476109216] [2025-01-09 12:38:42,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:38:42,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:38:42,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:38:42,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:38:42,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:38:42,773 INFO L87 Difference]: Start difference. First operand 194 states and 288 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 12:38:43,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:38:43,741 INFO L93 Difference]: Finished difference Result 242 states and 351 transitions. [2025-01-09 12:38:43,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:38:43,742 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 119 [2025-01-09 12:38:43,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:38:43,744 INFO L225 Difference]: With dead ends: 242 [2025-01-09 12:38:43,744 INFO L226 Difference]: Without dead ends: 240 [2025-01-09 12:38:43,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-01-09 12:38:43,745 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 92 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:38:43,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 397 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 12:38:43,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-01-09 12:38:43,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 236. [2025-01-09 12:38:43,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 139 states have (on average 1.1942446043165467) internal successors, (166), 141 states have internal predecessors, (166), 90 states have call successors, (90), 6 states have call predecessors, (90), 6 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 12:38:43,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 346 transitions. [2025-01-09 12:38:43,774 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 346 transitions. Word has length 119 [2025-01-09 12:38:43,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:38:43,774 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 346 transitions. [2025-01-09 12:38:43,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 12:38:43,775 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 346 transitions. [2025-01-09 12:38:43,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 12:38:43,775 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:38:43,776 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:38:43,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 12:38:43,776 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:38:43,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:38:43,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1134922761, now seen corresponding path program 1 times [2025-01-09 12:38:43,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:38:43,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177627939] [2025-01-09 12:38:43,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:38:43,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:38:43,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 12:38:43,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 12:38:43,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:38:43,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:38:44,196 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 12:38:44,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:38:44,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177627939] [2025-01-09 12:38:44,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177627939] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:38:44,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:38:44,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 12:38:44,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663640859] [2025-01-09 12:38:44,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:38:44,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 12:38:44,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:38:44,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 12:38:44,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 12:38:44,198 INFO L87 Difference]: Start difference. First operand 236 states and 346 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 12:38:44,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:38:44,431 INFO L93 Difference]: Finished difference Result 278 states and 390 transitions. [2025-01-09 12:38:44,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 12:38:44,431 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 119 [2025-01-09 12:38:44,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:38:44,436 INFO L225 Difference]: With dead ends: 278 [2025-01-09 12:38:44,437 INFO L226 Difference]: Without dead ends: 276 [2025-01-09 12:38:44,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:38:44,438 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 96 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:38:44,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 521 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:38:44,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-01-09 12:38:44,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 233. [2025-01-09 12:38:44,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 136 states have (on average 1.1911764705882353) internal successors, (162), 138 states have internal predecessors, (162), 90 states have call successors, (90), 6 states have call predecessors, (90), 6 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 12:38:44,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 342 transitions. [2025-01-09 12:38:44,469 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 342 transitions. Word has length 119 [2025-01-09 12:38:44,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:38:44,470 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 342 transitions. [2025-01-09 12:38:44,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 12:38:44,470 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 342 transitions. [2025-01-09 12:38:44,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 12:38:44,471 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:38:44,471 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:38:44,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 12:38:44,471 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:38:44,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:38:44,472 INFO L85 PathProgramCache]: Analyzing trace with hash 871184007, now seen corresponding path program 1 times [2025-01-09 12:38:44,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:38:44,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600575840] [2025-01-09 12:38:44,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:38:44,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:38:44,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 12:38:44,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 12:38:44,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:38:44,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:38:44,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [753118243] [2025-01-09 12:38:44,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:38:44,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:38:44,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:38:44,497 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 12:38:44,499 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 12:38:44,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 12:38:44,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 12:38:44,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:38:44,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:38:44,554 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 12:38:44,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 12:38:44,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 12:38:44,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:38:44,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:38:44,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 12:38:44,625 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 12:38:44,626 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:38:44,633 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 12:38:44,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:38:44,833 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:38:44,891 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 12:38:44,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:38:44 BoogieIcfgContainer [2025-01-09 12:38:44,893 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 12:38:44,894 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 12:38:44,894 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 12:38:44,894 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 12:38:44,895 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:38:34" (3/4) ... [2025-01-09 12:38:44,897 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 12:38:44,898 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 12:38:44,898 INFO L158 Benchmark]: Toolchain (without parser) took 10646.24ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 133.9MB in the beginning and 224.1MB in the end (delta: -90.2MB). Peak memory consumption was 133.7MB. Max. memory is 16.1GB. [2025-01-09 12:38:44,898 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 209.7MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:38:44,898 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.36ms. Allocated memory is still 167.8MB. Free memory was 133.5MB in the beginning and 121.0MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:38:44,898 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.23ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 118.6MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:38:44,898 INFO L158 Benchmark]: Boogie Preprocessor took 22.65ms. Allocated memory is still 167.8MB. Free memory was 118.6MB in the beginning and 115.7MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:38:44,899 INFO L158 Benchmark]: RCFGBuilder took 261.93ms. Allocated memory is still 167.8MB. Free memory was 115.7MB in the beginning and 100.2MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 12:38:44,899 INFO L158 Benchmark]: TraceAbstraction took 10134.68ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 99.4MB in the beginning and 224.2MB in the end (delta: -124.8MB). Peak memory consumption was 100.2MB. Max. memory is 16.1GB. [2025-01-09 12:38:44,899 INFO L158 Benchmark]: Witness Printer took 3.68ms. Allocated memory is still 394.3MB. Free memory was 224.2MB in the beginning and 224.1MB in the end (delta: 81.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:38:44,900 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.13ms. Allocated memory is still 209.7MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.36ms. Allocated memory is still 167.8MB. Free memory was 133.5MB in the beginning and 121.0MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.23ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 118.6MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.65ms. Allocated memory is still 167.8MB. Free memory was 118.6MB in the beginning and 115.7MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 261.93ms. Allocated memory is still 167.8MB. Free memory was 115.7MB in the beginning and 100.2MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10134.68ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 99.4MB in the beginning and 224.2MB in the end (delta: -124.8MB). Peak memory consumption was 100.2MB. Max. memory is 16.1GB. * Witness Printer took 3.68ms. Allocated memory is still 394.3MB. Free memory was 224.2MB in the beginning and 224.1MB in the end (delta: 81.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 someBinaryDOUBLEComparisonOperation at line 38, overapproximation of someBinaryDOUBLEComparisonOperation at line 92. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 25; [L23] unsigned char var_1_2 = 1; [L24] signed char var_1_5 = 16; [L25] unsigned short int var_1_6 = 16; [L26] signed char var_1_7 = 4; [L27] unsigned short int var_1_8 = 2; [L28] signed char var_1_9 = 64; [L29] signed char var_1_10 = 0; [L30] unsigned char var_1_11 = 16; [L31] signed long int var_1_12 = 128; [L32] signed long int var_1_13 = 50; [L33] signed long int var_1_14 = 3; [L34] signed long int var_1_15 = 25; VAL [isInitial=0, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L96] isInitial = 1 [L97] FCALL initially() [L99] FCALL updateLastVariables() [L100] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_uchar() [L61] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L61] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L62] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L62] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L63] var_1_6 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L64] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L65] CALL assume_abort_if_not(var_1_6 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L65] RET assume_abort_if_not(var_1_6 <= 65535) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L66] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=4, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=4, var_1_8=2, var_1_9=64] [L66] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=4, var_1_8=2, var_1_9=64] [L67] var_1_7 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64] [L68] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64] [L69] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64] [L69] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64] [L70] var_1_9 = __VERIFIER_nondet_char() [L71] CALL assume_abort_if_not(var_1_9 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L71] RET assume_abort_if_not(var_1_9 >= 63) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L72] CALL assume_abort_if_not(var_1_9 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L72] RET assume_abort_if_not(var_1_9 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L73] var_1_10 = __VERIFIER_nondet_char() [L74] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L74] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L75] CALL assume_abort_if_not(var_1_10 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L75] RET assume_abort_if_not(var_1_10 <= 64) VAL [isInitial=1, var_1_10=32, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L76] var_1_12 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L77] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L78] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L78] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L79] var_1_13 = __VERIFIER_nondet_long() [L80] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L80] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L81] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L81] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L82] var_1_14 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_14 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L83] RET assume_abort_if_not(var_1_14 >= -2147483648) VAL [isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L84] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L84] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L85] var_1_15 = __VERIFIER_nondet_long() [L86] CALL assume_abort_if_not(var_1_15 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L86] RET assume_abort_if_not(var_1_15 >= -2147483648) VAL [isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L87] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L87] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L100] RET updateVariables() [L101] CALL step() [L38] COND FALSE !(((var_1_12 - var_1_13) + var_1_14) <= (256.625 * ((((1.875) > (var_1_15)) ? (1.875) : (var_1_15))))) VAL [isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L41] COND TRUE \read(var_1_2) [L42] var_1_1 = ((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) VAL [isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=16, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L44] COND TRUE (var_1_1 == 16) || (var_1_11 < (10 / var_1_6)) [L45] var_1_5 = var_1_7 VAL [isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L49] unsigned char stepLocal_1 = var_1_11; [L50] unsigned char stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_1=16, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L51] COND TRUE stepLocal_0 || (var_1_11 >= var_1_11) VAL [isInitial=1, stepLocal_1=16, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=65] [L52] COND TRUE stepLocal_1 < ((var_1_9 - var_1_10) - 16) [L53] var_1_8 = ((((var_1_10) > (32)) ? (var_1_10) : (32))) VAL [isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=32, var_1_9=65] [L101] RET step() [L102] CALL, EXPR property() [L92-L93] return (((var_1_2 ? (var_1_1 == ((unsigned short int) ((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))))) : 1) && (((var_1_1 == 16) || (var_1_11 < (10 / var_1_6))) ? (var_1_5 == ((signed char) var_1_7)) : (var_1_5 == ((signed char) 5)))) && ((var_1_2 || (var_1_11 >= var_1_11)) ? ((var_1_11 < ((var_1_9 - var_1_10) - 16)) ? (var_1_8 == ((unsigned short int) ((((var_1_10) > (32)) ? (var_1_10) : (32))))) : 1) : (var_1_8 == ((unsigned short int) ((((var_1_9) < (var_1_11)) ? (var_1_9) : (var_1_11))))))) && ((((var_1_12 - var_1_13) + var_1_14) <= (256.625 * ((((1.875) > (var_1_15)) ? (1.875) : (var_1_15))))) ? (var_1_11 == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) ; VAL [\result=0, isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=32, var_1_9=65] [L102] RET, EXPR property() [L102] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=32, var_1_9=65] [L19] reach_error() VAL [isInitial=1, var_1_10=32, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=32, var_1_9=65] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.0s, OverallIterations: 9, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 740 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 740 mSDsluCounter, 3889 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2981 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1387 IncrementalHoareTripleChecker+Invalid, 1412 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 908 mSDtfsCounter, 1387 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=7, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 147 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 1307 NumberOfCodeBlocks, 1307 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1060 ConstructedInterpolants, 0 QuantifiedInterpolants, 3166 SizeOfPredicates, 0 NumberOfNonLiveVariables, 268 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 6120/6156 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 12:38:44,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-13.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 70056f6ecf6cc1e792a4daa4b0ef5828c715d2ed64331075caaff01f6900b2e4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:38:46,856 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:38:46,935 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 12:38:46,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:38:46,940 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:38:46,966 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:38:46,968 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:38:46,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:38:46,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:38:46,968 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:38:46,969 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:38:46,969 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:38:46,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:38:46,969 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:38:46,970 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:38:46,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:38:46,971 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:38:46,971 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:38:46,971 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:38:46,971 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:38:46,971 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:38:46,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:38:46,971 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:38:46,971 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 12:38:46,971 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 12:38:46,971 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 12:38:46,971 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:38:46,971 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:38:46,971 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:38:46,971 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:38:46,972 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:38:46,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:38:46,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:38:46,972 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:38:46,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:38:46,972 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:38:46,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:38:46,973 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:38:46,973 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:38:46,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:38:46,973 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:38:46,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:38:46,973 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:38:46,973 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:38:46,973 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 12:38:46,973 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 12:38:46,973 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:38:46,973 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:38:46,973 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:38:46,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:38:46,973 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 -> 70056f6ecf6cc1e792a4daa4b0ef5828c715d2ed64331075caaff01f6900b2e4 [2025-01-09 12:38:47,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:38:47,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:38:47,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:38:47,262 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:38:47,262 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:38:47,263 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-13.i [2025-01-09 12:38:48,492 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b67b889f0/be71c196c66d41a28d5f3324c3182c9d/FLAGaa127ab9d [2025-01-09 12:38:48,688 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:38:48,688 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-13.i [2025-01-09 12:38:48,695 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b67b889f0/be71c196c66d41a28d5f3324c3182c9d/FLAGaa127ab9d [2025-01-09 12:38:49,070 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b67b889f0/be71c196c66d41a28d5f3324c3182c9d [2025-01-09 12:38:49,074 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:38:49,075 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:38:49,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:38:49,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:38:49,080 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:38:49,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:38:49" (1/1) ... [2025-01-09 12:38:49,086 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@147e7a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:38:49, skipping insertion in model container [2025-01-09 12:38:49,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:38:49" (1/1) ... [2025-01-09 12:38:49,112 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:38:49,260 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-13.i[916,929] [2025-01-09 12:38:49,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:38:49,318 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:38:49,330 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-13.i[916,929] [2025-01-09 12:38:49,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:38:49,358 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:38:49,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:38:49 WrapperNode [2025-01-09 12:38:49,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:38:49,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:38:49,360 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:38:49,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:38:49,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:38:49" (1/1) ... [2025-01-09 12:38:49,370 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:38:49" (1/1) ... [2025-01-09 12:38:49,391 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2025-01-09 12:38:49,391 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:38:49,392 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:38:49,392 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:38:49,392 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:38:49,405 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:38:49" (1/1) ... [2025-01-09 12:38:49,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:38:49" (1/1) ... [2025-01-09 12:38:49,411 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:38:49" (1/1) ... [2025-01-09 12:38:49,428 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 12:38:49,428 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:38:49" (1/1) ... [2025-01-09 12:38:49,428 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:38:49" (1/1) ... [2025-01-09 12:38:49,433 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:38:49" (1/1) ... [2025-01-09 12:38:49,434 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:38:49" (1/1) ... [2025-01-09 12:38:49,435 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:38:49" (1/1) ... [2025-01-09 12:38:49,437 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:38:49" (1/1) ... [2025-01-09 12:38:49,437 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:38:49" (1/1) ... [2025-01-09 12:38:49,439 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:38:49,440 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:38:49,440 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:38:49,440 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:38:49,440 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:38:49" (1/1) ... [2025-01-09 12:38:49,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:38:49,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:38:49,470 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:38:49,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:38:49,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:38:49,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 12:38:49,494 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:38:49,494 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:38:49,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:38:49,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:38:49,554 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:38:49,556 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:38:55,099 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-01-09 12:38:55,099 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:38:55,105 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:38:55,105 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:38:55,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:38:55 BoogieIcfgContainer [2025-01-09 12:38:55,106 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:38:55,107 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:38:55,107 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:38:55,110 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:38:55,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:38:49" (1/3) ... [2025-01-09 12:38:55,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@749514d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:38:55, skipping insertion in model container [2025-01-09 12:38:55,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:38:49" (2/3) ... [2025-01-09 12:38:55,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@749514d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:38:55, skipping insertion in model container [2025-01-09 12:38:55,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:38:55" (3/3) ... [2025-01-09 12:38:55,111 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-13.i [2025-01-09 12:38:55,121 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:38:55,122 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-13.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:38:55,157 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:38:55,166 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;@5d4ba82a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:38:55,166 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:38:55,169 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 12:38:55,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 12:38:55,178 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:38:55,179 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:38:55,179 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:38:55,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:38:55,184 INFO L85 PathProgramCache]: Analyzing trace with hash 385391529, now seen corresponding path program 1 times [2025-01-09 12:38:55,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:38:55,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1702954997] [2025-01-09 12:38:55,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:38:55,193 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:38:55,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:38:55,203 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 12:38:55,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 12:38:55,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 12:38:55,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 12:38:55,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:38:55,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:38:55,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:38:55,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:38:55,427 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-01-09 12:38:55,428 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:38:55,428 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:38:55,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1702954997] [2025-01-09 12:38:55,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1702954997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:38:55,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:38:55,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:38:55,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748995213] [2025-01-09 12:38:55,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:38:55,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:38:55,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:38:55,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:38:55,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:38:55,451 INFO L87 Difference]: Start difference. First operand has 52 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 12:38:55,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:38:55,469 INFO L93 Difference]: Finished difference Result 98 states and 168 transitions. [2025-01-09 12:38:55,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:38:55,472 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 118 [2025-01-09 12:38:55,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:38:55,497 INFO L225 Difference]: With dead ends: 98 [2025-01-09 12:38:55,497 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 12:38:55,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:38:55,502 INFO L435 NwaCegarLoop]: 71 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, 71 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:38:55,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:38:55,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 12:38:55,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-09 12:38:55,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 12:38:55,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2025-01-09 12:38:55,530 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 118 [2025-01-09 12:38:55,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:38:55,530 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2025-01-09 12:38:55,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 12:38:55,531 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2025-01-09 12:38:55,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 12:38:55,532 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:38:55,533 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:38:55,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 12:38:55,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:38:55,734 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:38:55,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:38:55,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1264211017, now seen corresponding path program 1 times [2025-01-09 12:38:55,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:38:55,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4527108] [2025-01-09 12:38:55,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:38:55,736 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:38:55,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:38:55,738 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 12:38:55,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 12:38:55,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 12:38:56,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 12:38:56,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:38:56,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:38:56,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 12:38:56,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:38:56,154 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 12:38:56,154 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:38:56,154 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:38:56,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4527108] [2025-01-09 12:38:56,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [4527108] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:38:56,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:38:56,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:38:56,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805889743] [2025-01-09 12:38:56,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:38:56,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:38:56,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:38:56,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:38:56,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:38:56,156 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 12:38:58,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:39:00,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:39:00,502 INFO L93 Difference]: Finished difference Result 187 states and 275 transitions. [2025-01-09 12:39:00,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:39:00,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 119 [2025-01-09 12:39:00,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:39:00,522 INFO L225 Difference]: With dead ends: 187 [2025-01-09 12:39:00,523 INFO L226 Difference]: Without dead ends: 141 [2025-01-09 12:39:00,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:39:00,524 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 157 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:39:00,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 206 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-01-09 12:39:00,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-01-09 12:39:00,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2025-01-09 12:39:00,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 76 states have internal predecessors, (90), 57 states have call successors, (57), 3 states have call predecessors, (57), 3 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-01-09 12:39:00,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 204 transitions. [2025-01-09 12:39:00,560 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 204 transitions. Word has length 119 [2025-01-09 12:39:00,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:39:00,562 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 204 transitions. [2025-01-09 12:39:00,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 12:39:00,562 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 204 transitions. [2025-01-09 12:39:00,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 12:39:00,563 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:39:00,564 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:39:00,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 12:39:00,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:39:00,765 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:39:00,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:39:00,766 INFO L85 PathProgramCache]: Analyzing trace with hash 454864391, now seen corresponding path program 1 times [2025-01-09 12:39:00,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:39:00,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864040992] [2025-01-09 12:39:00,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:00,766 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:39:00,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:39:00,768 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 12:39:00,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 12:39:00,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 12:39:00,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 12:39:00,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:00,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:39:00,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 12:39:00,983 INFO L279 TraceCheckSpWp]: Computing forward predicates...